In this paper, the problem of evaluating communication overhead in a network running a particular class of loosely synchronous algorithms is discussed. The notion of the communication graph of a node is used to show how, under some hypotheses, communication overhead can be easily expressed in terms of the basic parameters of the concurrent system. The method is applied to the analysis of communication activities overlapping in time. Communication times predicted analytically are then compared with experimental results.
COMMUNICATION WORKLOAD ANALYSIS FOR SYMMETRICAL CONCURRENT SYSTEMS
IANNELLO G;
1994-01-01
Abstract
In this paper, the problem of evaluating communication overhead in a network running a particular class of loosely synchronous algorithms is discussed. The notion of the communication graph of a node is used to show how, under some hypotheses, communication overhead can be easily expressed in terms of the basic parameters of the concurrent system. The method is applied to the analysis of communication activities overlapping in time. Communication times predicted analytically are then compared with experimental results.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
