Article

Free access

Clustering task graphs for message passing architectures

Authors:

Apostolos Gerasoulis,

Sesh Venugopal,

Tao YangAuthors Info & Claims

ICS '90: Proceedings of the 4th international conference on Supercomputing

Pages 447 - 456

https://doi.org/10.1145/77726.255188

Published: 01 June 1990 Publication History

Abstract

Clustering is a mapping of the nodes of a task graph onto labeled clusters. We present a unified framework for clustering of directed acyclic graphs (DAGs). Several clustering algorithms from the literature are compared using this framework. For coarse grain DAGs two interesting properties are presented. For every nonlinear clustering there exists a linear clustering whose parallel time is less than the nonlinear one. Furthermore, the parallel time of any linear clustering is within a factor of two of the optimal. Two clustering algorithms are presented with near linear time complexity for coarse grain DAGs. The conclusion is that linear clustering is an efficient and accurate operation.

References

[1]

Ph. Chretienne. "Task Scheduling over Distributed Memory Machines." Report No. 253, 1988, Universite P. ET M. Curie, Laboratoire MASI, UA 818, 4 Place Jussie, 75252 Paris cedex 05, France.

[2]

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

[3]

K. Efe. "Heuristic Models of Task Assignment Scheduling in Distributed Systems." IEEE Com. purer, 15(6), 1982, pp.50-56.

Digital Library

[4]

A. George, M. T. Heath, J. Liu. "Parallel Cholesky Factorization on a Shared Memory Processor." Linear Algebra Appl., 77 (1986), pp. 165-187.

[5]

A. Gerasoulis, I. Nelken. "Static Scheduling for Linear Algebra DAGs." HCCA4 (1989).

[6]

A. Gerasoulis, Tao Yang. "A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors." Report, 1990.

[7]

A. Gerasoulis, Tao Yang. "Dominant Sequence Clustering Heuristic Algorithm for Multiprocessots." Report, 1990.

[8]

A. Gerasoulis, Tao Yang. "Properties of Linear Clustering for Directed Acyclic Task Graphs." Report, 1990.

[9]

A. Gerasoulis, S. Venugopal. "Linear Clustering of Lineal Algebra Task Graphs for Local Memory Systems." l~eport, 1990.

[10]

It. L. Graham. "Bounds on Multiprocessing Timing Anomalies." SIAM J. Applied Ma~h, 17(2) (1969), pp. 416-429.

[11]

H. Kasahara, S. Narita. "Practical Multi-processor Scheduling Algorithms for Efficient Parallel Processing." IEEE Trans. on Computers, C-33 (1984), pp. 1023-1029.

Digital Library

[12]

S.J. Kim. "A General Approach to Multiprocessor Scheduling." TR-88-O~, Dept. Computer Science, Univ. of Texas at Austin, 1988.

Digital Library

[13]

S. J. Kim, J. C. Browne. "A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures." Int'l. Conf. on Parallel Processing, 3(1988), pp. 1-8.

[14]

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

Digital Library

[15]

U. Manber. "Introduction To Algorithms." Addison Wesley, 1989.

Digital Library

[16]

C. McGreary, H. Gill. "Automatic Determination of Grain Size for Efficient Parallel Processing." CA CM 32 (1989), pp. 1073-1078.

Digital Library

[17]

J. M. Ortega. "Introduction to Parallel and Vector Solution of Linear Systems." Plenum, New York (gss).

Digital Library

[18]

C. Papadimitriou, M. Yannakakis. "Towards an Architecture-Independent Analysis of Parallel Algorithms." SIAM J. Comp~,~., 19 (1990), pp. 322- 328.

Digital Library

[19]

C. D. Polychronopoulos. "Parallel Programming and Compilers." Kluwer Academic Publishers, 1988.

Digital Library

[20]

V. Sarkar. ~Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors." The MIT Press, 1989.

Digital Library

[21]

H. Stone. "High-performance Computer Architectures." Addison- Wesley, 1987.

Digital Library

[22]

Wu Min-You, D. Gajski. "A Programming Aid for Hypercube Architectures." The Journal of Supercomputing, 2(1988), pp. 349-372.

[23]

W. H. Yu. "LU Decomposition on a Multiprocessing System with Communication Delay." PhD Thesis, Dept. of Elec. Engg. and Comp. Science, Univ. of California, Berkeley, 1984.

Digital Library

Cited By

Mrabet FKaramti WMahfoudhi A(2023)Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architecturesComputing10.1007/s00607-023-01237-y106:3(651-712)Online publication date: 6-Dec-2023
https://doi.org/10.1007/s00607-023-01237-y
Railing BHein EConte T(2015)ContechACM Transactions on Architecture and Code Optimization10.1145/277689312:2(1-24)Online publication date: 8-Jul-2015
https://dl.acm.org/doi/10.1145/2776893
Bathen LAhn YPasricha SDutt N(2013)MultiMaKeACM Transactions on Embedded Computing Systems10.1145/2435227.243525512:1s(1-25)Online publication date: 29-Mar-2013
https://dl.acm.org/doi/10.1145/2435227.2435255
Show More Cited By

Index Terms

Clustering task graphs for message passing architectures

Recommendations

Clustering task graphs for message passing architectures
Special Issue: Proceedings of the 4th international conference on Supercomputing

Clustering is a mapping of the nodes of a task graph onto labeled clusters. We present a unified framework for clustering of directed acyclic graphs (DAGs). Several clustering algorithms from the literature are compared using this framework. For coarse ...
On the Granularity and Clustering of Directed Acyclic Task Graphs

The authors consider the impact of the granularity on scheduling task graphs. Schedulingconsists of two parts, the processors assignment of tasks, also called clustering, and theordering of tasks for execution in each processor. The authors introduce ...
Message Passing Clustering (MPC): a knowledge-based framework for clustering under biological constraints

A new clustering algorithm, Message Passing Clustering (MPC), is proposed. MPC employs the concept of message passing to describe parallel and spontaneous clustering process by allowing data objects to communicate with each other. MPC also provides an ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

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

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

Copyright © 1990 ACM.

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]

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

IC'90

Sponsor:

SIGARCH

IC'90: ACM SIGARCH International Conference on Supercomputing

June 11 - 15, 1990

Amsterdam, The Netherlands

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
680
Total Downloads

Downloads (Last 12 months)49
Downloads (Last 6 weeks)12

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mrabet FKaramti WMahfoudhi A(2023)Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architecturesComputing10.1007/s00607-023-01237-y106:3(651-712)Online publication date: 6-Dec-2023
https://doi.org/10.1007/s00607-023-01237-y
Railing BHein EConte T(2015)ContechACM Transactions on Architecture and Code Optimization10.1145/277689312:2(1-24)Online publication date: 8-Jul-2015
https://dl.acm.org/doi/10.1145/2776893
Bathen LAhn YPasricha SDutt N(2013)MultiMaKeACM Transactions on Embedded Computing Systems10.1145/2435227.243525512:1s(1-25)Online publication date: 29-Mar-2013
https://dl.acm.org/doi/10.1145/2435227.2435255
Rosenberg A(2006)Changing Challenges for Collaborative AlgorithmicsHandbook of Nature-Inspired and Innovative Computing10.1007/0-387-27705-6_1(1-44)Online publication date: 2006
https://doi.org/10.1007/0-387-27705-6_1
Zhu MCai WLee BWu X(2005)A Hybrid Analysis of an Optimization Approach for Cluster ApplicationsThe Journal of Supercomputing10.1007/s11227-005-0157-732:3(191-215)Online publication date: 1-Jun-2005
https://dl.acm.org/doi/10.1007/s11227-005-0157-7
Ferrante JGrunwald DSrinivasan H(2005)Computing communication sets for control parallel programsLanguages and Compilers for Parallel Computing10.1007/BFb0025887(316-330)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0025887
Boeres CRebello V(2005)Versatile task scheduling of binary trees for realistic machinesEuro-Par'97 Parallel Processing10.1007/BFb0002834(913-921)Online publication date: 26-Sep-2005
https://doi.org/10.1007/BFb0002834
Auletta VNegro AScarano V(2005)Fast execution of irregularly structured programs with low communication frequency on the hypercubeParallel Algorithms for Irregularly Structured Problems10.1007/3-540-60321-2_4(59-73)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-60321-2_4
Nanda MChandra SSarkar V(2004)Decentralizing execution of composite web servicesACM SIGPLAN Notices10.1145/1035292.102899139:10(170-187)Online publication date: 1-Oct-2004
https://dl.acm.org/doi/10.1145/1035292.1028991
Nanda MChandra SSarkar VVlissides JSchmidt D(2004)Decentralizing execution of composite web servicesProceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications10.1145/1028976.1028991(170-187)Online publication date: 24-Oct-2004
https://dl.acm.org/doi/10.1145/1028976.1028991
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents