Comparing Gang Scheduling with Dynamic Space Sharing on Symmetric Multiprocessors Using Automatic Self-Allocating Threads (ASAT)

Authors:
Charles Severance;Richard J. Enbody
Affiliations:
-;-
Venue:
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Year:
1997

Citing 4
Cited 5

Scheduler activations: effective kernel support for the user-level management of parallelism

SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Efficient scheduling on multiprogrammed shared-memory multiprocessors

Efficient scheduling on multiprogrammed shared-memory multiprocessors
Managing the overall balance of operating system threads on a multiprocessor using automatic self-allocating threads (ASAT)

Journal of Parallel and Distributed Computing - Special issue on multithreading for multiprocessors
Efficient Execution of Parallel Applications in Multiprogrammed Multiprocessor Systems

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium

Performance characteristics of gang scheduling in multiprogrammed environments

SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
An Effective Processor Allocation Strategy for Multiprogrammed Shared-Memory Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
An approach to resource-aware co-scheduling for CMPs

Proceedings of the 24th ACM International Conference on Supercomputing
Scalability-based manycore partitioning

Proceedings of the 21st international conference on Parallel architectures and compilation techniques
ADAPT: A framework for coscheduling multithreaded programs

ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work considers the best way to handle a diverse mix of multi-threaded and single-threaded jobs running on a single Symmetric Parallel Processing system. The traditional approaches to this problem are free scheduling, gang scheduling, or space sharing. This paper examines a less common technique called dynamic space sharing. One approach to dynamic space sharing, Automatic Self Allocating Threads (ASAT), is compared to all of the traditional approaches to scheduling a mixed load of jobs. Performance results for ASAT scheduling, gang scheduling, and free scheduling are presented. ASAT scheduling is shown to be the superior approach to mixing multi-threaded work with single threaded work.