On the benefits and limitations of dynamic partitioning in parallel computer systems
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 219-238
- https://doi.org/10.1007/3-540-60153-8_31
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Scalability issues for a class of CFD applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policiesPublished by Association for Computing Machinery (ACM) ,1994
- Processor allocation policies for message-passing parallel computersPublished by Association for Computing Machinery (ACM) ,1994
- 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 environmentsPublished by Association for Computing Machinery (ACM) ,1993
- 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 applicationsPublished by Association for Computing Machinery (ACM) ,1991
- Dynamic partitioning in a transputer environmentPublished by Association for Computing Machinery (ACM) ,1990
- Some Inequalities for Parallel-Server QueuesOperations Research, 1971