Stochastic analysis of gang scheduling in parallel and distributed systems
Authors:
- Mark S. SquillanteMSMark S. Squillante
- Fang WangFWFang Wang
- Marios PapaefthymiouMPMarios Papaefthymiou
- 1 October 1996
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 27-28, 273-296
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Polling systems with server timeouts and their application to token passing networksIEEE/ACM Transactions on Networking, 1995
- Robust partitioning policies of multiprocessor systemsPerformance Evaluation, 1994
- A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessorsACM Transactions on Computer Systems, 1993
- Gang scheduling performance benefits for fine-grain synchronizationJournal of Parallel and Distributed Computing, 1992
- The processor working set and its use in scheduling multiprocessor systemsIEEE Transactions on Software Engineering, 1991
- Distributed hierarchical control for parallel processingComputer, 1990
- Insensitivity of steady-state distributions of generalized semi-Markov processes by speedsAdvances in Applied Probability, 1978
- Insensitivity of Steady-state Distributions of Generalized Semi-Markov Processes. Part IIThe Annals of Probability, 1978
- Insensitivity of Steady-State Distributions of Generalized Semi-Markov Processes. Part IThe Annals of Probability, 1977
- A Proof for the Queuing Formula: L = λWOperations Research, 1961