Compiling path expressions into VLSI circuits

T. S. Anantharaman, E. M. Clarke, M. J. Foster, Bhubaneswar Mishra

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Path expressions were originally proposed as a mechanism for process synchronization at the monitor level in software. They also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by these potential applications we investigate how to directly translate path expressions into hardware. Our implementation is complicated in the case of multiple path expressions by the need for synchronization on event names that are common to more than one path. Moreover, since events are inherently asynchronous in our model, all of our circuits must be self-timed. Nevertheless, the circuits produced by our construction have area proportional to N multiplied by (times) log(N) where N is the total length of the multiple path expression under consideration. This bound holds regardless of the number of individual paths or the degree of synchronization between paths.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
Pages305-355
Number of pages51
StatePublished - 1987

Fingerprint

VLSI circuits
Synchronization
Networks (circuits)
Hardware

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Anantharaman, T. S., Clarke, E. M., Foster, M. J., & Mishra, B. (1987). Compiling path expressions into VLSI circuits. In Unknown Host Publication Title (pp. 305-355)

Compiling path expressions into VLSI circuits. / Anantharaman, T. S.; Clarke, E. M.; Foster, M. J.; Mishra, Bhubaneswar.

Unknown Host Publication Title. 1987. p. 305-355.

Research output: Chapter in Book/Report/Conference proceedingChapter

Anantharaman, TS, Clarke, EM, Foster, MJ & Mishra, B 1987, Compiling path expressions into VLSI circuits. in Unknown Host Publication Title. pp. 305-355.
Anantharaman TS, Clarke EM, Foster MJ, Mishra B. Compiling path expressions into VLSI circuits. In Unknown Host Publication Title. 1987. p. 305-355
Anantharaman, T. S. ; Clarke, E. M. ; Foster, M. J. ; Mishra, Bhubaneswar. / Compiling path expressions into VLSI circuits. Unknown Host Publication Title. 1987. pp. 305-355
@inbook{c2e0fef63bf048f49274c9496440b8c9,
title = "Compiling path expressions into VLSI circuits",
abstract = "Path expressions were originally proposed as a mechanism for process synchronization at the monitor level in software. They also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by these potential applications we investigate how to directly translate path expressions into hardware. Our implementation is complicated in the case of multiple path expressions by the need for synchronization on event names that are common to more than one path. Moreover, since events are inherently asynchronous in our model, all of our circuits must be self-timed. Nevertheless, the circuits produced by our construction have area proportional to N multiplied by (times) log(N) where N is the total length of the multiple path expression under consideration. This bound holds regardless of the number of individual paths or the degree of synchronization between paths.",
author = "Anantharaman, {T. S.} and Clarke, {E. M.} and Foster, {M. J.} and Bhubaneswar Mishra",
year = "1987",
language = "English (US)",
isbn = "0881751286",
pages = "305--355",
booktitle = "Unknown Host Publication Title",

}

TY - CHAP

T1 - Compiling path expressions into VLSI circuits

AU - Anantharaman, T. S.

AU - Clarke, E. M.

AU - Foster, M. J.

AU - Mishra, Bhubaneswar

PY - 1987

Y1 - 1987

N2 - Path expressions were originally proposed as a mechanism for process synchronization at the monitor level in software. They also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by these potential applications we investigate how to directly translate path expressions into hardware. Our implementation is complicated in the case of multiple path expressions by the need for synchronization on event names that are common to more than one path. Moreover, since events are inherently asynchronous in our model, all of our circuits must be self-timed. Nevertheless, the circuits produced by our construction have area proportional to N multiplied by (times) log(N) where N is the total length of the multiple path expression under consideration. This bound holds regardless of the number of individual paths or the degree of synchronization between paths.

AB - Path expressions were originally proposed as a mechanism for process synchronization at the monitor level in software. They also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by these potential applications we investigate how to directly translate path expressions into hardware. Our implementation is complicated in the case of multiple path expressions by the need for synchronization on event names that are common to more than one path. Moreover, since events are inherently asynchronous in our model, all of our circuits must be self-timed. Nevertheless, the circuits produced by our construction have area proportional to N multiplied by (times) log(N) where N is the total length of the multiple path expression under consideration. This bound holds regardless of the number of individual paths or the degree of synchronization between paths.

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

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

M3 - Chapter

SN - 0881751286

SP - 305

EP - 355

BT - Unknown Host Publication Title

ER -