A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments

This paper presents an algorithm that transforms an SS serial-model program to an equivalent SS program that runs concurrently in an asynchronous shared memory parallel computing environment. Timestamps are used to guarantee mutually exclusive execution of guarded commands among neighbor processes....

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters Vol. 66; no. 6; pp. 285 - 290
Main Authors: Mizuno, Masaaki, Nesterenko, Mikhail
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 30.06.1998
Elsevier Science
Elsevier Sequoia S.A
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Concurrency
Exact sciences and technology
Fault tolerance
Information processing
Parallel algorithms
Self-stabilization
Studies
Theoretical computing
Self-stabilization
Fault tolerance
Concurrency
Parallel algorithms
Fault tolerant computer systems
Computational complexity
ISSN:0020-0190, 1872-6119
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an algorithm that transforms an SS serial-model program to an equivalent SS program that runs concurrently in an asynchronous shared memory parallel computing environment. Timestamps are used to guarantee mutually exclusive execution of guarded commands among neighbor processes. The algorithm preserves the silence property.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(98)00069-6