J. M. Nash, P. M. Dew, J R Davy, M. E. Dyer  Home/Search
Context
Related
| scs.leeds.ac.uk/scs/doc/re...96_12.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: comp.leeds.ac.uk/services/...1996 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A standard scalable parallel architecture is now emerging: A set of processor/memory pairs access a point-to-point network router which provides uniform remote access latencies. Hardware scalability is achieved through the additional memory bandwidth and the use of high performance switches offering linear increases in bisection bandwidth. The issue of software scalability is problem-specific, however, a large class of algorithms exist which use divide-and-conquer techniques to exploit... (Update)
Active bibliography (related documents): More All
0.9: Scalable and Portable Computing Using the WPRAM Model - Nash, Dew, Dyer (1996) (Correct)
0.8: Scalable Caching Techniques for a Weakly Coherent Memory - Zamanifar, Nash, Dew (1995) (Correct)
0.6: Implementation Issues Relating to the WPRAM Model for.. - Nash, Dew, Davy, Dyer (1996) (Correct)
Similar documents based on text: More All
0.4: The Consistency Properties of a Scalable, Concurrent Queue - Goodeve, Davy, Dew, Nash (1996) (Correct)
0.3: School Of Computer Studies Research Report Series - Report Parallel Algorithm (1994) (Correct)
0.3: A Parallelisation Approach for Supporting Scalable and.. - Nash, Dew, Davy (1997) (Correct)
BibTeX entry: (Update)
@misc{ nash-dynamic,
author = "J. M. Nash and P. M. Dew and J R Davy and M. E. Dyer",
title = "Dynamic Load Balancing using a Highly Concurrent Shared Data Type",
url = "citeseer.ist.psu.edu/nash96dynamic.html" }
Citations (may not include all citations):735 A Bridging Model for Parallel Computation (context) - Valiant - 1990
468 Memory Consistency and Event Ordering in Scalable Shared Mem.. - Gharachorloo, Lenoski et al. - 1989
159 The NYU Ultracomputer - Designing an MIMD Shared Memory Comp.. (context) - Gottlieb, Grishman et al. - 1985
62 Parallel Computational Geometry (context) - Aggarwal, Chazelle et al. - 1988
48 Las Vegas Algorithms for Linear and Integer Programming When.. - Clarkson - 1992
27 Wire-Efficient VLSI Multiprocessor Communication Networks (context) - Dally - 1987
23 The Effectiveness of Combining in Shared Memory Parallel Com.. (context) - Lee, Kruskal et al.
12 Parallel Algorithm Design on the WPRAM Model (context) - Nash, Dew et al. - 1995
8 Algorithms for Scalable Synchronisation on Shared Memory Mul.. (context) - Mellor-Crummey, Scott - 1991
6 Efficient Parallel Divide-and-Conquer for a Class of Interco.. - Wu - 1991
5 Scalable Data Sharing on a Message Passing Machine (context) - Nash, Dew - 1994
5 An Optimal Randomized Planar Convex Hull Algorithm With Good.. (context) - Dyer, Nash et al. - 1995
3 Universal Communication Mechanism (context) - Culler, Messages et al. - 1992
Documents on the same site (http://www.comp.leeds.ac.uk/services/reports/1996.html): More
Scheduling Train Drivers and Investigating Alternative.. - Kwan, Kwan, Parker, Wren (1996) (Correct)
Heuristics Ancient and Modern : Transport Scheduling Through the.. - Wren (1996) (Correct)
Producing Train Driver Shifts by Computer - Kwan, Kwan, Parker, Wren (1996) (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