The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 25 NO.5 / (1996))
Bounds on the Efficinecy of Message-Passing Protocols for Parallel Computers
Robert Cypher, Smaragda Konstantinidou,
Pages. 1082-1104
Abstract
Contents 1. Introduction
2. Formal model and problem definitions
2.1. The model
2.2. The problems
3. Upper bound for selective receives
4. Lower bound for nonselective receives
5. Upper bound for nonselective receives
5.1. Buffer-reservation algorithms
5.2. Protocol for nonselective receives
Key words communication protocols, end-to-end protocols, message passing, parallel computing deadlock.
Mathmatical Subject Classification 68Q10, 68Q22, 68Q25