DocumentCode :
2511195
Title :
From algorithms to parallel architectures: a formal approach
Author :
Elleithy, Khaled M. ; Bayoumi, Magdy A.
Author_Institution :
Dept. of Comput. Eng., King Fahd Univ., Dhahran, Saudi Arabia
fYear :
1991
fDate :
30 Apr-2 May 1991
Firstpage :
358
Lastpage :
363
Abstract :
The authors introduce a formal approach for synthesis of parallel architectures. Four different forms are used to express the given algorithms: simultaneous recursion, recursion with respect to different variables, fixed nesting and variable nesting. Four different architectures for the same algorithm are obtained. As an example, a matrix-matrix multiplication algorithm is used to obtain four different optimal architectures. The different architectures of this example are compared in terms of area, time, broadcasting and required hardware. The approach is providing two main features: completeness and correctness
Keywords :
parallel architectures; algorithms; area; broadcasting; completeness; correctness; fixed nesting; formal approach; matrix-matrix multiplication algorithm; optimal architectures; parallel architectures; simultaneous recursion; time; variable nesting; Broadcasting; Concurrent computing; Cost function; Equations; Hardware; High level synthesis; Logic programming; Parallel architectures; Parallel processing; User interfaces;
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.153803
Filename :
153803
Link To Document :
بازگشت