D. Talia. Parallel computation still not ready for the mainstream. Comm. of the ACM, 44(7):98-99, July 1997. Home/Search Document Not in Database Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
A Generative Communication Service for Database.. - Hasselbring, Roantree (1998) (Correct)
....the often used parallel programming model of message passing is too low level and inflexible: In fact, even though PVM and the MPI [8] are de facto standards in parallel programming, their related programming style looks in many respects like assembler level programming of sequential computers. [29] In particular, the lack of a global name space forces algorithms to be specified at a relatively low level, since it is complicated to simulate shared memory [3] This greatly increases the complexity of programs, and also restricts algo Tuple space in ( data , i ) rd ( data , i ) ....
D. Talia. Parallel computation still not ready for the mainstream. Commun. ACM, 40(7):98--99, July 1997.
Algorithmic and Practical Considerations for Dense Matrix .. - Alexandros Gerbessiotis (Correct)
....This work was supported in part by EPSRC(UK) under grant GR K16999. 1 Introduction The main reason for the moderate success of parallel computing has been the lack of a bridging and unifying model for parallel computation the way the von Neumann model has been for sequential computing [22]. The introduction of the Bulk Synchronous Parallel (BSP) model of computation by L.G. Valiant [23, 24, 25] comes to address these limitations of parallel computing and presents itself as a possible bridge between parallel software and hardware. 1.1 The BSP Model The BSP model, as described in ....
D. Talia. Parallel computation still not ready for the mainstream. Communications of the ACM, 44(7):98-99, July 1997.
Algorithmic and Practical Considerations for Dense Matrix.. - Gerbessiotis (1997) (1 citation) (Correct)
....This work was supported in part by EPSRC(UK) under grant GR K16999. 1 Introduction The main reason for the moderate success of parallel computing has been the lack of a bridging and unifying model for parallel computation the way the von Neumann model has been for sequential computing [23]. The introduction of the Bulk Synchronous Parallel (BSP) model of computation by L.G. Valiant [24, 25, 26] comes to address these limitations of parallel computing and presents itself as a possible bridge between parallel software and hardware. 1.1 The BSP Model The BSP model, as described in ....
D. Talia. Parallel computation still not ready for the mainstream. Communications of the ACM, 44(7):98-99, July 1997.
BSP Sorting: An experimental Study - Gerbessiotis, Siniolakis (2000) (Correct)
No context found.
D. Talia. Parallel computation still not ready for the mainstream. Comm. of the ACM, 44(7):98-99, July 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC