Min-Cut Methods for Mapping Dataflow Graphs
Volker Elling,Karsten Schwan +1 more
- 31 Aug 1999
- pp 203-212
TL;DR: New mapping methods that compute near-min-cut partitions of the dataflow graph that deliver mappings that are an order of magnitude more efficient than those of DSC, a state-of-the-art critical-path algorithm, for sample high performance applications.
read more
Abstract: High performance applications and the underlying hardware platforms are becoming increasingly dynamic; runtime changes in the behavior of both are likely to result in inappropriate mappings of tasks to parallel machines during application execution. This fact is prompting new research on mapping and scheduling the dataflow graphs that represent parallel applications. In contrast to recent research which focuses on critical paths in dataflow graphs, this paper presents new mapping methods that compute near-min-cut partitions of the dataflow graph. Our methods deliver mappings that are an order of magnitude more efficient than those of DSC, a state-of-the-art critical-path algorithm, for sample high performance applications.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A novel partitioning and tracing approach for distributed systems based on vector clocks
Robert Hoettger,Burkhard Igel,Erik Kamsties +2 more
- 14 Nov 2013
TL;DR: A specific tracking mechanism via vector clocks for model and code partitioning purposes and the determination of causality relations is presented and a tracing approach for an effective analysis and thereby utilization of code and the corresponding architecture is introduced.
4
Min-Cut Methods for Mapping Dataflow Graphs
Volker Elling,Karsten Schwan +1 more
- 31 Aug 1999
TL;DR: New mapping methods that compute near-min-cut partitions of the dataflow graph that deliver mappings that are an order of magnitude more efficient than those of DSC, a state-of-the-art critical-path algorithm, for sample high performance applications.
References
•Book
Spectral Graph Theory
Fan Chung
- 03 Dec 1996
TL;DR: Eigenvalues and the Laplacian of a graph Isoperimetric problems Diameters and eigenvalues Paths, flows, and routing Eigen values and quasi-randomness
7.1K
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
George Karypis,Vipin Kumar +1 more
TL;DR: This work presents a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of theSize of the final partition obtained after multilevel refinement, and presents a much faster variation of the Kernighan--Lin (KL) algorithm for refining during uncoarsening.
An efficient heuristic procedure for partitioning graphs
Brian W. Kernighan,Shou-De Lin +1 more
TL;DR: A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
5.5K
Globus: a Metacomputing Infrastructure Toolkit
Ian Foster,Carl Kesselman +1 more
- 01 Jun 1997
TL;DR: The Globus system is intended to achieve a vertically integrated treatment of application, middleware, and net work, an integrated set of higher level services that enable applications to adapt to heteroge neous and dynamically changing metacomputing environ ments.
A Linear-Time Heuristic for Improving Network Partitions
Charles M. Fiduccia,R. M. Mattheyses +1 more
- 01 Jan 1982
TL;DR: An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network.
2.5K