Compiling path expressions into VLSI circuits

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Path expressions were originally proposed by Campbell and Habermann as a mechanism for process synchronization at the monitor level in software. Not unexpectedly, they also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by this potential application 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-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 publicationConference Record of the Annual ACM Symposium on Principles of Programming Languages
PublisherACM
Pages191-204
Number of pages14
ISBN (Print)0897911474
StatePublished - 1985

Fingerprint

VLSI circuits
Synchronization
Networks (circuits)
Hardware

ASJC Scopus subject areas

  • Software

Cite this

Anantharaman, T. S., Clarke, E. M., Foster, M. J., & Mishra, B. (1985). Compiling path expressions into VLSI circuits. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 191-204). ACM.

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

Conference Record of the Annual ACM Symposium on Principles of Programming Languages. ACM, 1985. p. 191-204.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Anantharaman, TS, Clarke, EM, Foster, MJ & Mishra, B 1985, Compiling path expressions into VLSI circuits. in Conference Record of the Annual ACM Symposium on Principles of Programming Languages. ACM, pp. 191-204.
Anantharaman TS, Clarke EM, Foster MJ, Mishra B. Compiling path expressions into VLSI circuits. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages. ACM. 1985. p. 191-204
Anantharaman, T. S. ; Clarke, E. M. ; Foster, M. J. ; Mishra, Bhubaneswar. / Compiling path expressions into VLSI circuits. Conference Record of the Annual ACM Symposium on Principles of Programming Languages. ACM, 1985. pp. 191-204
@inproceedings{a5a110495bbc4e3c8676d356bcb0515c,
title = "Compiling path expressions into VLSI circuits",
abstract = "Path expressions were originally proposed by Campbell and Habermann as a mechanism for process synchronization at the monitor level in software. Not unexpectedly, they also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by this potential application 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-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 = "1985",
language = "English (US)",
isbn = "0897911474",
pages = "191--204",
booktitle = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",
publisher = "ACM",

}

TY - GEN

T1 - Compiling path expressions into VLSI circuits

AU - Anantharaman, T. S.

AU - Clarke, E. M.

AU - Foster, M. J.

AU - Mishra, Bhubaneswar

PY - 1985

Y1 - 1985

N2 - Path expressions were originally proposed by Campbell and Habermann as a mechanism for process synchronization at the monitor level in software. Not unexpectedly, they also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by this potential application 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-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 by Campbell and Habermann as a mechanism for process synchronization at the monitor level in software. Not unexpectedly, they also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by this potential application 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-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=0022201658&partnerID=8YFLogxK

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

M3 - Conference contribution

AN - SCOPUS:0022201658

SN - 0897911474

SP - 191

EP - 204

BT - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

PB - ACM

ER -