Can Message Passing Architecture Outperform EREW PRAM?
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F01%3APU28673" target="_blank" >RIV/00216305:26220/01:PU28673 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Can Message Passing Architecture Outperform EREW PRAM?
Original language description
This article wants to show that, contrary to popular belief, solving some problems on a message passing architecture (MPA) may be faster than solution on an abstract EREW PRAM machine. The reason is that communication on MP architecture can be hidden bySW pipelining, but shared memory communication in PRAM cannot be, in principle, overlapped with processing. In this paper we present an example of artificial neural network implementation, where, under certain circumstances, MPA can provide faster executtion and a better speedup than EREW PRAM.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 35th Spring International Conference Modelling and Simulation of Systems MOSIS 2001
ISBN
80-85988-57-7
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
109-114
Publisher name
Neuveden
Place of publication
Hradec nad Moravicí
Event location
Hradec nad Moravicí
Event date
May 9, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—