Impact of task duplication on static-scheduling performance in multiprocessor systems with variable execution-time tasks

Authors:
Emilio Luque;Ana Ripoll;Porfidio Hernández;Tomás Margalef
Affiliations:
Departamento de Informática, Universidad Autónoma De Barcelona, 08193-Bellaterra, Barcelona, Spain;Departamento de Informática, Universidad Autónoma De Barcelona, 08193-Bellaterra, Barcelona, Spain;Departamento de Informática, Universidad Autónoma De Barcelona, 08193-Bellaterra, Barcelona, Spain;Departamento de Informática, Universidad Autónoma De Barcelona, 08193-Bellaterra, Barcelona, Spain
Venue:
ICS '90 Proceedings of the 4th international conference on Supercomputing
Year:
1990

Citing 5
Cited 0

Heuristic Algorithms for Task Assignment in Distributed Systems

IEEE Transactions on Computers
Heuristic functions for static task allocation

Microprocessing and Microprogramming
Determining average program execution times and their variance

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Deterministic Processor Scheduling

ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of scheduling a set of partially ordered tasks on a nonpreemptive multiprocessor system of identical processors assuming that the execution time of some tasks can vary within a set of known values is studied in an effort to construct a more realistic static schedule.A new heuristic algorithm (CP/MISF/TD) based on task duplication is proposed. The effectiveness of the algorithm is proved by comparing the results obtained for a wide variety of task graphs with the ones obtained by applying the classical list scheduling algorithms which consider fixed time tasks.Keywords: Static scheduling, List scheduling, Heuristic algorithms, Task duplication, Multiprocessor systems.