Programming with very large graphs

Bailey, Duane A.; Cuny, Janice E.; Fisher, Charles D.

doi:10.1007/bfb0017383

Cited by 4 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Graph grammars have received much attention in theoretical computer science, and important applications have been identified in biology and various fields of applied computer science, such as database systems and parallel programming [Bailey and Cuny 1987a;1987b;Bailey et al 1991;Ehrig et al 1991]. The application of graph grammars to faulttolerant array reconfiguration was introduced by Derk and DeBrunner [1994a;1994b;1996].…”

Section: Reconfiguration Graph Grammarmentioning

confidence: 99%

Reconfiguration for fault tolerance using graph grammars

Derk

DeBrunner

1998

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

Reconfiguration for fault tolerance is a widely studied field, but this work applies graph grammars to this discipline for the first time. Reconfiguration Graph Grammars (RGG) are defined and applied to the definition of processor array reconfiguration algorithms. The nodes of a graph are associated with the processors of a processor array, and the edges are associated with those interprocessor communication lines that are active. The resulting algorithms for dynamic (run-time) reconfiguration are efficient and can be implemented distributively.

show abstract

Section: Reconfiguration Graph Grammarmentioning

confidence: 99%

Reconfiguration for fault tolerance using graph grammars

Derk

DeBrunner

1998

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

show abstract

Hyperedge replacement with rendezvous

David

Drewes

Kreowski

1993

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we introduce and study a rendezvous mechanism for parallel replacements of hyperedges by (hyperedge-decorated) graphs that allows some merging of the replacing graphs if the attachment of the replaced hyperedges shares some nodes. The main result shows that the rendezvous mechanism can increase the generative power of table-controlled parallel hyperedge replacement graph grammars (which themselves are more powerful than ordinary hyperedge replacement graph grammars). 1.2 Definition (decorated graph) Let N be a set of nonterminal labels each element A of which is associated with a natural nmnber, its type, denoted by type(A).

show abstract

Reconfiguration Graph Grammar for massively parallel, fault tolerant computers

Derk

DeBrunner

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Programming with very large graphs

Cited by 4 publications

References 12 publications

Reconfiguration for fault tolerance using graph grammars

Reconfiguration for fault tolerance using graph grammars

Hyperedge replacement with rendezvous

Reconfiguration Graph Grammar for massively parallel, fault tolerant computers

Contact Info

Product

Resources

About