Predicting speedup for distributed computing on a token ring network

DOI10.1006/jpdc.1997.1365zbMath0888.68012OpenAlexW2069848222MaRDI QIDQ1373796

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

zbMATH Keywords

fine-grained parallelismtoken ring local area network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming. ⋮ Analyzing the Effect of Distribution to the Simulation on a Network of Workstations

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