Article

Free access

A fast static scheduling algorithm for DAGs on an unbounded number of processors

Authors:

Tao Yang,

Apostolos GerasoulisAuthors Info & Claims

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

Pages 633 - 642

https://doi.org/10.1145/125826.126138

Published: 01 August 1991 Publication History

PDF eReader

References

[1]

F. D. Anger, J. Hwang, and Y. Chow, " Scheduling with Sufficient Loosely Coupled Processors," Journal of Parallel and Distributed Computing, vol. 9, pp. 87-92, 1990.

Digital Library

Google Scholar

[2]

Fh. Chretienne, "Task Scheduling over Distributed Memory Machines," Proceedings of lhe International Workshop on Parallel and Dis- ~ributed Algorithms, North Holland, 1989.

Google Scholar

[3]

P h. Chretienne, " A Polynomial Algorithm to Optimally Schedule Tasks over an ideal Distributed System under Tree-like Precedence Constraints," European Journal of Operational Research, Vol. 2:43, pp. 225-230, 1989.

Google Scholar

[4]

Ph. Chretienne, Complexity of Tree Scheduling with Interprocessor Communication Delays, tLeport, M.A.S.I. 90.5, Universite Pierre et Marie Curie, 1990.

Google Scholar

[5]

J. Y. Colin and Ph. Chretienne, C.P.M. Scheduling wi~h Small Communication Delays and Task Duplicagion, Report, M.A.S.I. 90.1, Universite Pierre et Marie Curie, 1990.

Google Scholar

[6]

M. Cosnard, M. Marrakchi, Y. Robert, and D. Trystram, " Parallel Gaussian Elimination on an MIMD Computer," Parallel Compuging, Vol. 6, pp. 275-296, 1988.

Crossref

Google Scholar

[7]

M. R. Garey and D.S. Johnson, Computers and Intractability, A Guide ~o ~he Theory of NP-completeness, W.H. Freeman and Company, 1979.

Digital Library

Google Scholar

[8]

G. A. Geist and M.T. Heath, " Matrix Factorization on a Hypercube Multiprocessor," Hypercube Multiprocessors, SIAM, pp. 161-180, 1986.

Google Scholar

[9]

A. Gerasoulis and I. Nelken, "Static Scheduling for Linear Algebra DAGs," Proceedings of $he Fourth Conference on Hypercubes, Monterey, Vol. 1, pp. 671-674, 1989.

Google Scholar

[10]

A. Gerasoulis, S. Venugopal, and T. Yang, "Clustering Task Graphs for Message Passing Architectures," Proceedings of A CM International Conference on Supercomputing, Amsterdam, pp. 447- 456, 1990.

Digital Library

Google Scholar

[11]

A. Gerasoulis and T. Yang, On ghe Granularity and Clustering of Directed Acyclic Task Graphs, TIL-153, Dept. of Computer Science, tLutgers Univ., 1990.

Google Scholar

[12]

A. Gerasoulis and T. Yang, A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors, Report, Dept. of Computer Science, Rutgers Univ., August 1991.

Google Scholar

[13]

M. Girkar and C. Polychronopoulos, "Partitioning Programs for Parallel Execution," Pc'oceedings of the 1988 A GM International Conference on Supercompu~ing, St. Malo, France, July 4-8, 1988.

Digital Library

Google Scholar

[14]

R. L. Graham, " Bounds on Multiprocessing Timing Anomalies," SIAM J. Appl. Ma~h., vol. 17, pp. 416-429, 1969.

Crossref

Google Scholar

[15]

J. K. Lenstra and A. H. G. tLinnooy Kan, " Complexity of Scheduling under Precedence Constraints," Operation Research, Vol. 26:1, 1978.

Digital Library

Google Scholar

[16]

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

Google Scholar

[17]

S. J. Kim, A General Approach to Multiprocessot Scheduling, TR-88-04, DCS, Univ. of Texas at Austin, 1988.

Digital Library

Google Scholar

[18]

S. J. Kim and 3.C Browne, "A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures," International Conference on Parallel Processing, vol 3, pp. 1-8, 1988.

Google Scholar

[19]

B. Kruatrachue and T. Lewis, "Grain Size Determination for Parallel Processing," IEEE Softwave, pp. 23-32, Jan. 1988.

Digital Library

Google Scholar

[20]

S. Y. Kung, VLSI Array Processors, Prentice Hall, 1988.

Digital Library

Google Scholar

[21]

J. M. Ortega, Introduction to Parallel and Vector Solution of Linear Systems, Plenum, 1988.

Digital Library

Google Scholar

[22]

C. Papadimitriou and M. Yannakakis, "Towards on an Architecture-Independent Analysis of Parallel Algorithms," SIAM J. Comput., Vol. 19, pp. 322-328, 1990.

Digital Library

Google Scholar

[23]

C. Picouleau, Two new NP-Complete Scheduling Problems with Communication Delays and Unlimited Number of Processors, M.A.S.I, Universite Pierre et Marie Curie Tour 45-46 B314, 4, place 3ussieu, 75252 Paris Cedex 05, France, 1991.

Google Scholar

[24]

Y. Saad, "Gaussian Elimination on Hypercubes," Parallel Algorithms and Architectures, Cosnard, M. et al. Eds., Elsevier Science Publishers, North- Holland, 1986.

Digital Library

Google Scholar

[25]

V. Sarkar, Par$itioning and Scheduling Parallel Programs for Execution on Multiprocessors, The MIT Press, 1989.

Digital Library

Google Scholar

[26]

H. Stone, High-Performance Computer Architectures, Addison-Wesley, 1987.

Digital Library

Google Scholar

[27]

T. Yang and A. Gerasoulis, Dominant Sequence Clustering Heuristic Algorithm for Scheduling DA Gs on Multiprocessor, Report, Dept. of Computer Science, Rutgers Univ., 1991.

Google Scholar

[28]

Min-You Wu and D. Gajski, "A Programming Aid for Hypcrcubc Architectures," The Journal of Supercomputing, Vol. 2, pp. 349-372, 1988.

Crossref

Google Scholar

Cited By

View all

Zhou YLi XLuo JYuan MZeng JYao J(2022)Learning to Optimize DAG Scheduling in Heterogeneous Environment2022 23rd IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM55031.2022.00040(137-146)Online publication date: Jun-2022
https://doi.org/10.1109/MDM55031.2022.00040
Jääskeläinen PKorhonen VKoskela MTakala JEgiazarian KDanielyan ACruz CPrice JMcintosh-Smith S(2019)Exploiting Task Parallelism with OpenCLJournal of Signal Processing Systems10.1007/s11265-018-1416-191:1(33-46)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s11265-018-1416-1
Maurya ATripathi A(2019)ECPComputing10.1007/s00607-018-0636-3101:8(1015-1039)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s00607-018-0636-3
Show More Cited By

Index Terms

Recommendations

Scheduling DAGs on asynchronous processors
SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
This paper addresses the problem of scheduling a DAG of unit-length tasks on asynchronous processors, that is, processors having different and changing speeds. The objective is to minimize the makespan, that is, the time to execute the entire DAG. ...
A Fast Algorithm for Scheduling Time-Constrained Instructions on Processors with ILP
PACT '98: Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques

Instruction scheduling is central to achieving performance in modern processors with instruction level parallelism (ILP). Classical work in this area has spanned the theoretical foundations of algorithms for instruction scheduling with provable ...
A Fast Algorithm for Scheduling Instructions with Deadline Constraints on RISC Processors
PACT '00: Proceedings of the 2000 International Conference on Parallel Architectures and Compilation Techniques

We present a fast algorithm for scheduling UET (Unit Execution Time) instructions with deadline constraints in a basic block on RISC machines with multiple processors. Unlike Palem and Simon's algorithm, our algorithm allows latency of lij = -1 which ...

Comments

Information & Contributors

Information

Published In

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

August 1991

920 pages

ISBN:0897914597

DOI:10.1145/125826

Conference Chair:
Ray Elliott

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 August 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '91

Sponsor:

SIGARCH
IEEE-CS

SC '91: International Conference for High Performance Computing, Networking, Storage and Analysis

November 18 - 22, 1991

New Mexico, Albuquerque, USA

Acceptance Rates

Supercomputing '91 Paper Acceptance Rate 83 of 215 submissions, 39%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
587
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhou YLi XLuo JYuan MZeng JYao J(2022)Learning to Optimize DAG Scheduling in Heterogeneous Environment2022 23rd IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM55031.2022.00040(137-146)Online publication date: Jun-2022
https://doi.org/10.1109/MDM55031.2022.00040
Jääskeläinen PKorhonen VKoskela MTakala JEgiazarian KDanielyan ACruz CPrice JMcintosh-Smith S(2019)Exploiting Task Parallelism with OpenCLJournal of Signal Processing Systems10.1007/s11265-018-1416-191:1(33-46)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s11265-018-1416-1
Maurya ATripathi A(2019)ECPComputing10.1007/s00607-018-0636-3101:8(1015-1039)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s00607-018-0636-3
Ammar MBaklouti MPelcat MDesnos KAbid M(2018)Comparing Three Clustering-based Scheduling Methods for Energy-Aware Rapid Design of MP2SoCsJournal of Signal Processing Systems10.5555/3200212.320022290:4(537-570)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.5555/3200212.3200222
Mallach S(2018)Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delaysJournal of Combinatorial Optimization10.1007/s10878-017-0199-936:3(871-895)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s10878-017-0199-9
Maurya ATripathi A(2018)An edge priority‐based clustering algorithm for multiprocessor environmentsConcurrency and Computation: Practice and Experience10.1002/cpe.506031:11Online publication date: 3-Dec-2018
https://doi.org/10.1002/cpe.5060
Ammar MBaklouti MPelcat MDesnos KAbid M(2017)Comparing Three Clustering-based Scheduling Methods for Energy-Aware Rapid Design of MP2SoCsJournal of Signal Processing Systems10.1007/s11265-017-1261-790:4(537-570)Online publication date: 14-Aug-2017
https://doi.org/10.1007/s11265-017-1261-7
Sahni JVidyarthi D(2016)Workflow-and-Platform Aware task clustering for scientific workflow execution in Cloud environmentFuture Generation Computer Systems10.1016/j.future.2016.05.00864:C(61-74)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1016/j.future.2016.05.008
Wu FWu QTan Y(2015)Workflow scheduling in cloudThe Journal of Supercomputing10.1007/s11227-015-1438-471:9(3373-3418)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1007/s11227-015-1438-4
Yang TGerasoulis A(2014)PYRROSACM International Conference on Supercomputing 25th Anniversary Volume10.1145/2591635.2667165(163-172)Online publication date: 10-Jun-2014
https://dl.acm.org/doi/10.1145/2591635.2667165
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Scheduling DAGs on asynchronous processors

A Fast Algorithm for Scheduling Time-Constrained Instructions on Processors with ILP

A Fast Algorithm for Scheduling Instructions with Deadline Constraints on RISC Processors

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Scheduling DAGs on asynchronous processors

A Fast Algorithm for Scheduling Time-Constrained Instructions on Processors with ILP

A Fast Algorithm for Scheduling Instructions with Deadline Constraints on RISC Processors

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations