C. L. McCreary, A. Reed  Home/Search
Context Related
Links: ACM | auburn.edu/pub/techreports...parse.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 an algorithm for decomposing directed acyclic graphs (DAGs) into a heirarchy of subgraphs we call clans. The resulting parse tree is being used to partition and schedule program dependence graphs for efficient concurrent execution on a parallel system. The clans can be identified as able or unable to support parallel execution, and their connections with other clans is completely characterized in the parse tree. . 2 Definitions and Concepts (Update)
Context of citations to this paper: More
...to as templates. The approach is based on a clan based decomposition algorithm that has been successfully used in other domains [6, 5]. The algorithm discovers clans, a grouping of nodes in the circuit graph that have a natural affinity towards each other, and it...
...a circuit cover. The original clan based decomposition algorithm was successfully used in graph drawing [7] and in code parallelizing [8]. Our contribution consists of adapting and modifying the original decomposition algorithm to template extraction, classifying the clans...
Cited by: More
Regularity Extraction Via Clan-Based Structural Circuit.. - Hassoun, McCreary (1999) (Correct)
Clan-Based Structural Circuit Decomposition for Template.. - Hassoun, McCreary (Correct)
Using Graph Parsing for Automatic Graph Drawing - C.L. McCreary, Fwu-Shan Shieh (1998) (Correct)
Similar documents (at the sentence level):
6.8%: Shortest Path Evaluation for Hierarchial Grain Aggregation - McCreary, Gill, Zhu (Correct)
5.0%: Partitioning for Parallelization Using Graph Parsing - McCreary (1991) (Correct)
Active bibliography (related documents): More All
0.3: Partitioning and Scheduling Using Graph Decomposition - McCreary, Thompson, Gill.. (1993) (Correct)
0.3: Graph Decomposition Using Node Labels - Johansson (2001) (Correct)
0.3: Some Three-Dimensional Graph Drawing Algorithms - Ostry (1996) (Correct)
Similar documents based on text: More All
0.4: VIA over the CLAN Network - Riddoch, Pope, Mansley (2001) (Correct)
0.3: Distributed Computing with the CLAN Network - Riddoch, Mansley, Pope (2002) (Correct)
0.3: Incremental Graph Parsing - McCreary, Roth (Correct)
Related documents from co-citation: More All
2: A Signature Based Approach to Regularity Extraction (context) - Arikati, Varadarajan - 1997
2: A General Approach for Regularity Extraction in Datapath Circuits - Chowdhary, Kale et al. - 1998
2: Using Graph Parsing for Automatic Graph Drawing - McCreary, Chapman et al. - 1998
BibTeX entry: (Update)
C. L. McCreary and A. Reed"A Graph Parsing Algorithm and Implementation," Tech. Rpt. TR-93-04, Dept. of Comp. Sci and Eng., Auburn U. 1993. http://citeseer.ist.psu.edu/mccreary93graph.html More
@techreport{ mccreary93graph,
author = "C. L. McCreary and A. Reed",
title = "A Graph Parsing Algorithm and Implementation",
number = "CSE93-04",
month = "1,",
year = "1993",
url = "citeseer.ist.psu.edu/mccreary93graph.html" }
Citations (may not include all citations):62 Transitive Reduction of a Directed Graph (context) - Aho, Garey et al. - 1972
39 Automatic Determination of Grain Size for Efficient Parallel.. (context) - McCreary, Gill - 1989 ACM DBLP
13 Theoretical Computer Science (context) - Ehrenfeucht, Rozenberg et al. - 1990 ACM
7 Efficient Exploitation of Concurrency Using Graph Decomposit.. (context) - McCreary, Gill - 1990 ACM DBLP
6 An Algorithm for Parsing a Graph-Grammar (context) - Mccreary - 1987
6 Primitivity is Hereditary for 2-Structures (context) - Ehrenfeucht, Rozenberg - 1990 ACM DBLP
4 Part II: Representation Through Labeled Tree Families (context) - Ehrenfeucht, Rozenberg et al. - 1990
1 Finding a Minimum Equivalent of a Digraph (context) - Moyles, Thompson - 1969
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