Predicting speedup for distributed computing on a token ring network

DOI10.1006/JPDC.1997.1365zbMATH Open0888.68012OpenAlexW2069848222MaRDI QIDQ1373796FDOQ1373796

Authors: Phillip M. Feldman, David B. Kim, Raisa Epstein Feldman 

Publication date: 17 December 1997

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1997.1365

Recommendations

• The Token Distribution Problem
• Characterization of the traffic on high-speed token-ring networks
• scientific article; zbMATH DE number 4028858
• scientific article; zbMATH DE number 2096759

zbMATH Keywords

fine-grained parallelismtoken ring local area network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (3)

• Analyzing the Effect of Distribution to the Simulation on a Network of Workstations
• Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.
• Automatic Methods for Hiding Latency in Parallel and Distributed Computation

This page was built for publication: Predicting speedup for distributed computing on a token ring network

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