Resource binding—a universal approach to parallel programming

Authors:
Honda Shing;Lionel M. Ni
Affiliations:
Department of Computer Science, Michigan State University, East Lansing, MI;Department of Computer Science, Michigan State University, East Lansing, MI
Venue:
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Year:
1990

Citing 4
Cited 1

Linda in context

Communications of the ACM
Linda Meets Unix

Computer
Monitors: an operating system structuring concept

Communications of the ACM
Portable Programs for Parallel Processors

Portable Programs for Parallel Processors

A conflict-free memory design for multiprocessors

Proceedings of the 1991 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The suitability of a parallel programming paradigm on a particular parallel architecture often greatly influences the overall system performance. This report presents the parallel programming paradigm, resource binding, which offers an architecture independent environment for various parallel computation models. The resource binding technique, with a simple set of primitives, enables a flexible and consistent way of handling process synchronization, shared resource management, and other problems in parallel programming. High portability can be maintained without losing performance. For a clear introduction to the technique, comparisons are made among resource binding and other well-defined schemes such as semaphore, monitor, message passing and Linda.