| Alternate document: Details Improved Bounds for On-line Load Balancing (96) Matthew Andrews andrews@math.mit.edu Michel X. Goemans goemans@math.mit.edu Lisa Zhang |
Matthew Andrews, Tom Leighton, P. Takis Metaxas, Lisa Zhang  Home/Search
Context Related
Links: ACM DBLP | belllabs.com/cm/ms/who/and...spaa96.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: belllabs.com/cm/ms/who/and...pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Matthew Andrews Tom Leighton P. Takis Metaxas Lisa Zhang Abstract In this paper we describe methods for mitigating the degradation in performance caused by high latencies in parallel and distributed networks. Our approach is similar in spirit to the "complementary slackness" method of latency hiding, but has the advantage that the slackness does not need to be provided by the programmer, and that large slowdowns are not needed in order to hide the latency. Our approach is also... (Update)
Context of citations to this paper: More
.... standard methods are known for hiding latency, e.g. pipelined routing (see, e.g. 7, 8] redundant computation (see, e.g. [1, 2, 15, 21, 22, 24]) or slackness (see, e.g. 30] the only way to bypass the bandwidth bottleneck is to reduce the communication load by exploiting...
.... standard methods are known for hiding latency, e.g. pipelined routing (see, e.g. 7, 8] redundant computation (see, e.g. [1, 2, 15, 20, 21, 23]) or slackness (see, e.g. 29] the only way to bypass the bandwidth bottleneck is to reduce the communication load by exploiting...
Cited by: More
Data Management in Networks: Experimental.. - Krick, der Heide, .. (1999) (Correct)
Open Problems for Latency Hiding in Networks of.. - Andrews, Leighton.. (Correct)
Exploiting Locality for Data Management in Systems .. - Maggs, der Heide, .. (1997) (Correct)
Similar documents (at the sentence level):
11.5%: AWOCA'96 -- Seventh Australasian Workshop on Combinatorial.. - Deo (Correct)
8.6%: Automatic Methods for Hiding Latency in High.. - Andrews, Leighton.. (1996) (Correct)
Active bibliography (related documents): More All
0.6: Improved Methods for Hiding Latency in High.. - Andrews, Leighton.. (1996) (Correct)
0.1: Reconfiguring Arrays with Faults Part I: Worst-Case Faults - Cole, Maggs (1997) (Correct)
0.1: Approximate Load Balancing on Dynamic and Asynchronous.. - Aiello, Awerbuch, Maggs.. (1993) (Correct)
Similar documents based on text: More All
0.2: Scheduling Techniques for Packet Routing, Load Balancing and Disk .. - Andrews (1997) (Correct)
0.2: The Roles of Video in the Design, Development, and.. - Rebelsky, Makedon.. (1998) (Correct)
0.1: Source Routing and Scheduling in Packet Networks - Andrews, Fernandez, Goel, Zhang (2001) (Correct)
Related documents from co-citation: More All
4: Work-preserving emulations of fixed-connection networks - Koch, Leighton et al. - 1989
4: A bridging model for parallel computation (context) - Valiant - 1990
4: Automatic methods for hiding latency in high bandwidth networks - Andrews, Leighton et al. - 1996
BibTeX entry: (Update)
M. Andrews, T. Leighton, P. T. Metaxas, and L. Zhang. Improved methods for hiding latency in high bandwidth networks. In Proc. of the 8th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 52--61, 1996. http://citeseer.ist.psu.edu/andrews96improved.html More
@inproceedings{ andrews96improved,
author = "Andrews and Leighton and Metaxas and Zhang",
title = "Improved Methods for Hiding Latency in High Bandwidth Networks",
booktitle = "{SPAA}: Annual {ACM} Symposium on Parallel Algorithms and Architectures",
year = "1996",
url = "citeseer.ist.psu.edu/andrews96improved.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
735 A bridging model for parallel computation (context) - Valiant - 1990 ACM DBLP
164 The network architecture of the connection machine CM - Leiserson, Abuhamdeh et al. - 1992
163 Efficient dispersal of information for security (context) - Rabin - 1989
157 Architecture and applications of the HEP multiprocessor comp.. (context) - Smith - 1981
130 Implementation of a portable nested data-parallel language - Blelloch, Chatterjee et al. - 1993 ACM DBLP
80 Thinking Machines Corporation (context) - Machine, Technical - 1991
53 Work-preserving emulations of fixed-connection networks - Koch, Leighton et al. - 1989 ACM DBLP
48 Architecture and applications of the connection machine (context) - Tucker, Robertson - 1988 ACM DBLP
36 Asymptotically tight bounds for computing with faulty arrays.. (context) - Kaklamanis, Karlin et al. - 1990
28 the fault tolerance of some popular bounded-degree networks - Leighton, Maggs et al. - 1992
25 Efficient out-of-core algorithms for linear relaxation using.. - Leiserson, Rao et al. - 1993 ACM DBLP
13 Multi-scale self-simulation: A technique for reconfiguring a.. (context) - Cole, Maggs et al. - 1993 DBLP
11 Computing with faulty arrays (context) - Aumann, Ben-Or - 1992 ACM DBLP
7 Center for Research in Computing Technology (context) - Valiant, computers et al. - 1989
6 Automatic methods for hiding latency in high bandwidth netwo.. - Andrews, Leighton et al. - 1996
Documents on the same site (http://cm.bell-labs.com/cm/ms/who/andrews/pub.html): More
Hardness of Buy-at-Bulk Network Design - Andrews (2004) (Correct)
Automatic Methods for Hiding Latency in High.. - Andrews, Leighton.. (1996) (Correct)
Hardness of the Undirected Congestion Minimization Problem - Andrews, Zhang (2004) (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