Piecewise linear schedules for recurrence equations

Sanjay Rajopadhye, Lap Mui, Sayfe Kiaei

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

4 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationWorkshop on VLSI Signal Processing 1992
EditorsWojtek Przytula, Kung Yao, Rajeev Jain, Jan Rabaey
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages375-384
Number of pages10
ISBN (Electronic)0780308115, 9780780308114
DOIs
StatePublished - Jan 1 1992
Externally publishedYes
Event6th IEEE Workshop on VLSI Signal Processing - Los Angeles, United States
Duration: Oct 28 1992Oct 30 1992

Publication series

NameWorkshop on VLSI Signal Processing 1992

Conference

Conference6th IEEE Workshop on VLSI Signal Processing
CountryUnited States
CityLos Angeles
Period10/28/9210/30/92

Fingerprint

Recurrence Equations
Piecewise Linear
Schedule
Scheduling
Affine Function
Linear Function
Scheduling Problem
Timing
Slope
Synthesis

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

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 (pp. 375-384). [641069] (Workshop on VLSI Signal Processing 1992). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/VLSISP.1992.641069

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 proceedingConference 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
Rajopadhye S, Mui L, Kiaei S. Piecewise linear schedules for recurrence equations. In Przytula W, Yao K, Jain R, Rabaey J, editors, Workshop on VLSI Signal Processing 1992. Institute of Electrical and Electronics Engineers Inc. 1992. p. 375-384. 641069. (Workshop on VLSI Signal Processing 1992). https://doi.org/10.1109/VLSISP.1992.641069
Rajopadhye, Sanjay ; Mui, Lap ; Kiaei, Sayfe. / Piecewise linear schedules for recurrence equations. Workshop on VLSI Signal Processing 1992. editor / Wojtek Przytula ; Kung Yao ; Rajeev Jain ; Jan Rabaey. Institute of Electrical and Electronics Engineers Inc., 1992. pp. 375-384 (Workshop on VLSI Signal Processing 1992).
@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",
year = "1992",
month = "1",
day = "1",
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/1/1

Y1 - 1992/1/1

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.

ER -