Lois Rixner

Abstract

This paper looks at algorithms for the detection of termination in a distributed system and analyzes them for effectiveness and efficiency. A survey is done of the published algorithms for distributed termination and each is evaluated. Both centralized distributed systems and fully distributed systems are reviewed. The algorithms are analyzed for the overhead and conclusions are made about the situations in which they can be used, i.e. an operating system, a real-time system, or a user application. An original algorithm is presented for the asynchronous case with first-in-first-out message ordering. It allows any process to initiate detection of termination and makes use of multiple tokens.

Library of Congress Subject Headings

Electronic data processing--Distributed processing

Publication Date

1991

Document Type

Thesis

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Kitchen, Andrew

Advisor/Committee Member

Heliotis, James

Advisor/Committee Member

Anderson, Peter

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA76.9.D5 R59 1991

Campus

RIT – Main Campus

Download

Share

COinS