Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Shibboleth (3)
- Authentication (2)
- Authorization (2)
- Grid computing (2)
- Subversion (2)
-
- Aerospace electronics (1)
- Approximation errors (1)
- C12 (1)
- C14 (1)
- C44 (1)
- Capacity planning (1)
- Case study (1)
- Circulating processor model (1)
- Cloud computing (1)
- Community Detection (1)
- Data Structures and Algorithms (1)
- Data curation (1)
- Data integration (1)
- Discrete-event simulation (1)
- Distributed systems (1)
- Domination number (1)
- Dynamic resource provisioning (1)
- Efficiency (1)
- Ergonomics (1)
- Evaluation; meta-HCI (1)
- Fine-Grained Access Control (1)
- Fine-grained access control (1)
- Frontier (1)
- Graph (1)
- Graph Partitioning (1)
Articles 31 - 38 of 38
Full-Text Articles in Entire DC Network
Cluster Computing In The Classroom: Topics, Guidelines, And Experiences, Amy Apon, Rajkumar Buyya, Hai Jin, Jens Mache
Cluster Computing In The Classroom: Topics, Guidelines, And Experiences, Amy Apon, Rajkumar Buyya, Hai Jin, Jens Mache
Publications
With the progress of research on cluster computing, more and more universities have begun to offer various courses covering cluster computing. A wide variety of content can be taught in these courses. Because of this, a difficulty that arises is the selection of appropriate course material. The selection is complicated by the fact that some content in cluster computing is also covered by other courses such as operating systems, networking, or computer architecture. In addition, the background of students enrolled in cluster computing courses varies. These aspects of cluster computing make the development of good course material difficult. Combining our …
Mpi Collective Operations Over Ip Multicast, Amy Apon, H A. Chen, Y O. Carrasco
Mpi Collective Operations Over Ip Multicast, Amy Apon, H A. Chen, Y O. Carrasco
Publications
Many common implementations of Message Passing Inter- face (MPI) implement collective operations over point-to-point operations. This work examines IP multicast as a framework for collective operations. IP multicast is not reliable. If a receiver is not ready when a message is sent via IP multicast, the message is lost. Two techniques for ensuring that a message is not lost due to a slow receiving process are examined. The techniques are implemented and compared experimentally over both a shared and a switched Fast Ethernet. The average performance of collective operations is improved as a function of the number of participating processes …
Evaluation Of Real-Time Fiber Communications For Parallel Collective Operations, Amy Apon, Parvathi Rajagopal
Evaluation Of Real-Time Fiber Communications For Parallel Collective Operations, Amy Apon, Parvathi Rajagopal
Publications
Real-Time Fiber Communications (RTFC) is a gigabit speed network that has been designed for damage tolerant local area networks. In addition to its damage tolerant characteristics, it has several features that make it attractive as a possible interconnection technology for parallel applications in a cluster of workstations. These characteristics include support for broadcast and multicast messaging, memory cache in the network interface card, and support for very fine grain writes to the network cache. Broadcast data is captured in network cache of all workstations in the network providing a distributed shared memory capability. In this paper, RTFC is introduced. The …
Load Dependent Single Chain Models Of Multichain Closed Queueing Networks, Amy Apon, Lawrence Dowdy
Load Dependent Single Chain Models Of Multichain Closed Queueing Networks, Amy Apon, Lawrence Dowdy
Publications
No abstract provided.
The Circulating Processor Model Of Parallel Systems, Amy Apon, Lawrence Dowdy
The Circulating Processor Model Of Parallel Systems, Amy Apon, Lawrence Dowdy
Publications
This paper introduces the circulating processor model for parallel computer systems. The circulating processor model is a product form queuing network model where the processors are allowed to circulate between the parallel applications instead of the more traditional circulating task model. Certain behaviors of parallel systems are better captured using this new approach. The circulating processor model may be load dependent or load dependent. The load dependent circulating processor model is exact for systems which contain a single parallel application. An exact error is calculated for the load independent circulating processor model for systems which contain a single parallel application. …
The Multigraph Modeling Tool, Amy Apon, C A. Childers, W H. Hooper, K D. Gordon, L W. Dowdy
The Multigraph Modeling Tool, Amy Apon, C A. Childers, W H. Hooper, K D. Gordon, L W. Dowdy
Publications
No abstract provided.
Measuring The Effects Of Thread Placement On The Kendall Square Ksr1, Amy Apon, T D. Wagner, E Smirni, M Madhukar, L W. Dowdy
Measuring The Effects Of Thread Placement On The Kendall Square Ksr1, Amy Apon, T D. Wagner, E Smirni, M Madhukar, L W. Dowdy
Publications
This paper describes a measurement study of the effects of thread placement on memory access times on the Kendall Square multiprocessor, the KSRl. The KSRl uses a conventional shared memory programming model in a distributed memory architecture. The architecture is based on a ring of rings of 64-bit superscalar microprocessors. The KSRl has a Cache-Only Memory Architecture (COMA). Memory consists of the local cache memoria attached to each processor. Whenever an address is accessed, the data item is automatically copied to the local cache memory module, 80 that access times for subsequent references will be minimal. If a local cache …
The Ksr1: Experimentation And Modeling Of Poststore, Amy Apon, E Rosti, E Smirni, T D. Wagner, M Madhukar, L W. Dowdy
The Ksr1: Experimentation And Modeling Of Poststore, Amy Apon, E Rosti, E Smirni, T D. Wagner, M Madhukar, L W. Dowdy
Publications
Kendall Square Research introduced the KSRl system in 1991. The architecture is based on a ring of rings of 64bit microprocessors. It is a distributed, shared memory system and is scalable. The memory structure is unique and is the key to understanding the system. Different levels of caching eliminates physical memory addressing and leads to the ALLCACHE TM scheme. Since requested data may be found in any of several caches, the initial access time is variable. Once pulled into the local (sub)cache, subsequent access times are fixed and minimal. Thus, the KSRl is a Cache-Only Memory Architecture (COMA) system. This …