Prakash Panangaden, Clark Verbrugge  Home/Search
Context
Related
| acaps.cs.mcgill.ca/~...partitionable.ps 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: acaps.cs.mcgill.ca/~cl...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A fundamental problem in parallel computing is partitioning data structures in such a way as to minimize communication between processes while keeping the loads balanced. The problem is particularly acute when the underlying data structures are irregular, pointer-based structures. Here we present a methodology for partitioning a general class of dynamic data structures with guaranteed bounds on load-balancing and communication costs. Our method is based on a form of graph grammar, which... (Update)
Similar documents (at the sentence level):
54.7%: A Parallel Solution Strategy For Irregular, Dynamic Problems - Verbrugge (1996) (Correct)
26.6%: Generating Irregular Partitionable Data Structures - Panangaden, Verbrugge (1996) (Correct)
Active bibliography (related documents): More All
1.2: Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996) (Correct)
0.5: Regular Description of Context-Free Graph Languages - Engelfriet, van Oostrom (1996) (Correct)
0.5: Relational Graph Rewritings - Mizoguchi, KAWAHARA (1995) (Correct)
Similar documents based on text: More All
0.3: A Framework for Optimizing Java Using Attributes - Pominville, Qian.. (2000) (Correct)
0.3: A Logical Characterization of Bisimulation for.. - Desharnais, Edalat.. (1998) (Correct)
0.2: Scalable Libraries for Graph Partitioning - Bhargava, Fox, Ou, Ranka, Singh (1993) (Correct)
BibTeX entry: (Update)
@article{ panangaden00generating,
author = "Prakash Panangaden and Clark Verbrugge",
title = "Generating irregular partitionable data structures",
journal = "Theoretical Computer Science",
volume = "238",
number = "1--2",
pages = "31--80",
year = "2000",
url = "citeseer.ist.psu.edu/486324.html" }
Citations (may not include all citations):421 A linear-time heuristic for improving network partitions (context) - Fiduccia, Mattheyses - 1982
371 Optimization by simulated annealing: An experimental evaluat.. (context) - Johnson, Aragon et al. - 1989
218 A separator theorem for planar graphs (context) - Lipton, Tarjan - 1979
215 Theoretical Computer Science (context) - Raoult, rewritings - 1984
186 way partitioning scheme for irregular graphs (context) - Karypis, Kumar - 1995
132 Mathematical models for cellular interaction in development (context) - Lindenmayer - 1968
104 Graph rewriting: An algebraic and logic approach (context) - Courcelle - 1990
48 Handle-rewriting hypergraph grammars (context) - Courcelle, Engelfriet et al. - 1993
46 Multidimensional spectral load balancing - Hendrickson, Leland - 1993
41 Graph minors II: Algorithmic aspects of treewidth (context) - Robertson, Seymour - 1986
41 Parallel decomposition of unstructured fem-meshes - Diekmann, Meyer et al. - 1995
37 Tutorial introduction to the algebraic approach of graph gra.. (context) - Ehrig - 1987
37 cient heuristic procedure for partitioning graphs (context) - Kernighan, Lin - 1970
36 Problems easy for tree-decomposable graphs (context) - Arnborg, Lagergren et al. - 1988
33 Nils Klarlund and Michael (context) - Klarlund, Graph et al. - 1993
33 Locality in distributed graph algorithms (context) - Linial - 1992
28 the structure of node-label-controlled graph languages (context) - Janssens, Rozenberg - 1980
27 Dactl: An experimental graph rewriting language - Glauert, Kennaway et al. - 1990
25 An axiomatic definition of context-free rewriting and its ap.. (context) - Courcelle - 1987
22 May we introduce to you: Hyperedge replacement (context) - Habel, Kreowksi - 1986
18 the use of graph grammars for defining the syntax of graphic.. - Rekers - 1994
18 On graph rewritings (context) - Kennaway - 1987
17 cuts within twice the optimal (context) - Saran, Vazirani - 1995
17 Syntax and semantics of hybrid database languages (context) - Andries, Engels - 1993
16 Abstract description of pointer data structures: An approach.. (context) - Hummel, Hendren et al. - 1992
15 A characterization of context-free NCE graph languages by mo.. (context) - Engelfriet - 1990
15 cient algorithms for combinatorial problems on graphs with b.. (context) - Arnborg - 1985
15 Context-free NCE graph grammars (context) - Engelfriet - 1989
14 A language for generic graphtransformations (context) - Andries, Paredaens - 1991
13 Boundary graph grammars with dynamic edge relabeling (context) - Engelfriet, Leih et al. - 1990
13 Algebraic approach to graph transformation based on single p.. (context) - Lowe, Ehrig - 1991
13 Edge separators of planar and outerplanar graphs with applic.. (context) - Diks, Djidjev et al. - 1993
13 Graph grammars with neighbourhood controlled embedding (context) - Janssens, Rozenberg - 1982
12 A note on hyperedge replacement (context) - Drewes, Kreowski - 1990
12 an attribute graph grammar based specification language (context) - Schurr, PROGRESS - 1989
11 Information and Control (context) - Montanari, planar et al. - 1970
11 Partitioning planar graphs (context) - Bui, Peck - 1992
10 On structured graph grammars (context) - Kreowski, Rozenberg - 1990
10 A class of bounded approximation algorithms for graph partit.. (context) - Feo, Khellaf - 1990
9 Regular versus irregular problems and algorithms - Gautier, Roch et al. - 1995
9 A linear tree partitioning algorithm (context) - Kundu, Misra - 1977
9 Distributed parallelism of graph transformations (context) - Ehrig, Boehm et al. - 1988
8 Decomposition trees: Structured graph representation and e#c.. (context) - Lautemann - 1988
8 The complexity of graph languages generated by hyperedge rep.. (context) - Lautemann - 1990
8 Hypergraph languages of bounded degree (context) - Engelfriet, Heyker - 1994
7 Structured transformations and computation graphs for actor .. (context) - Janssens, Rozenberg - 1990
7 On partially ordered graph grammars (context) - Brandenburg - 1986
7 On sequential and parallel noderewriting graph grammars (context) - Janssens, Rozenberg et al. - 1982
7 On sequential and parallel node-rewriting graph grammars (context) - Janssens, Rozenberg et al. - 1983
7 Better algorithms for parallel backtracking - Sanders - 1995
7 Number 842 in Lecture Notes in Computer Science (context) - Kloks, Computations - 1994
5 Graph theoretical methods for the design of parallel algorit.. (context) - Reischuk - 1991
5 extensions and variations of NLC grammars (context) - Janssens, Rozenberg - 1980
5 Parallel Algorithms for Irregularly Structured Problems: Pro.. (context) - Ferreira, Rolim - 1995
4 The computational complexity of certain graph grammars (context) - Brandenburg - 1983
4 PROGRESS: A VHL-language based on graph grammars (context) - Schurr - 1990
4 ADA concurrency specified by graph grammars (context) - Jackel - 1986
4 Context-free grammars as a tool for describing polynomial-ti.. (context) - Slisenko - 1982
4 A characterization of context-free string languages by direc.. (context) - Janssens, Rozenberg - 1981
4 A parallel local-search algorithm for the k-partitioning pro.. - Diekmann, Luling et al. - 1995
4 and Robin Thomas (context) - Alon, Seymour - 1994
3 Software specification by graph grammars (context) - Nagl, Engels et al. - 1982
3 the relation between graph grammars and graph l-systems (context) - Nagl
3 systems: From formalism to programming languages (context) - Prusinkiewicz, Hanan - 1992
3 Algorithmic skeletons for adaptive multigrid methods (context) - Botorog, Kuchen - 1995
3 Graph-grammar semantics of a higherorder programming languag.. - Barthelmann, Schied - 1993
3 Graph rewriting systems and their application to network rel.. (context) - Okada, Hayashi - 1991
3 cient automatic FEM domain decomposer (context) - Farhat, simple - 1988
2 On structured graph grammars II (context) - Kreowski, Rozenberg - 1990
2 Graph Transformations in Computer Science: Proceedings of th.. (context) - Schneider, Ehrig - 1993
2 Edge separators for graphs of bounded genus with application.. (context) - Sykora, to - 1993
2 and Grzegorz Rozenberg (context) - Ehrig, Magl - 1982
1 Towards bistributed graph grammars (context) - Boehm, Ehrig et al. - 1986
1 cient algorithms on context-free graph languages (context) - Lautemann - 1988
1 Lower bounds for the partitioning of graphs (context) - Donat, Ho - 1973
1 tree decomposition and hyperedge replacement (context) - Lautemann - 1990
1 Context-free handle-rewriting hypergraph grammars (context) - Courcelle, Engelfriet et al. - 1990
1 cient algorithm for the partitioning of trees (context) - Lukes - 1974
1 Load balancing strategies for a parallel system of particles (context) - Miguet, Pierson - 1995
1 The power and the limitations of local computations on graph.. (context) - Litovsky, Metivier et al. - 1992
1 Computing by graph transformation: Overal aims and new resul.. (context) - Research, No - 1990
1 A parallel processing paradigm for irregular applications (context) - Das, Moser et al. - 1995
1 Modelling compiler generation by graph grammars (context) - Ho - 1982
1 Hypergraph systems generating graph languages (context) - Janssens, Rozenberg - 1983
1 The logical expression of graph properties (context) - Courcelle - 1990
1 A linguistic formalism for engineering solid modeling (context) - Fitzhorn - 1986
1 Specification of data bases through rewriting rules (context) - Furtado, Veloso - 1982
Documents on the same site (http://www-acaps.cs.mcgill.ca/~clump/research.html):
A Structure for Modern Computer Narratives - Clark Verbrugge School (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