Performance Analysis of Synchronized Iterative Algorithms on Multiprocessor Systems

  • Authors:
  • V. D. Agrawal;S. T. Chakradhar

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

A statistical model of parallel processing and a performance evaluation technique areintroduced. A task is characterized by the number of atoms and by activity. An atom isthe smallest part of computation that cannot be distributed to multiple processors and allatoms of a task are assumed to be equal in computational effort. Furthermore, atoms ofthe task became active with a fixed probability a called the activity. The task is equallydivided among processors and the computation is synchronized at periodic instanceswhen the results can be shared. The amount of computational activity of a processorwithin the period between synchronizations is assumed to be a binomial random variable.The performance of the multiprocessor system is derived from the maximumorder-statistic of these random variables. The theoretical performance predicted by theanalysis agrees well with the reported experimental performance of logic simulation ofproduction VLSI chips, and several observed phenomena are explainable.