Communications of the ACM
On the behavior of algorithms in a multiprocessing environment
On the behavior of algorithms in a multiprocessing environment
Speedup Versus Efficiency in Parallel Systems
IEEE Transactions on Computers
Characterizations of parallelism in applications and their use in scheduling
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Multiprocessor performance
Operating Systems Theory
On the optimization of computer network power
On the optimization of computer network power
Concurrency in parallel processing systems (distributed, multiprocessing)
Concurrency in parallel processing systems (distributed, multiprocessing)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Performance analysis of dynamic load balancing algorithms with variable number of processors
Journal of Parallel and Distributed Computing
Profitable services in an uncertain world
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Moldable parallel job scheduling using job efficiency: an iterative approach
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Self-Organizing-Map-Based metamodeling for massive text data exploration
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
| Hi-index | 0.00 |
The authors model a job in a parallel processing system as a sequence of stages, each of which requires a certain integral number of processors for a certain interval of time. They derive the speedup of the system for two cases: systems with no arrivals, and systems with arrivals. In the case with no arrivals, their speedup result is a generalization of Amdahl's law (G.M. Amdahl, 1967). They extend the notion of power as previously applied to general queuing and computer-communication systems to their case of parallel processing systems. They find the optimal job input and the optimal number of processors to use so that power is maximized. Many of the results for the case of arrivals are the same as for the case of no arrivals. It is found that the average number of jobs in the system with arrivals equals unity when power is maximized. They also model a job in such a way that the number of processors required continuously varies over time. The same performance indices and parameters studied in the discrete model are evaluated for this continuous model.