Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Authors:
Ellis Horowitz;Sartaj Sahni
Affiliations:
Computer Science Program, University of Southern California, Los Angeles, CA;Department of Computer, Information and Control Sciences, University of Minnesota, 114 Main Engineering Building, Minneapolis, MN
Venue:
Journal of the ACM (JACM)
Year:
1976

Citing 6
Cited 94

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

Journal of the ACM (JACM)
Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Polynomial complete scheduling problems

SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles

Scheduling parallelizable tasks: putting it all on the shelf

SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Algorithmic mechanism design (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Improved approximation schemes for scheduling unrelated parallel machines

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
When does a dynamic programming formulation guarantee the existence of an FPTAS?

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of designing optimal partial-match retrieval systems

ACM Transactions on Database Systems (TODS)
P-Complete Approximation Problems

Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors

Journal of the ACM (JACM)
&egr;-optimization schemes and L-bit precision (extended abstract): alternative perspectives in combinatorial optimization

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Co-synthesis of heterogeneous multiprocessor systems using arbitrated communication

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Teaching students to use genetic algorithms to solve optimization problems

Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges
Temporary tasks assignment resolved

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Scheduling Unrelated Parallel Machines in Parallel

Computational Optimization and Applications
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

Journal of Heuristics
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness

Journal of Heuristics
Off-line temporary tasks assignment

Theoretical Computer Science
Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling

IEEE Transactions on Parallel and Distributed Systems
Conventional and Multirecombinative Evolutionary Algorithms for the Parallel Task Scheduling Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
All-Norm Approximation Algorithms

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Task Distributions on Multiprocessor Systems

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Grouping Techniques for Scheduling Problems: Simpler and Faster

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hardware configuration selection through discretizing a continuous variable solution

PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Scheduling of tasks for distributed processors

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
On Test Scheduling for Core-Based SOCs

ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Scheduling problems on two sets of identical machines

Computing
Computing Nash equilibria for scheduling on restricted parallel links

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An accurate parallel genetic algorithm to schedule tasks on a cluster

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
All-norm approximation algorithms

Journal of Algorithms
Convex programming for scheduling unrelated parallel machines

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Automated Custom Instruction Generation for Domain-Specific Processor Acceleration

IEEE Transactions on Computers
A sufficient condition for truthfulness with single parameter agents

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Structure and complexity of extreme Nash equilibria

Theoretical Computer Science - Game theory meets theoretical computer science
Graph orientation algorithms to minimize the maximum outdegree

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Approximation schemes for scheduling and covering on unrelated machines

Theoretical Computer Science
Reconfiguration in network of embedded systems: Challenges and adaptive tracking case study

Journal of Embedded Computing - Real-Time and Embedded Computing Systems
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

Theoretical Computer Science
Approximation schemes for a class of subset selection problems

Theoretical Computer Science
Graph balancing: a special case of scheduling unrelated parallel machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fully polynomial time approximation schemes for stochastic dynamic programs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Makespan minimization for multiple uniform machines

Computers and Industrial Engineering
Load balancing in large-scale RFID systems

Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation algorithms for scheduling unrelated parallel machines

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Planning production using mathematical programming: The case of a woodturning company

Computers and Operations Research
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan

Information Processing Letters
Tighter approximation bounds for LPT scheduling in two special cases

Journal of Discrete Algorithms
Optimal collusion-resistant mechanisms with verification

Proceedings of the 10th ACM conference on Electronic commerce
An approximation algorithm for scheduling on heterogeneous reconfigurable resources
Exact and approximate algorithms for high-multiplicity parallel machine scheduling

Journal of Scheduling
Dynamic heuristics for the generalized job-shop scheduling problem

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Improved approximation algorithms for minimum-space advertisement scheduling

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Size-reduction heuristics for the unrelated parallel machines scheduling problem

Computers and Operations Research
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning

Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Semi-online scheduling with known maximum job size on two uniform machines

Journal of Combinatorial Optimization
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research
Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid

ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables

SIAM Journal on Discrete Mathematics
Santa Claus schedules jobs on unrelated machines

Proceedings of the forty-third annual ACM symposium on Theory of computing
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

Journal of Combinatorial Optimization
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Fast monotone 3-approximation algorithm for scheduling related machines

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Fair cost-sharing methods for scheduling jobs on parallel machines

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Tighter approximation bounds for LPT scheduling in two special cases

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Data sharing conscious scheduling for multi-threaded applications on SMP machines

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Truthful approximation mechanisms for scheduling selfish related machines

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Multicriteria global minimum cuts

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Approximation algorithms for min-max and max-min resource sharing problems, and applications

Efficient Approximation and Online Algorithms
Approximation algorithms for scheduling and packing problems

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Scheduling jobs on identical and uniform processors revisited

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
The price of anarchy for minsum related machine scheduling

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Unrelated parallel machine scheduling using local search

Mathematical and Computer Modelling: An International Journal
A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

Mathematical and Computer Modelling: An International Journal
ε-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems

Discrete Optimization
Improving the complexities of approximation algorithms for optimization problems

Operations Research Letters
Worst-case analysis of a scheduling algorithm

Operations Research Letters
An optimal rounding gives a better approximation for scheduling unrelated machines

Operations Research Letters
Multi-dimensional packing with conflicts

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A lower bound of 1 + ϕ for truthful scheduling mechanisms

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Real-time scheduling with resource sharing on uniform multiprocessors

Proceedings of the 20th International Conference on Real-Time and Network Systems
Solving very large instances of the scheduling of independent tasks problem on the GPU

Journal of Parallel and Distributed Computing
Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

Real-Time Systems
A family of heuristics for agent-based elastic Cloud bag-of-tasks concurrent scheduling

Future Generation Computer Systems
Approximate strong equilibria in job scheduling games with two uniformly related machines

Discrete Applied Mathematics
Graph orientation algorithms to minimize the maximum outdegree

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Moderately exponential approximation for makespan minimization on related machines

Theoretical Computer Science
Supporting soft real-time parallel applications on multiprocessors

Journal of Systems Architecture: the EUROMICRO Journal
Computational complexity and approximability of social welfare optimization in multiagent resource allocation

Autonomous Agents and Multi-Agent Systems
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation

Annals of Mathematics and Artificial Intelligence
Real-time scheduling with resource sharing on heterogeneous multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Exact and approximate algorithms are presented for scheduling independent tasks in a multiprocessor environment in which the processors have different speeds. Dynamic programming type algorithms are presented which minimize finish time and weighted mean flow time on two processors. The generalization to m processors is direct. These algorithms have a worst-case complexity which is exponential in the number of tasks. Therefore approximation algorithms of low polynomial complexity are also obtained for the above problems. These algorithms are guaranteed to obtain solutions that are close to the optimal. For the case of minimizing mean flow time on m-processors an algorithm is given whose complexity is O(n log mn).