C.L. McCreary  Home/Search
Context Related
| auburn.edu/pub/techrepo...TR9117.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: This paper presents a graph-theoretic scheme for partitioning and scheduling a computation for efficient parallel execution. The technique parses a graph into a hierarchy of subgraphs known as clans that can be identified as able or unable to support parallel execution. The technique is known as clan-based graph decomposition and will be referred to as CGD. Unlike standard graph partitioning techniques, CGD considers the structure of the entire graph and bases parallelization decisions on this... (Update)
Context of citations to this paper: More
...such that every element not in the subset is related in the same way (i.e. ancestor, descendent, or neither) to each member in the subset. [6] Clans are identified as trivial, independent, linear, or primitive, where each single node is a trivial clan, and primitive clans...
Cited by: More
Partitioning and Scheduling Using Graph Decomposition - McCreary, Thompson, Gill.. (1993) (Correct)
Similar documents (at the sentence level):
5.3%: Using Graph-Grammar Parsing for Automatic Graph Drawing - McCreary, Combs, Gill (Correct)
Active bibliography (related documents): More All
0.6: Static Scheduling Algorithms for Allocating Directed Task.. - Kwok, Ahmad (1998) (Correct)
0.4: NLC_2-Decomposition In Polynomial Time - Johansson (1999) (Correct)
0.4: Using Graph Parsing for Automatic Graph Drawing - C.L. McCreary, Fwu-Shan Shieh (1998) (Correct)
Similar documents based on text: More All
0.3: Incremental Graph Parsing - McCreary, Roth (Correct)
0.2: A Graph Parsing Algorithm and Implementation - McCreary, Reed (1993) (Correct)
0.2: A Comparison of Multiprocessor Scheduling Heuristics - Khan, McCreary, Jones (1994) (Correct)
BibTeX entry: (Update)
McCreary, C.L., "Partitioning for Parallelization Using Graph Parsing", Technical Report CSE-TR-91-17, Auburn University, 1991. http://citeseer.ist.psu.edu/mccreary91partitioning.html More
@techreport{ mccreary91partitioning,
author = "C. L. McCreary",
title = "Partitioning for Parallelization Using Graph Parsing",
number = "CSE91-17",
year = "1991",
url = "citeseer.ist.psu.edu/mccreary91partitioning.html" }
Citations (may not include all citations):480 The Program Dependence Graph and Its Use in Optimization (context) - Ferrante, Ottenstein et al. - 1987
352 Supercompilers for Parallel and Vector Computers (context) - Zima - 1990
247 Partitioning and Scheduling Parallel Programs for Multiproce.. (context) - Sarkar - 1989
116 Towards an Architecture-Independent Analysis of Parallel Alg.. (context) - Papadimitriou, Yannakakis - 1988
72 A More Practical PRAM Model (context) - Gibbons - 1989
72 the Mapping Problem (context) - Bokari - 1981
69 A General Approach to Mapping of Parallel Computations Upon .. (context) - Kim, Browne - 1988
68 the Granularity and Clustering of Directed Acyclic Task Grap.. - Gerasoulis, Yang - 1990
39 Automatic Determination of Grain Size for Efficient Parallel.. (context) - McCreary, Gill - 1989
22 Incremental Modular Decomposition (context) - Muller, Spinrad - 1989
22 Allocating Programs Containing Branches and Loops Within a M.. (context) - Towsley - 1986
16 Experience with an Automatic Solution to the Mapping Problem (context) - Berman - 1987
15 The LAST Algorithm: A Heuristic-Based Static Task Allocation.. (context) - Baxter, Patel - 1989
14 The Characteristics of Parallel Algorithms (context) - Jamieson, Gannon et al. - 1987
12 Parallelism Detection and Transformation Techniques Useful f.. (context) - Fortes, Moldovan - 1985
9 Communication Efficient Parallel Graph Algorithms (context) - Maggs - 1986
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
4 Theory of 2-Structures, Part II: Representation Through Labe.. (context) - Ehrenfeucht, Rozenberg - 1990
3 Hypercube Communication Performance (context) - McCreary, McArdle et al.
2 Optimal and Near Optimal Tree Scheduling for Parallel System.. (context) - Zhu, McCreary - 1992
1 A Fast Algorithm for hte Decomposition of Graphs and Posets (context) - Buer, Mohring - 1983
1 Shortest Path Evaluation for Hierarchial Grain Aggregation - McCreary, Gill et al.
1 Primiitive is Hereditary for 2-structures (context) - Ehrenfeucht, Rozenberg - 1990
1 Performance Prediction--How Good is Good (context) - Stramm, Berman - 1990
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