Synchronization Primitives for Parallel Processing

Keywords

One-bit tag memory locations, Atomic read-modify-write operations, Dependent read-and-clear, Futures and I-structures, Synchronization primitive simulator

Abstract

In the parallel computing environment, there exists few standards upon which parallel processing machines and models are built. This thesis develops a set of synchronization primitives that can be used as a synchronization standard. These primitives have been designed to meet the needs of the synchronization mechanisms used in common parallel processing models. The primitives are motivated by those used in HEP (Jordan 1985), the NYU Ultracomputer (Gottlieb 1983}, the Cedar (Zhu and Yew 1984), Dijkstra's P and V operators (Dijkstra 1968), I-structures (Arvind 1987), and Futures (Halstead 1985). Based on these concepts a set of twenty-one synchronization primitives have been designed. These primitives rely upon a one bit tag that records the state of the memory location. The primitives consist of a read, a write and an add, that act dependent or independent of the tag bit. The operations are atomic and can either set or clear the tag bit. A typical operation is a dependent read and clear. A simulator has been created that these primitives have been tested on.

Notes

This item is only available in print in the UCF Libraries. If this is your thesis or dissertation, you can help us make it available online for use by researchers around the world by STARS for more information.

Graduation Date

1991

Semester

Summer

Advisor

Wills, Scott

Degree

Master of Science (M.S.)

College

College of Engineering

Department

Computer Engineering

Format

PDF

Pages

53 pages

Language

English

Length of Campus-only Access

None

Access Status

Masters Thesis (Open Access)

Identifier

DP0027973

Subjects

Dissertations; Academic -- Engineering; Engineering -- Dissertations; Academic; Synchronization--Computer programs; Multiprocessors--Standards; Multiprocessors--Computer simulation; Multiprocessors--Programming; Parallel processing (Electronic computers)--Computer programs

This document is currently not available here.

Share

COinS
 

Accessibility Statement

This item was created or digitized prior to April 24, 2026, or is a reproduction of legacy media created before that date. It is preserved in its original, unmodified state specifically for research, reference, or historical recordkeeping. In accordance with the ADA Title II Final Rule, the University Libraries provides accessible versions of archival materials upon request. To request an accommodation for this item, please submit an accessibility request form.