A fully parallel algorithm for implementing path expressions

Anne Dinning, Bhubaneswar Mishra

Research output: Contribution to journalArticle

Abstract

Current research efforts in parallel architecture usually evolve from designs of a processor-memory-connection architecture with rudimentary facilities for synchronization and communication, which are often found to be inadequate to support the more sophisticated usages. In order to remedy this problem, we favor a top-down design, where the primitive operations are selected via a careful and thorough analysis of the high-level general purpose applications to be supported by the architecture. In this paper, we study how a high-level process-synchronization specification, presented in the path expression language, can be translated into a fully parallel implementation on an MIMD shared memory architecture and what primitive support facilities are necessary to achieve this. Primary emphasis is obviously on the simplicity of the system, the low synchronization overhead of the algorithm, the efficiency of the primitives, and the relative ease of system implementation.

Original languageEnglish (US)
Pages (from-to)205-221
Number of pages17
JournalJournal of Parallel and Distributed Computing
Volume10
Issue number3
DOIs
StatePublished - 1990

Fingerprint

Parallel algorithms
Parallel Algorithms
Synchronization
Path
Memory architecture
Parallel architectures
Parallel Architectures
Parallel Implementation
Shared Memory
Simplicity
Specification
Specifications
Data storage equipment
Necessary
Communication
Architecture
Design

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

A fully parallel algorithm for implementing path expressions. / Dinning, Anne; Mishra, Bhubaneswar.

In: Journal of Parallel and Distributed Computing, Vol. 10, No. 3, 1990, p. 205-221.

Research output: Contribution to journalArticle

@article{cb445e7f52b74eeaaf177b866afcbc88,
title = "A fully parallel algorithm for implementing path expressions",
abstract = "Current research efforts in parallel architecture usually evolve from designs of a processor-memory-connection architecture with rudimentary facilities for synchronization and communication, which are often found to be inadequate to support the more sophisticated usages. In order to remedy this problem, we favor a top-down design, where the primitive operations are selected via a careful and thorough analysis of the high-level general purpose applications to be supported by the architecture. In this paper, we study how a high-level process-synchronization specification, presented in the path expression language, can be translated into a fully parallel implementation on an MIMD shared memory architecture and what primitive support facilities are necessary to achieve this. Primary emphasis is obviously on the simplicity of the system, the low synchronization overhead of the algorithm, the efficiency of the primitives, and the relative ease of system implementation.",
author = "Anne Dinning and Bhubaneswar Mishra",
year = "1990",
doi = "10.1016/0743-7315(90)90013-F",
language = "English (US)",
volume = "10",
pages = "205--221",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - A fully parallel algorithm for implementing path expressions

AU - Dinning, Anne

AU - Mishra, Bhubaneswar

PY - 1990

Y1 - 1990

N2 - Current research efforts in parallel architecture usually evolve from designs of a processor-memory-connection architecture with rudimentary facilities for synchronization and communication, which are often found to be inadequate to support the more sophisticated usages. In order to remedy this problem, we favor a top-down design, where the primitive operations are selected via a careful and thorough analysis of the high-level general purpose applications to be supported by the architecture. In this paper, we study how a high-level process-synchronization specification, presented in the path expression language, can be translated into a fully parallel implementation on an MIMD shared memory architecture and what primitive support facilities are necessary to achieve this. Primary emphasis is obviously on the simplicity of the system, the low synchronization overhead of the algorithm, the efficiency of the primitives, and the relative ease of system implementation.

AB - Current research efforts in parallel architecture usually evolve from designs of a processor-memory-connection architecture with rudimentary facilities for synchronization and communication, which are often found to be inadequate to support the more sophisticated usages. In order to remedy this problem, we favor a top-down design, where the primitive operations are selected via a careful and thorough analysis of the high-level general purpose applications to be supported by the architecture. In this paper, we study how a high-level process-synchronization specification, presented in the path expression language, can be translated into a fully parallel implementation on an MIMD shared memory architecture and what primitive support facilities are necessary to achieve this. Primary emphasis is obviously on the simplicity of the system, the low synchronization overhead of the algorithm, the efficiency of the primitives, and the relative ease of system implementation.

UR - http://www.scopus.com/inward/record.url?scp=0025522727&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025522727&partnerID=8YFLogxK

U2 - 10.1016/0743-7315(90)90013-F

DO - 10.1016/0743-7315(90)90013-F

M3 - Article

AN - SCOPUS:0025522727

VL - 10

SP - 205

EP - 221

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 3

ER -