UM
Mapping precedence and communication relations of a large scale computation on a multiprocessor system
Chen C.L.P.; Lee C.S.G.
1989-12-01
Source PublicationProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume1
Pages370-375
AbstractThe authors present an efficient algorithm for mapping m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p homogeneous processors with processor and communication costs to achieve minimum computation time. Minimax optimization is performed on the objective function to obtain the best mapping. Experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithm. Computer simulation and experimental results are compared and discussed.
URLView the original
Language英語
Fulltext Access
Document TypeConference paper
CollectionUniversity of Macau
AffiliationWright State University
Recommended Citation
GB/T 7714
Chen C.L.P.,Lee C.S.G.. Mapping precedence and communication relations of a large scale computation on a multiprocessor system[C],1989:370-375.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Chen C.L.P.]'s Articles
[Lee C.S.G.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Chen C.L.P.]'s Articles
[Lee C.S.G.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chen C.L.P.]'s Articles
[Lee C.S.G.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.