PASS: A package for automatic scheduling and sharing pipelined data paths

Jer-Min Jou, Chengli Cin Chin, Yi Ru Li

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

A system for automatic scheduling and sharing data paths has been developed. It is generic; different design styles such as pipeline, chaining, loop pipelines, etc., have been considered, and solutions of fastest possible, cheapest possible, fastest within hardware constraints, or lowest cost within time constraint could be found according to the user's request. The entire design space then could be explored with it. The scheduling algorithm is stepwise selective, dealing with hardware urgency, time urgency, interconnection urgency, data urgency, and control urgency in a serial method with multiple levels of selections. the concept of the sharing algorithm is to consider the inter-influenced properties between operator-sharing and register-sharing, construct two inter-involved sharing criteria for them simultaneously, and then merge them concurrently.

Original languageEnglish
Pages (from-to)1769-1772
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume3
Publication statusPublished - 1991

Fingerprint

Pipelines
Scheduling
Hardware
Scheduling algorithms
Costs

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

@article{3c31840b45e444e18dd33981a29bbca4,
title = "PASS: A package for automatic scheduling and sharing pipelined data paths",
abstract = "A system for automatic scheduling and sharing data paths has been developed. It is generic; different design styles such as pipeline, chaining, loop pipelines, etc., have been considered, and solutions of fastest possible, cheapest possible, fastest within hardware constraints, or lowest cost within time constraint could be found according to the user's request. The entire design space then could be explored with it. The scheduling algorithm is stepwise selective, dealing with hardware urgency, time urgency, interconnection urgency, data urgency, and control urgency in a serial method with multiple levels of selections. the concept of the sharing algorithm is to consider the inter-influenced properties between operator-sharing and register-sharing, construct two inter-involved sharing criteria for them simultaneously, and then merge them concurrently.",
author = "Jer-Min Jou and Chin, {Chengli Cin} and Li, {Yi Ru}",
year = "1991",
language = "English",
volume = "3",
pages = "1769--1772",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

PASS : A package for automatic scheduling and sharing pipelined data paths. / Jou, Jer-Min; Chin, Chengli Cin; Li, Yi Ru.

In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 3, 1991, p. 1769-1772.

Research output: Contribution to journalArticle

TY - JOUR

T1 - PASS

T2 - A package for automatic scheduling and sharing pipelined data paths

AU - Jou, Jer-Min

AU - Chin, Chengli Cin

AU - Li, Yi Ru

PY - 1991

Y1 - 1991

N2 - A system for automatic scheduling and sharing data paths has been developed. It is generic; different design styles such as pipeline, chaining, loop pipelines, etc., have been considered, and solutions of fastest possible, cheapest possible, fastest within hardware constraints, or lowest cost within time constraint could be found according to the user's request. The entire design space then could be explored with it. The scheduling algorithm is stepwise selective, dealing with hardware urgency, time urgency, interconnection urgency, data urgency, and control urgency in a serial method with multiple levels of selections. the concept of the sharing algorithm is to consider the inter-influenced properties between operator-sharing and register-sharing, construct two inter-involved sharing criteria for them simultaneously, and then merge them concurrently.

AB - A system for automatic scheduling and sharing data paths has been developed. It is generic; different design styles such as pipeline, chaining, loop pipelines, etc., have been considered, and solutions of fastest possible, cheapest possible, fastest within hardware constraints, or lowest cost within time constraint could be found according to the user's request. The entire design space then could be explored with it. The scheduling algorithm is stepwise selective, dealing with hardware urgency, time urgency, interconnection urgency, data urgency, and control urgency in a serial method with multiple levels of selections. the concept of the sharing algorithm is to consider the inter-influenced properties between operator-sharing and register-sharing, construct two inter-involved sharing criteria for them simultaneously, and then merge them concurrently.

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

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

M3 - Article

AN - SCOPUS:0026400127

VL - 3

SP - 1769

EP - 1772

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -