On the benefits and limitations of dynamic partitioning in parallel computer systems
Author:
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 219-238
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies1994
- Processor allocation policies for message-passing parallel computers1994
- Robust partitioning policies of multiprocessor systemsPerformance Evaluation, 1994
- A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessorsACM Transactions on Computer Systems, 1993
- Performance analysis of job scheduling policies in parallel supercomputing environments1993
- The processor working set and its use in scheduling multiprocessor systemsIEEE Transactions on Software Engineering, 1991
- The impact of operating system scheduling policies and synchronization methods of performance of parallel applications1991
- Dynamic partitioning in a transputer environment1990
- Insensitivity of Steady-State Distributions of Generalized Semi-Markov Processes. Part IThe Annals of Probability, 1977
- Some Inequalities for Parallel-Server QueuesOperations Research, 1971