Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Optimal partitioning of randomly generated distributed programs
IEEE Transactions on Software Engineering
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Performance Analysis of Parallel Processing Systems
IEEE Transactions on Software Engineering
Scheduling in multiprogrammed parallel systems
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Acyclic fork-join queuing networks
Journal of the ACM (JACM)
Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
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
Dynamic partitioning in a transputer environment
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Processor scheduling in shared memory multiprocessors
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The performance of multiprogrammed multiprocessor scheduling algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Munin: distributed shared memory based on type-specific memory coherence
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Processor-pool-based scheduling for large-scale NUMA multiprocessors
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analysis of task migration in shared-memory multiprocessor scheduling
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The Processor Working Set and its Use in Scheduling Multiprocessor Systems
IEEE Transactions on Software Engineering
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Performance analysis of job scheduling policies in parallel supercomputing environments
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
A performance evaluation of several priority policies for parallel processing systems
Journal of the ACM (JACM)
Scheduling on multiprogrammed, distributed memory parallel computers
Scheduling on multiprogrammed, distributed memory parallel computers
Analysis of Fork-Join Program Response Times on Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
A Comparative Analysis of Static Processor Partitioning Policies for Parallel Computers
MASCOTS '93 Proceedings of the International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
Multiprogramming on Multiprocessors
Multiprogramming on Multiprocessors
A case for reconfigurable parallel architectures for information retrieval
CIKM '94 Proceedings of the third international conference on Information and knowledge management
A closer look at coscheduling approaches for a network of workstations
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
The Penn State computing condominium scheduling system
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Coscheduling in Clusters: Is It a Viable Alternative?
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Journal of Parallel and Distributed Computing
A comprehensive performance and energy consumption analysis of scheduling alternatives in clusters
The Journal of Supercomputing
| Hi-index | 0.00 |
A main objective of scheduling independent jobs composed of multiple sequential tasks in shared-memory and distributed-memory multiprocessor computer systems is theassignment of these tasks to processors in a manner that ensures efficient operation ofthe system. Achieving this objective requires the analysis of a fundamental tradeoffbetween maximizing parallel execution, suggesting that the tasks of a job be spreadacross all system processors, and minimizing synchronization and communicationoverheads, suggesting that the job's tasks be executed on a single processor. Theauthors consider a class of scheduling policies that represent the essential aspects ofthis processor allocation tradeoff, and model the system as a distributed fork-joinqueueing system. They derive an approximation for the expected job response time,which includes the important effects of various parallel processing overheads (such astask synchronization and communication) induced by the processor allocation policy.