๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction of a distributed computer network containing ring connections

โœ Scribed by Hajime Kanada

Book ID
104591561
Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
690 KB
Volume
24
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

As a connection method for a LAN, which connects computers and various other equipment (called processors hereafter), a token ring system is currently used. Any two processors on a ring can communicate with each other directly. As one fundamental problem for distributed algorithms in a network of several rings connected by links, the problem of parallel data transmission between processors is discussed in this paper. In the parallel data transmission problem, a predetermined processor holding data with specified addresses sends the data to the specified addresses in parallel. Given the numbers of processors and rings, the minimum computation time for data exchange between the processors, and conditions on the network configuration to achieve that minimum are obtained while keeping the number of links minimum.

๐Ÿ“œ SIMILAR VOLUMES

Predicting Speedup for Distributed Compu
Predicting Speedup for Distributed Computing on a Token Ring Network
โœ Phillip M. Feldman; Raisa E. Feldman; David B. Kim ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB

Before a conventional application is converted into a distributed one (typically a costly process), it is prudent to estimate the improvement in run time that will be achieved. Previous research has tended to ignore communications delays in order to facilitate analysis. However, such models lead to