See this document in CiteSeerX!

Comparative Evaluation and Case Studies of Shared-Memory and  (Make Corrections)  
Data-Parallel Execution Patterns Xiaodong Zhang Department of Computer...



  Home/Search   Context   Related

 
View or download:
ohiostate.edu/hpcs/WWW/...TR984.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ohiostate.edu/hpcs/WWW/HTML/p... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Shared-memory and data-parallel programming models are two important paradigms for scientific applications. Both models provide high-level program abstractions, and simple and uniform views of network structures. The common features of the two models significantly simplify program coding and debugging for scientific applications. However, the underlining execution and overhead patterns are significantly different between the two models due to their programming constraints, and due to... (Update)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ patterns-comparative,
  author = "Data-Parallel Execution Patterns",
  title = "Comparative Evaluation and Case Studies of Shared-Memory and",
  url = "citeseer.ist.psu.edu/766528.html" }
Citations (may not include all citations):
835   High Performance Fortran Language Specification Version 1.0 - Fortran - 1993
178   The Connection Machine CM-5 Technical Summary (context) - Corporation - 1993
100   Field computation by moment methods (context) - Harrington - 1982
96   Integrating message-passing and shared-memory: early experie.. - Kranz - 1993
33   A comparison of programming models for shared memory multipr.. (context) - Lin, Snyder
30   A new method for solving triangular systems on distributed-m.. (context) - Li, Coleman - 1989
28   Communication and computation performance of the CM-5 - Kwan, Totty et al. - 1993
23   Latency metric: an experimental method for measuring and eva.. - Zhang, Yan et al. - 1994
21   Twelve ways to fool the masses when giving performance resul.. (context) - Bailey - 1991
20   KSR-1 Technology Background (context) - Research
18   Matrix computation on distributed memory multiprocessors (context) - Moler - 1986
16   A comparison of message passing and shared-memory architectu.. - Klaiber, Levy - 1994
15   Implementation of electromagnetic scattering from conductors.. (context) - Lu - 1993
13   How to get good performance from the CM-5 data network (context) - Brewer, Kuszmaul - 1994
10   The performance realities of massively parallel processors: .. - Lubeck - 1992

[Article contains additional citations not shown here]

Documents on the same site (http://www.cse.ohio-state.edu/hpcs/WWW/HTML/publications/papers/):   More
An Effective and Practical Performance Prediction Model for - Parallel Computing On   (Correct)
LightFlood: an Efficient Flooding Scheme for File Search .. - Peer-To-Peer Systems..   (Correct)
Proceedings of the 21st International Conference on.. - Dynamic Load Sharing   (Correct)

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