Abstract
In this paper we evaluate the performance of a Supernode (Transputer-based system) with some linear algebra problems. The Supernode has been evaluated as a linear multicomputer and as a mesh multicomputer. All the used parallel algorithms have been designed following the same strategy. We describe the design strategy with an example for LU decomposition. Finally, we evaluate two different programming models.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
