article

Free access

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 MargalefAuthors Info & Claims

ACM SIGARCH Computer Architecture News, Volume 18, Issue 3b

Pages 439 - 446

https://doi.org/10.1145/255129.255186

Published: 01 June 1990 Publication History

PDF eReader

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.

References

[1]

M.R. Garcy and D. S. Johnson." Computers and Intractability: A Guide to the Theory of NP Completeness". San Francisco, CA: Freeman, 1979.

Digital Library

Google Scholar

[2]

E.G. Coffman (Ed.), "Computer and job-shop scheduling theory", John Wiley & Sons, N.Y.,1976.

Google Scholar

[3]

M.J. (;onz~ilcz, JR., "Deterministic Processor Scheduling". Computing Surveys, vol 9, No.3, September 1977.

Digital Library

Google Scholar

[4]

H. Kasahara and S. Narita "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing".IEEE Trans. on Comp. Vol. C-33 No.1 l,pp.1023-1029,Novcrnber 1984.

Digital Library

Google Scholar

[5]

B. Shirazi and M. Wang, "Heuristic Functions for Static Task Alloeation".Microprocessing and Microprogamming Vol. 26,pp. 187- t94, 1989.

Digital Library

Google Scholar

[6]

T.C. Hu, "Parallel Sequencing and Assembly line problem". Oper. Res., vol. 9, pp.841-848, Nov. 1961.

Digital Library

Google Scholar

[7]

V. Mary Lo. "Heuristic Algorithms for Task Assignmerit in Distributed Systems". IEEE Trans. on Comp. vol. 37, n~ 11, pp. 1384-1397, November 1988.

Digital Library

Google Scholar

[8]

V. Sarkar "Determining Average Program Execution Times and Their Variance".SIGPLAN89, Portland, Oregon, June 1989.

Digital Library

Google Scholar

[9]

P. Markcnscoff and W. Liaw. "Task AIloca|ion Problems in Distribuled Computer Systems". Proceedings of the International Conference on Parallel Processing. pp. 953-960, 1986.

Google Scholar

[10]

E.B. Fcrnfindez and B. Busscll, "Bounds on the Numbcrof Processors and Time for Multiprocessor Optimal Schedules". IEEE Trans. on Comp. C22,No. 8, pp745-751, August 1973.

Google Scholar

Cited By

View all

Ginis CJones D(1997)Static Scheduling Using Clustering and Task DuplicationIFAC Proceedings Volumes10.1016/S1474-6670(17)44477-630:3(119-124)Online publication date: Apr-1997
https://doi.org/10.1016/S1474-6670(17)44477-6
Fechner BHonig UKeller JSchiffmann W(2008)Fault-tolerant static scheduling for grids2008 IEEE International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2008.4536156(1-6)Online publication date: Apr-2008
https://doi.org/10.1109/IPDPS.2008.4536156
Darbha SAgrawal D(1994)A Task Duplication Based Optimal Scheduling Algorithm for Variable Execution Time TasksProceedings of the 1994 International Conference on Parallel Processing - Volume 0210.1109/ICPP.1994.47(52-56)Online publication date: 15-Aug-1994
https://dl.acm.org/doi/10.1109/ICPP.1994.47
Show More Cited By

Index Terms

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

Recommendations

Impact of task duplication on static-scheduling performance in multiprocessor systems with variable execution-time tasks
ICS '90: Proceedings of the 4th international conference on Supercomputing

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 ...
Scheduling Tasks with AND/OR Precedence Constraints

In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. We call such a task an AND task. In this paper we allow certain tasks to be ready when just one of their predecessors is complete. ...
Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

Optimal online scheduling algorithms are known for sporadic task systems scheduled upon a single processor. Additionally, optimal online scheduling algorithms are also known for restricted subclasses of sporadic task systems upon an identical ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News

ACM SIGARCH Computer Architecture News Volume 18, Issue 3b

Special Issue: Proceedings of the 4th international conference on Supercomputing

Sept. 1990

489 pages

ISSN:0163-5964

DOI:10.1145/255129

Chairmen:
Ahmed Sameh
Univ. of Illinois at Urbana-Champaign, Urbana
,
Henk van der Vorst
Delft Univ. of Technology and CWI, The Netherlands

Issue’s Table of Contents

ICS '90: Proceedings of the 4th international conference on Supercomputing
June 1990
492 pages
ISBN:0897913698
DOI:10.1145/77726
Chairmen:
Ahmed Sameh
Univ. of Illinois
,
Henk van der Vorst
Delft Univ. of Technology and CWI, The Netherlands

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1990

Published in SIGARCH Volume 18, Issue 3b

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
452
Total Downloads

Downloads (Last 12 months)92
Downloads (Last 6 weeks)19

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ginis CJones D(1997)Static Scheduling Using Clustering and Task DuplicationIFAC Proceedings Volumes10.1016/S1474-6670(17)44477-630:3(119-124)Online publication date: Apr-1997
https://doi.org/10.1016/S1474-6670(17)44477-6
Fechner BHonig UKeller JSchiffmann W(2008)Fault-tolerant static scheduling for grids2008 IEEE International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2008.4536156(1-6)Online publication date: Apr-2008
https://doi.org/10.1109/IPDPS.2008.4536156
Darbha SAgrawal D(1994)A Task Duplication Based Optimal Scheduling Algorithm for Variable Execution Time TasksProceedings of the 1994 International Conference on Parallel Processing - Volume 0210.1109/ICPP.1994.47(52-56)Online publication date: 15-Aug-1994
https://dl.acm.org/doi/10.1109/ICPP.1994.47
Luque ERipoll AMargalef THernandez P(1993)Static scheduling of parallel program graphs including loops[1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences10.1109/HICSS.1993.284073(526-535)Online publication date: 1993
https://doi.org/10.1109/HICSS.1993.284073

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations