C. L. McCreary, J. J. Thompson, D. H. Gill, T. J. Smith  Home/Search
Context Related
| auburn.edu/pub/techre...sched.icpp.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: auburn.edu/csse/research/publi... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Automated parallelization of source code is a goal on which many researchers in parallel computing have focused. The increasing availability of parallel computers, the difficulty of creating good parallel programs, and the vast amount of existing serial source code all contribute to the need for automated means of parallelization. This paper centers on the issues of partitioning and scheduling within automatic parallelization, or the creation of appropriately-sized tasks and their assignments... (Update)
Context of citations to this paper: More
...costs. One list scheduling method, the LAST algorithm, is included in this comparison study. ffl Graph decomposition method [17, 18]: Based on graph decomposition theory, the method parses a graph into a hierarchy (tree) of subgraphs representing the independent...
...a certain order. Task duplications have been used in [2, 14, 18] to reduce the communication costs. ffl Graph decomposition method [20, 21]: Based on graph decomposition theory, the method parses a graph into a hierarchy (tree) of subgraphs representing the independent...
Cited by: More
A Comparison of Multiprocessor Scheduling Heuristics - Khan, McCreary, Jones (1994) (Correct)
A Comparison of Heuristics for Scheduling DAGs on.. - McCreary, Khan.. (1994) (Correct)
The Problem With Critical Path Scheduling Algorithms - McCreary, Cleveland, Khan (Correct)
Active bibliography (related documents): More All
0.8: Partitioning for Parallelization Using Graph Parsing - McCreary (1991) (Correct)
0.5: Mapping Arbitrary Non-Uniform Task Graphs onto Arbitrary.. - Chen, Eshaghian, Wu (1995) (Correct)
0.3: Using Graph-Grammar Parsing for Automatic Graph Drawing - McCreary, Combs, Gill (Correct)
Similar documents based on text: More All
0.2: A Numerical Comparative Analysis of Partitioning.. - Khan, McCreary, Gong (Correct)
0.2: Incremental Graph Parsing - McCreary, Roth (Correct)
0.2: The Influence of the Threat of Flooding on Housing Values in.. - Fridgen, Shultz (1999) (Correct)
Related documents from co-citation: More All
4: Scheduling with Sufficient Loosely Coupled Processors (context) - Anger, Hwang et al. - 1990
4: Automatic Determination of Grain Size for Efficient Parallel Processing (context) - McGreary, Gill - 1989
4: Partitioning and Scheduling Parallel Programs for Multiprocessor (context) - Sarkar - 1989
BibTeX entry: (Update)
McCreary C., Thompson J., Gill H., Smith T., and Zhu Y. Partitioning and Scheduling Using Graph Decomposition. Department of Computer Science and Engineering CSE-93-06, Auburn University, 1993. http://citeseer.ist.psu.edu/mccreary93partitioning.html More
@misc{ mccreary93partitioning,
author = "C. McCreary and J. Thompson and H. Gill and T. Smith and Y. Zhu",
title = "Partitioning and Scheduling Using Graph Decomposition",
text = "McCreary C., Thompson J., Gill H., Smith T., and Zhu Y. Partitioning and
Scheduling Using Graph Decomposition. Department of Computer Science and
Engineering CSE-93-06, Auburn University, 1993.",
year = "1993",
url = "citeseer.ist.psu.edu/mccreary93partitioning.html" }
Citations (may not include all citations):247 Partitioning and Scheduling Parallel Programs for Multiproce.. (context) - Sarkar - 1989
151 Fundamentals of Computer Algorithms (context) - Horowitz, Sahni - 1984
112 NP-Complete Scheduling Problem (context) - Ullman - 1975
39 Automatic Determination of Grain Size for Efficient Parallel.. (context) - McCreary, Gill - 1989
12 A Comparison of Heuristics for Scheduling DAGs on Multiproce.. - McCreary, Khan et al. - 1994
7 Efficient Exploitation of Concurrency Using Graph Decomposit.. (context) - McCreary, Gill - 1990
6 An Algorithm for Parsing a Graph-Grammar (context) - McCreary - 1987
5 Theory of 2-structures, Part I: Clans, Basic Subclasses, and.. (context) - Ehrenfeucht, Rozenberg - 1990
3 Hypercube Communication Performance (context) - McCreary, McArdle et al. - 1992
2 Spatial-Temporal Analysis of Program Dependence Graphs for U.. (context) - Gill, Smith et al.
1 Partitioning for Parallelization Using Graph Parsing - McCreary - 1991
1 Multi-Level Communication Structure for Hierarchical Grain A.. (context) - Gill, Smith et al. - 1993
1 Shortest Path Evaluation for Hierarchical Grain Aggregation (context) - McCreary, Zhu - 1993
1 A Comparison of Task Partitioning Techniques (context) - McCreary, McArdle - 1991
Documents on the same site (http://www.eng.auburn.edu/csse/research/publications/): More
A Numerical Comparative Analysis of Partitioning.. - Khan, McCreary, Gong (Correct)
Empirical Studies of Animation-embedded Hypermedia .. - Hansen.. (1998) (Correct)
Graphical User Interface for a Collaborative Software Engineering .. - Simpson (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC