Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs

Ramesh Karri, A. Orailoglu

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

Abstract

The authors develop software mechanisms for incorporating on-chip self-recovery-using checkpointing and rollback-during high-level synthesis. They propose an algorithm for rollback point insertion to minimize rollback overhead. It identifies good rollback points by successively eliminating clock cycle boundaries that are either expensive or violate the recovery time constraint. Only the minimum number of rollback points are inserted. A flexible synthesis methodology is presented in which rollback point insertion can precede, succeed, or be intertwined with scheduling. A novel edge-based scheduling algorithm is described that schedules edges to clock cycle boundaries, in addition to scheduling nodes to clock cycles. The system has been used to schedule flow graphs from the literature. Experimental results are presented.

Original languageEnglish (US)
Title of host publicationFTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages519-526
Number of pages8
ISBN (Electronic)0818628758, 9780818628757
DOIs
StatePublished - Jan 1 1992
Event22nd Annual International Symposium on Fault-Tolerant Computing, FTCS 1992 - Boston, United States
Duration: Jul 8 1992Jul 10 1992

Publication series

NameFTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing

Conference

Conference22nd Annual International Symposium on Fault-Tolerant Computing, FTCS 1992
CountryUnited States
CityBoston
Period7/8/927/10/92

Fingerprint

Application specific integrated circuits
Clocks
Scheduling
Flow graphs
Recovery
Scheduling algorithms
High level synthesis

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality
  • Hardware and Architecture

Cite this

Karri, R., & Orailoglu, A. (1992). Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs. In FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing (pp. 519-526). [243581] (FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/FTCS.1992.243581

Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs. / Karri, Ramesh; Orailoglu, A.

FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing. Institute of Electrical and Electronics Engineers Inc., 1992. p. 519-526 243581 (FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing).

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

Karri, R & Orailoglu, A 1992, Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs. in FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing., 243581, FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing, Institute of Electrical and Electronics Engineers Inc., pp. 519-526, 22nd Annual International Symposium on Fault-Tolerant Computing, FTCS 1992, Boston, United States, 7/8/92. https://doi.org/10.1109/FTCS.1992.243581
Karri R, Orailoglu A. Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs. In FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing. Institute of Electrical and Electronics Engineers Inc. 1992. p. 519-526. 243581. (FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing). https://doi.org/10.1109/FTCS.1992.243581
Karri, Ramesh ; Orailoglu, A. / Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs. FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing. Institute of Electrical and Electronics Engineers Inc., 1992. pp. 519-526 (FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing).
@inproceedings{a11db6046b814007bd22063fd002aa98,
title = "Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs",
abstract = "The authors develop software mechanisms for incorporating on-chip self-recovery-using checkpointing and rollback-during high-level synthesis. They propose an algorithm for rollback point insertion to minimize rollback overhead. It identifies good rollback points by successively eliminating clock cycle boundaries that are either expensive or violate the recovery time constraint. Only the minimum number of rollback points are inserted. A flexible synthesis methodology is presented in which rollback point insertion can precede, succeed, or be intertwined with scheduling. A novel edge-based scheduling algorithm is described that schedules edges to clock cycle boundaries, in addition to scheduling nodes to clock cycles. The system has been used to schedule flow graphs from the literature. Experimental results are presented.",
author = "Ramesh Karri and A. Orailoglu",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/FTCS.1992.243581",
language = "English (US)",
series = "FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "519--526",
booktitle = "FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing",

}

TY - GEN

T1 - Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs

AU - Karri, Ramesh

AU - Orailoglu, A.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - The authors develop software mechanisms for incorporating on-chip self-recovery-using checkpointing and rollback-during high-level synthesis. They propose an algorithm for rollback point insertion to minimize rollback overhead. It identifies good rollback points by successively eliminating clock cycle boundaries that are either expensive or violate the recovery time constraint. Only the minimum number of rollback points are inserted. A flexible synthesis methodology is presented in which rollback point insertion can precede, succeed, or be intertwined with scheduling. A novel edge-based scheduling algorithm is described that schedules edges to clock cycle boundaries, in addition to scheduling nodes to clock cycles. The system has been used to schedule flow graphs from the literature. Experimental results are presented.

AB - The authors develop software mechanisms for incorporating on-chip self-recovery-using checkpointing and rollback-during high-level synthesis. They propose an algorithm for rollback point insertion to minimize rollback overhead. It identifies good rollback points by successively eliminating clock cycle boundaries that are either expensive or violate the recovery time constraint. Only the minimum number of rollback points are inserted. A flexible synthesis methodology is presented in which rollback point insertion can precede, succeed, or be intertwined with scheduling. A novel edge-based scheduling algorithm is described that schedules edges to clock cycle boundaries, in addition to scheduling nodes to clock cycles. The system has been used to schedule flow graphs from the literature. Experimental results are presented.

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

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

U2 - 10.1109/FTCS.1992.243581

DO - 10.1109/FTCS.1992.243581

M3 - Conference contribution

T3 - FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing

SP - 519

EP - 526

BT - FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing

PB - Institute of Electrical and Electronics Engineers Inc.

ER -