Methodology and Examples Jaswinder Pal Singh, John L. Hennessy and Anoop...  Home/Search
Context
Related
| berkeley.edu/~culler/cs2...scaling.ps.Z berkeley.edu/~culler/cs2...scaling.ps.Z 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: berkeley.edu/~culler/cs258/ (more) From: berkeley.edu/~culler/cs258/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: To design effective large-scale multiprocessors, computer architects need to understand how parallel applications will be scaled to use these machines. The methods used to study scaling so far have been based on the computation and communication complexities of individual algorithms, with the data set size typically being the only application parameter that is scaled. The scaling of real applications, however, is considerably more complicated. Other parameters often need to be scaled along with ... (Update)
Active bibliography (related documents): More All
0.5: Future Research Directions In Problem Solving.. - Gallopoulos, Houstis.. (1991) (Correct)
0.3: Load Balancing and Data Locality in Adaptive.. - Singh, Holt.. (1995) (Correct)
0.3: A Parallel Adaptive Fast Multipole Method - Singh, Holt, Hennessy, Gupta (1993) (Correct)
Similar documents based on text: More All
0.3: An Empirical Comparison of the Kendall Square Research.. - Singh, Joe, Gupta.. (1993) (Correct)
0.2: Working Sets, Cache Sizes, and Node Granularity Issues.. - Rothberg, Singh, Gupta (1993) (Correct)
0.2: The SPLASH-2 Programs: Characterization and.. - Woo, Ohara, Torrie, .. (1995) (Correct)
BibTeX entry: (Update)
@misc{ methodology-scaling,
author = "Methodology And Examples",
title = "Scaling Parallel Programs for Multiprocessors:",
url = "citeseer.ist.psu.edu/512291.html" }
Citations (may not include all citations):357 The directory-based cache coherence protocol for the DASH mu.. (context) - Lenoski, Laudon et al. - 1990 ACM DBLP
277 A fast algorithm for particle simulation - Greengard, Rokhlin - 1987
260 Validity of the single processor approach to achieving large.. (context) - Amdahl - 1967 ACM
57 Development of parallel methods for a 1024-processor hypercu.. (context) - Gustafson, Montry et al. - 1988
36 Scalability of parallel machines (context) - Nussbaum, Agarwal - 1991 ACM DBLP
27 the scalability of FFT on parallel computers - Gupta, Kumar - 1990 ACM DBLP
24 The parallel scalability of the spectral transform method - Foster, Gropp et al. - 1991
12 Error analysis of a tree code (context) - Barnes, Hut - 1989
8 Load balancing and data locality in hierarchical N-body meth.. (context) - Singh, Holt et al. - 1992
6 body techniques for multiprocessor architecture (context) - Singh, Hennessy et al. - 1992
6 Reevaluating Amdahl's law (context) - Gustafson - 1988 ACM DBLP
6 Performance characteristics of tree codes (context) - Hernquist - 1987
5 Finding and exploiting parallelism in an ocean simulation pr.. (context) - Singh, Hennessy - 1992
5 force calculation algorithm (context) - Barnes, Hut et al. - 1986
4 Personal communication (context) - Barnes - 1991
2 object-oriented finite element solver for partial differenti.. (context) - Carey, Schmidt et al. - 1992
Documents on the same site (http://www.cs.berkeley.edu/~culler/cs258/): More
Active Messages Implementations for the Meiko CS-2 - Schauser, Scheiman (1994) (Correct)
Public International Benchmarks for Parallel Computers - Hockney, Berry (1994) (Correct)
NAS Parallel Benchmark Results 10-94 - Bailey, Barszcz, Dagum, Simon (1994) (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