Modeling Unusual Behavior of Parallel Algorithms

Authors:
B. W. Weide
Affiliations:
Department of Computer and Information Science, Ohio State University
Venue:
IEEE Transactions on Computers
Year:
1982

Citing 6
Cited 0

Experience Using Multiprocessor Systems—A Status Report

ACM Computing Surveys (CSUR)
Operating Systems Theory

Operating Systems Theory
The design and analysis of algorithms for asynchronous multiprocessors.

The design and analysis of algorithms for asynchronous multiprocessors.
Statistical methods in algorithm design and analysis.

Statistical methods in algorithm design and analysis.
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
C.mmp: a multi-mini-processor

AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II

Quantified Score

Hi-index	14.98

Visualization

Abstract

A probabilistic model of a class of parallel programs is used to investigate the counterintuitive behavior observed for some parallel algorithms. Two main points are made: 1) it may, in general, be beneficial to consider using more logical processes than physical processors in a parallel algorithm; and 2) results from order statistics are useful tools in analyzing parallel systems.