Journal ArticleDOI
Comparing Processor Allocation Strategies in Multiprogrammed Shared-Memory Multiprocessors
Kelvin K. Yue,David J. Lilja +1 more
Reads0
Chats0
TLDR
This study shows that dynamically partitioning the system using LLPC or similar heuristics provides better performance for applications with a high degree of parallelism than either gang scheduling or static space-sharing.About:
This article is published in Journal of Parallel and Distributed Computing.The article was published on 1998-03-15. It has received 9 citations till now. The article focuses on the topics: Gang scheduling & Coscheduling.read more
Citations
More filters
Journal ArticleDOI
An integrated approach to parallel scheduling using gang-scheduling, backfilling, and migration
TL;DR: The benefits of combining the various techniques that can be used beyond simple space-sharing to improve the performance of large parallel systems are shown over a spectrum of performance criteria.
Book ChapterDOI
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
TL;DR: It is demonstrated that, under certain conditions, a strategy that combines backfilling, gang-scheduling, and migration is always better than the individual strategies for all quality of service parameters that the authors consider.
Proceedings ArticleDOI
Improving parallel job scheduling by combining gang scheduling and backfilling techniques
TL;DR: This paper presents an integrated strategy that combines backfilling with gang scheduling, using extensive simulations based on detailed models of realistic workloads, and the benefits of combining back filling and gang scheduling are clearly demonstrated over a spectrum of performance criteria.
Book ChapterDOI
Job Scheduling for the BlueGene/L System
TL;DR: In this paper, the authors present simulation results for migration and backfilling techniques on a massively parallel cellular architecture system with a toroidal interconnect and demonstrate that migration can be effective for a pure first-come-first-served scheduler.
Book ChapterDOI
The Impact of Migration on Parallel Job Scheduling for Distributed Systems
TL;DR: It is found that migration can significantly improve these performance metrics over an important range of operating points and the effect of the cost of migrating tasks on overall system performance is analyzed.
References
More filters
Proceedings Article
The Art of Computer Systems Performance Analysis.
TL;DR: The authors' goal is always to offer you an assortment of cost-free ebooks too as aid resolve your troubles.
Book
The art of computer systems performance analysis
TL;DR: The art of computer systems performance analysis by is one of the most effective vendor publications worldwide as discussed by the authors. But have you had it? Not at all? Ridiculous of you.
Proceedings ArticleDOI
The impact of operating system scheduling policies and synchronization methods of performance of parallel applications
TL;DR: This paper uses detailed simulation studies to evaluate the performance of several different scheduling strategies, and shows that in situations where the number of processes exceeds thenumber of processors, regular priority-based scheduling in conjunction with busy-waiting synchronization primitives results in extremely poor processor utilization.
Proceedings ArticleDOI
The performance of multiprogrammed multiprocessor scheduling algorithms
TL;DR: It is found that the “smallest number of processes first” (SNPF) scheduling discipline performs poorly, and policies that allocate an equal fraction of the processing power to each job in the system perform better, on the whole, than policies that allocated processing power unequally.