Automatic Methods for Hiding Latency in Parallel and Distributed Computation

DOI10.1137/S0097539797326502MaRDI QIDQ4943758zbMATH OpenOpenAlexFDO

Authors Tom Leighton, Lisa Zhang, Matthew Andrews, Panagiotis T. Metaxas

Publication date 19 March 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539797326502

zbMATH Keywords

complementary slacknesshiding latencylinear and two-dimensional arraysparallel and distributed computation

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1256742
• Network-oblivious algorithms
• Efficient automatic simulation of parallel computation on networks of workstations
• scientific article; zbMATH DE number 426330
• Predicting speedup for distributed computing on a token ring network

Cited in

(3)

• Efficient automatic simulation of parallel computation on networks of workstations
• scientific article; zbMATH DE number 1256742 (Why is no real title available?)
• Latency hiding with optimistic computations

This page was built for publication: Automatic Methods for Hiding Latency in Parallel and Distributed Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943758)