Predicting speedup for distributed computing on a token ring network

Feldman, PM

doi:10.1006/jpdc.1997.1365

Predicting speedup for distributed computing on a token ring network

1997-08-01

3

PRE

AI

DOI：10.1006/jpdc.1997.1365

原文链接

原文求助

摘要

En 中文

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 optimistic predictions and may be grossly inaccurate for problems involving fine-grained parallelism, In this paper, we consider distributed computation on a token ring local area network, We obtain exact analytical results for the mean speedup, both for small n and for asymptotically large It. For large n, we show that under very general conditions speedup tends to a limiting value with increasing numbers of processors; i.e., there is a ''communications speedup limit'' that cannot be exceeded regardless of the number of processors, Because the token ring represents a limiting case for the effects of communications delays, results obtained thus provide an upper bound for speedup on Ethernets and other bus-type networks, Analytical results were verified by simulation. (C) 1997 Academic Press.

Keyword:

PARALLEL

Predicting speedup for distributed computing on a token ring network

摘要

期刊

机构

引用论文