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

Distributed Computation with Communication Delays: Asymptotic Performance Analysis

โœ Scribed by D. Ghose; V. Mani


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
687 KB
Volume
23
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper analyzes the effect of communication delay on the optimal distribution of processing loads in distributed computing networks. The processing load is assumed to satisfy the property of arbitrary divisibility. The objective is to divide and distribute this processing load among various processors in the network in order to minimize the processing time. An asymptotic analysis of the performance of such networks is carried out to obtain a limit on the performance enhancement obtained by using additional processors. The architectures considered are linear and single-level tree configurations. The cases when the processors are equipped with and without front-ends are considered. (\sqrt{1} 1994 \mathrm{Aca}) demic Press, Inc.


๐Ÿ“œ SIMILAR VOLUMES


Global asymptotic stability for neural n
โœ Josรฉ J. Oliveira ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 667 KB

In this paper, we obtain the global asymptotic stability of the zero solution of a general n-dimensional delayed differential system, by imposing a condition of dominance of the non-delayed terms which cancels the delayed effect. We consider several delayed differential systems in general settings,

Performance and Scalability of Finite El
โœ E. Barragy; G.F. Carey; R. Vandegeijn ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 896 KB

A two-dimensional \((h, p)\) finite element scheme for distributed parallel computation is developed. The approach is based on an element-by-element domain decomposition and is implemented on the nCUBE2 system. Example problems are used to demonstrate performance of the algorithm for a range of \((h

Remote Reference Counting: Distributed G
โœ Dmitry Kogan; Assaf Schuster ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 443 KB

Automatic storage management is important in distributed programming environments because programmer controlled reclamation is highly prone to errors. The main disadvantage of existing memory reclamation schemes is their high communication cost, a cost that is proportional to the number of pointer o