Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
262,526
The Efficient Simulation of Parallel Computer Systems
- International Journal in Computer Simulation
, 1991
"... : -- An ongoing research project involves the design and evaluation of a software system for simulating parallel computers. A major goal in the development of this system was to avoid the high overhead associated with the conventional instruction-level simulation of sequential computers, but to reta ..."
Abstract
-
Cited by 62 (6 self)
- Add to MetaCart
: -- An ongoing research project involves the design and evaluation of a software system for simulating parallel computers. A major goal in the development of this system was to avoid the high overhead associated with the conventional instruction-level simulation of sequential computers
A Specification for a Highly Parallel Computer System
, 1991
"... A specification for a highly parallel computer system is presented. The specification is designed to facilitate acquisition of the highly parallel computer system through the use of a competitive procurement. The system specification is designed to cover all aspects of a production level supercomput ..."
Abstract
- Add to MetaCart
A specification for a highly parallel computer system is presented. The specification is designed to facilitate acquisition of the highly parallel computer system through the use of a competitive procurement. The system specification is designed to cover all aspects of a production level
Optimal Scheduling for Real-time Parallel Computer Systems
, 1996
"... Abstract: We will describe our ongoing work in the field of optimal scheduling for real-time systems. We are primarily concerned with optimal task allocation and job scheduling for parallel computer systems. Many realtime task allocation and job scheduling problems are proven to be NP-hard. Recently ..."
Abstract
- Add to MetaCart
Abstract: We will describe our ongoing work in the field of optimal scheduling for real-time systems. We are primarily concerned with optimal task allocation and job scheduling for parallel computer systems. Many realtime task allocation and job scheduling problems are proven to be NP
Utilizing Heterogeneous Networks in Distributed Parallel Computing Systems
- Proc. of the 6 th Int. Symposium on High Performance Computing
, 1997
"... Heterogeneity is becoming quite common in distributed parallel computing systems, both in processor architectures and in communication networks. For example, many distributed systems are now being constructed using a variety of different communication networks, such as Ethernet, ATM, Fibre Channel, ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
Heterogeneity is becoming quite common in distributed parallel computing systems, both in processor architectures and in communication networks. For example, many distributed systems are now being constructed using a variety of different communication networks, such as Ethernet, ATM, Fibre Channel
PVM: A Framework for Parallel Distributed Computing
- Concurrency: Practice and Experience
, 1990
"... The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It is intended to operate on a collection of heterogeneous computing elements interconnected by one or ..."
Abstract
-
Cited by 788 (27 self)
- Add to MetaCart
The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It is intended to operate on a collection of heterogeneous computing elements interconnected by one
The nas parallel benchmarks
- The International Journal of Supercomputer Applications
, 1991
"... A new set of benchmarks has been developed for the performance evaluation of highly parallel supercomputers. These benchmarks consist of ve \parallel kernel " benchmarks and three \simulated application" benchmarks. Together they mimic the computation and data movement characterist ..."
Abstract
-
Cited by 694 (9 self)
- Add to MetaCart
A new set of benchmarks has been developed for the performance evaluation of highly parallel supercomputers. These benchmarks consist of ve \parallel kernel " benchmarks and three \simulated application" benchmarks. Together they mimic the computation and data movement
On the Benefits and Limitations of Dynamic Partitioning in Parallel Computer Systems
- in Job Scheduling Strategies for Parallel Processing
, 1995
"... In this paper we analyze the benefits and limitations of dynamic partitioning across a wide range of parallel system environments. We formulate a general model of dynamic partitioning that can be fitted to measurement data to obtain a sufficiently accurate quantitative analysis of real parallel ..."
Abstract
-
Cited by 15 (5 self)
- Add to MetaCart
In this paper we analyze the benefits and limitations of dynamic partitioning across a wide range of parallel system environments. We formulate a general model of dynamic partitioning that can be fitted to measurement data to obtain a sufficiently accurate quantitative analysis of real parallel
Load balancing problems for multiclass jobs in distributed/parallel computer systems
- IEEE Trans. Comput
, 1998
"... Abstract—Load balancing problems for multiclass jobs in distributed/parallel computer systems with general network configurations are considered. We construct a general model of such a distributed/parallel computer system. The system consists of heterogeneous host computers/processors (nodes) which ..."
Abstract
-
Cited by 29 (11 self)
- Add to MetaCart
Abstract—Load balancing problems for multiclass jobs in distributed/parallel computer systems with general network configurations are considered. We construct a general model of such a distributed/parallel computer system. The system consists of heterogeneous host computers/processors (nodes) which
An Efficient Scheduling Algorithm for Multiprogramming on Parallel Computing Systems
, 1997
"... In conventional coscheduling, or gang scheduling of parallel workloads a round-robin queueing algorithm is adopted and the length of scheduling slots is fixed. However, the characteristics of parallel workloads can be quite different from sequential workloads. The system may not perform effectively ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
In conventional coscheduling, or gang scheduling of parallel workloads a round-robin queueing algorithm is adopted and the length of scheduling slots is fixed. However, the characteristics of parallel workloads can be quite different from sequential workloads. The system may not perform effectively
Results 1 - 10
of
262,526
