Piecewise linear schedules for recurrence equations

Sanjay Rajopadhye; Lap Mui; Sayfe Kiaei

doi:10.1109/VLSISP.1992.641069

Piecewise linear schedules for recurrence equations

Sanjay Rajopadhye, Lap Mui, Sayfe Kiaei

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

Abstract

The scheduling problem for a system of affine recurrence equations (SARE) has been studied by many researchers. The emphasis has been on an important class of timing functions called linear or affine schedules. For many SAREs, linear schedules may not exist, although the SARE is computable. It will be shown that it is possible to find piecewise linear schedules (PLS) for many practical algorithms expressed in terms of SAREs. PLS have different slopes for different variables in the algorithm. For each variable, the computation domain is partitioned into finitely many "pieces" in which the schedule is different for each subdomain. The main focus of this paper is to introduce PLS and develop a synthesis procedure to find PLS for the given SARE.

Original language	English (US)
Title of host publication	Workshop on VLSI Signal Processing 1992
Editors	Wojtek Przytula, Kung Yao, Rajeev Jain, Jan Rabaey
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	375-384
Number of pages	10
ISBN (Electronic)	0780308115, 9780780308114
DOIs	https://doi.org/10.1109/VLSISP.1992.641069
State	Published - 1992
Externally published	Yes
Event	6th IEEE Workshop on VLSI Signal Processing - Los Angeles, United States Duration: Oct 28 1992 → Oct 30 1992

Publication series

Name	Workshop on VLSI Signal Processing 1992

Conference

Conference	6th IEEE Workshop on VLSI Signal Processing
Country/Territory	United States
City	Los Angeles
Period	10/28/92 → 10/30/92

ASJC Scopus subject areas

Signal Processing
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1109/VLSISP.1992.641069

Cite this

Piecewise linear schedules for recurrence equations. / Rajopadhye, Sanjay; Mui, Lap; Kiaei, Sayfe.
Workshop on VLSI Signal Processing 1992. ed. / Wojtek Przytula; Kung Yao; Rajeev Jain; Jan Rabaey. Institute of Electrical and Electronics Engineers Inc., 1992. p. 375-384 641069 (Workshop on VLSI Signal Processing 1992).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Rajopadhye, S, Mui, L & Kiaei, S 1992, Piecewise linear schedules for recurrence equations. in W Przytula, K Yao, R Jain & J Rabaey (eds), Workshop on VLSI Signal Processing 1992., 641069, Workshop on VLSI Signal Processing 1992, Institute of Electrical and Electronics Engineers Inc., pp. 375-384, 6th IEEE Workshop on VLSI Signal Processing, Los Angeles, United States, 10/28/92. https://doi.org/10.1109/VLSISP.1992.641069

@inproceedings{b79a595e4b724862be81da05b4350668,

title = "Piecewise linear schedules for recurrence equations",

abstract = "The scheduling problem for a system of affine recurrence equations (SARE) has been studied by many researchers. The emphasis has been on an important class of timing functions called linear or affine schedules. For many SAREs, linear schedules may not exist, although the SARE is computable. It will be shown that it is possible to find piecewise linear schedules (PLS) for many practical algorithms expressed in terms of SAREs. PLS have different slopes for different variables in the algorithm. For each variable, the computation domain is partitioned into finitely many {"}pieces{"} in which the schedule is different for each subdomain. The main focus of this paper is to introduce PLS and develop a synthesis procedure to find PLS for the given SARE.",

author = "Sanjay Rajopadhye and Lap Mui and Sayfe Kiaei",

note = "Funding Information: {\textquoteleft}This research is supported by the NSF-RIA grant MIP-9011227. Publisher Copyright: {\textcopyright} 1992 IEEE.; 6th IEEE Workshop on VLSI Signal Processing ; Conference date: 28-10-1992 Through 30-10-1992",

year = "1992",

doi = "10.1109/VLSISP.1992.641069",

language = "English (US)",

series = "Workshop on VLSI Signal Processing 1992",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "375--384",

editor = "Wojtek Przytula and Kung Yao and Rajeev Jain and Jan Rabaey",

booktitle = "Workshop on VLSI Signal Processing 1992",

}

TY - GEN

T1 - Piecewise linear schedules for recurrence equations

AU - Rajopadhye, Sanjay

AU - Mui, Lap

AU - Kiaei, Sayfe

PY - 1992

Y1 - 1992

N2 - The scheduling problem for a system of affine recurrence equations (SARE) has been studied by many researchers. The emphasis has been on an important class of timing functions called linear or affine schedules. For many SAREs, linear schedules may not exist, although the SARE is computable. It will be shown that it is possible to find piecewise linear schedules (PLS) for many practical algorithms expressed in terms of SAREs. PLS have different slopes for different variables in the algorithm. For each variable, the computation domain is partitioned into finitely many "pieces" in which the schedule is different for each subdomain. The main focus of this paper is to introduce PLS and develop a synthesis procedure to find PLS for the given SARE.

AB - The scheduling problem for a system of affine recurrence equations (SARE) has been studied by many researchers. The emphasis has been on an important class of timing functions called linear or affine schedules. For many SAREs, linear schedules may not exist, although the SARE is computable. It will be shown that it is possible to find piecewise linear schedules (PLS) for many practical algorithms expressed in terms of SAREs. PLS have different slopes for different variables in the algorithm. For each variable, the computation domain is partitioned into finitely many "pieces" in which the schedule is different for each subdomain. The main focus of this paper is to introduce PLS and develop a synthesis procedure to find PLS for the given SARE.

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

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

U2 - 10.1109/VLSISP.1992.641069

DO - 10.1109/VLSISP.1992.641069

M3 - Conference contribution

AN - SCOPUS:0012524474

T3 - Workshop on VLSI Signal Processing 1992

SP - 375

EP - 384

BT - Workshop on VLSI Signal Processing 1992

A2 - Przytula, Wojtek

A2 - Yao, Kung

A2 - Jain, Rajeev

A2 - Rabaey, Jan

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 6th IEEE Workshop on VLSI Signal Processing

Y2 - 28 October 1992 through 30 October 1992

ER -

Piecewise linear schedules for recurrence equations

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this