Journal Article10.1137/0206014
Task Scheduling on a Multiprocessor System with Independent Memories
Dennis Kafura,V. Y. Shen +1 more
47
TL;DR: This paper considers a model of a computing system with several independent but identical processors, each with a private memory of limited, and possibly different, storage capacity, and an optimal preemptive algorithm is given to find the shortest schedule for a task set with no precedence constraints.
read more
Abstract: This paper considers a model of a computing system with several independent but identical processors, each with a private memory of limited, and possibly different, storage capacity. The tasks are assumed to have known resource demands expressed as processing times and memory requirements. Several scheduling strategies are evaluated by worst-case performance bounds and simulation results. Both preemptive and nonpreemptive scheduling are considered. An optimal preemptive algorithm is given to find the shortest schedule for a task set with no precedence constraints.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Models of machines and computation for mapping in multicomputers
Michael G. Norman,Peter Thanisch +1 more
TL;DR: In this article, the authors classified the mapping strategies for distributed computation across the computation resources of multiprocessor systems and assessed the relevance of a new result to a particular problem.
193
Scheduling with processing set restrictions: A survey
Joseph Y.-T. Leung,Chung Lun Li +1 more
TL;DR: This paper surveys the state of the art of scheduling problems with processing set restrictions, focusing on polynomial-time algorithms, complexity issues, and approximation schemes.
165
Business Analytics for Flexible Resource Allocation Under Random Emergencies
Mallik Angalakudati,Siddharth Balwani,Jorge Calzada,Bikram Chatterjee,Georgia Perakis,Nicolas Raad,Joline Uichanco +6 more
TL;DR: A novel decomposition approach that solves a major operational resource allocation challenge that is typical to the industry and uses models and heuristics to develop a decision support tool that is being piloted in one of the utility's sites.
Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
TL;DR: A deterministic approach to the preemptive scheduling of independent tasks, which takes into account primary memory allocation in multiprocessor systems with virtual memory and a common primary memory is proposed.
42
References
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
Bounds on Multiprocessing Timing Anomalies
TL;DR: An apparatus for generating sparks over a selected area to be used for theatrical effects.
2.6K
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
TL;DR: This work examines the performance of a number of simple algorithms which obtain “good” placements and shows that neither the first-fit nor the best-fit algorithm will ever use more than $\frac{17}{10}L^ * + 2$ bins.
1K
Parallel Sequencing and Assembly Line Problems
TL;DR: This paper deals with a new sequencing problem in which n jobs with ordering restrictions have to be done by men of equal ability, and how to arrange a schedule that requires the minimum number of men to complete all jobs within a prescribed time T.
946
Optimal scheduling for two-processor systems
Edward G. Coffman,Ron Graham +1 more
TL;DR: It is proved that the algorithm gives optimal solutions and its application to preemptive scheduling disciplines is discussed.
623