Abstract
In this paper, we describe and analyze the performance of a new architectural construct - an efficient synchronization mechanism called “Static Barrier MIMD” or SBM. Unlike traditional barrier synchronization, the proposed barriers are designed to allow static (compile-time) code scheduling to eliminate some synchronizations. The static barrier MIMD hardware is more general than most hardware barrier mechanisms, allowing any subset of the processors to participate in each barrier. The barriers execute in a small number of clock ticks, and processors proceed simultaneously past the barrier. The performance of idealized barrier schedules is examined to gain insights into code scheduling for barrier MIMD machines.
Original language | English |
---|---|
Pages (from-to) | 126-132 |
Number of pages | 7 |
Journal | Journal of Parallel and Distributed Computing |
Volume | 25 |
Issue number | 2 |
DOIs | |
State | Published - Mar 1995 |
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence