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
Design Tradeoffs for Process Scheduling in Shared Memory Multiprocessor Systems
IEEE Transactions on Software Engineering
The Performance Implications of Thread Management Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Computers
Practical experience of run-time link reconfiguration in a multi-transputer machine
Concurrency: Practice and Experience
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
Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Analysis of Fork-Join Program Response Times on Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Analysis of Contention in Multiprocessor Scheduling
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
To exploit multiple processors, a job is usually partitioned into several tasks that can be executed concurrently. These tasks wait for processors in task ready queue(s). There are two basic ways in which waiting ready tasks can be organized: centralized organization or distributed organization. In a centralized organization, a single central task queue is maintained. In the latter case, each processor has its own private ready queue of tasks. Ideally, a central ready queue global to all processors is desired over the distributed organization. However, the centralized organization is not suitable for large parallel systems because the global task queue could become a bottleneck. A hierarchical organization has been proposed to incorporate the good features of these two organizations. This paper studies the impact of job and task scheduling policies on the performance of the hierarchical organization.