DocumentCode :
2514499
Title :
A system for algorithm-architecture mapping based on dependence graph matching and hypergraphs
Author :
Li, Juan ; Jamieson, Leah H.
Author_Institution :
SSL Lab., IBM, San Jose, CA, USA
fYear :
1991
fDate :
30 Apr-2 May 1991
Firstpage :
513
Lastpage :
518
Abstract :
The paper describes a system for performing algorithm-to-architecture mapping for parallel processing algorithms. The algorithm-to-architecture mapping system is based on graph matching of dependency graphs, in order to recognize the data dependency structure of a new algorithm as an instance of a dependency structure for which an algorithm-to-architecture mapping is already known. The paper presents an approach using hypergraphs to simplify the dependency graph matching process
Keywords :
graph theory; parallel algorithms; parallel programming; algorithm-architecture mapping; data dependency structure; dependence graph matching; dependency graphs; hypergraphs; parallel processing algorithms; Costs; Heart; Image processing; Laboratories; Libraries; Pattern matching; Pattern recognition; Signal processing; Statistics; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1991. Proceedings., Fifth International
Conference_Location :
Anaheim, CA
Print_ISBN :
0-8186-9167-0
Type :
conf
DOI :
10.1109/IPPS.1991.153829
Filename :
153829
Link To Document :
بازگشت