Hongzhang Shan and Jaswinder Pal Singh Department of Computer Science...  Home/Search
Context
Related
| princeton.edu/~shz/papers/ics99.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: princeton.edu/~shz/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We compare the performance of three major programming models--- a load-store cache-coherent shared address space (CC-SAS), message passing (MP) and the segmented SHMEM model---on a modern, 64-processor hardware cache-coherent machine, one of the two major types of platforms upon which high-performance computing is converging. We focus on applications that are either regular and predictable or at least do not require fine-grained dynamic replication of irregularly accessed data. Within this... (Update)
Active bibliography (related documents): More All
0.5: Managing Irregular Remote Accesses to Distributed Shared Arrays.. - Kessler (Correct)
0.2: High-Performance All-Software Distributed Shared Memory - Johnson (1995) (Correct)
0.2: Working Sets, Cache Sizes, and Node Granularity Issues.. - Rothberg, Singh, Gupta (1993) (Correct)
Similar documents based on text: More All
0.5: The Performance Advantages of Integrating Block Data.. - Woo, Singh, Hennessy (1994) (Correct)
0.4: Programming FFT on DSM Multiprocessors - Shan, Feng, Shan (2000) (Correct)
0.3: Parallel Sorting on Cache-coherent DSM Multiprocessors - Shan, Singh (1999) (Correct)
BibTeX entry: (Update)
@misc{ and-comparison,
author = "Hongzhang Shan And",
title = "A Comparison of MPI, SHMEM and Cache-coherent Shared Address Space Programming
Models on the SGI Origin2000",
url = "citeseer.ist.psu.edu/296348.html" }
Citations (may not include all citations):353 The splash2 programs: characterization and methodological co.. - Woo, Ohara et al. - 1995
182 A comparison of sorting algorithms for the connection machin.. - Blelloch - 1991
119 Document for a standard messagepassing interface - Interface - 1993
96 Integrating message-passing and shared-memory: Early experie.. - Kranz - 1993
61 Where is time spent in message passing and shared memory pro.. - Chandra, Larus et al. - 1994
29 Quantifying the performance differences between pvm and thre.. - Lu, Dwarkadas et al. - 1997
28 Parallel visualization algorithms: performance and architect.. (context) - Singh, Gupta et al. - 1994
18 the influence of programming models on shared memory compute.. (context) - Ngo, Snyder - 1992
16 A comparison of message passing and shared memory architectu.. - Klaiber, Levy - 1994
11 FFTs in external or hierarchical memories (context) - Bailey - 1990
8 The performance advantages of integrating message-passing in.. (context) - Woo, Singh et al. - 1994
6 body techniques for multiprocessor architecture (context) - Singh, Gupta et al. - 1995
2 MPICH-a portable implementation of MPI (context) - MSU - 1995
1 A comparative charaterization of communication patterns in a.. (context) - Karlsson, Brorsson - 1998
Documents on the same site (http://www.cs.princeton.edu/~shz/): More
Parallel Tree Building on a Range of Shared Address Space.. - Hongzhang Shan (Correct)
Parallel Sorting on Cache-coherent DSM Multiprocessors - Shan, Singh (1999) (Correct)
A Comparison of Three Programming Models for Adaptive.. - Shan, Singh, Oliker.. (2000) (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