Micro-preemption synthesis: An enabling mechanism for multi-task VLSI systems

Kyosun Kim, Ramesh Karri, Miodrag Potkonjak

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

Abstract

Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register files must be preserved in order for the task to be resumed. This entails extra memory to save the context and additional clock cycles to restore the context. In this paper, we present techniques and algorithms to incorporate micro-preemption constraints during multi-task VLSI system synthesis. Specifically, we have developed: (i) algorithms to insert and refine preemption points in scheduled task graphs subject to preemption latency constraints, (ii) techniques to minimize the context switch overhead by considering the dedicated registers required to save the state of a task on preemption and the shared registers required to save the remaining values in the tasks, and (iii) a controller based scheme to preclude preemption related performance degradation.

Original languageEnglish (US)
Title of host publicationIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
Editors Anon
PublisherIEEE Comp Soc
Pages33-38
Number of pages6
StatePublished - 1997
EventProceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD - San Jose, CA, USA
Duration: Nov 9 1997Nov 13 1997

Other

OtherProceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD
CitySan Jose, CA, USA
Period11/9/9711/13/97

Fingerprint

Clocks
Switches
Data storage equipment
Degradation
Controllers

ASJC Scopus subject areas

  • Software

Cite this

Kim, K., Karri, R., & Potkonjak, M. (1997). Micro-preemption synthesis: An enabling mechanism for multi-task VLSI systems. In Anon (Ed.), IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers (pp. 33-38). IEEE Comp Soc.

Micro-preemption synthesis : An enabling mechanism for multi-task VLSI systems. / Kim, Kyosun; Karri, Ramesh; Potkonjak, Miodrag.

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers. ed. / Anon. IEEE Comp Soc, 1997. p. 33-38.

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

Kim, K, Karri, R & Potkonjak, M 1997, Micro-preemption synthesis: An enabling mechanism for multi-task VLSI systems. in Anon (ed.), IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers. IEEE Comp Soc, pp. 33-38, Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD, San Jose, CA, USA, 11/9/97.
Kim K, Karri R, Potkonjak M. Micro-preemption synthesis: An enabling mechanism for multi-task VLSI systems. In Anon, editor, IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers. IEEE Comp Soc. 1997. p. 33-38
Kim, Kyosun ; Karri, Ramesh ; Potkonjak, Miodrag. / Micro-preemption synthesis : An enabling mechanism for multi-task VLSI systems. IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers. editor / Anon. IEEE Comp Soc, 1997. pp. 33-38
@inproceedings{5bf536f1d056400b9fe509ee35858467,
title = "Micro-preemption synthesis: An enabling mechanism for multi-task VLSI systems",
abstract = "Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register files must be preserved in order for the task to be resumed. This entails extra memory to save the context and additional clock cycles to restore the context. In this paper, we present techniques and algorithms to incorporate micro-preemption constraints during multi-task VLSI system synthesis. Specifically, we have developed: (i) algorithms to insert and refine preemption points in scheduled task graphs subject to preemption latency constraints, (ii) techniques to minimize the context switch overhead by considering the dedicated registers required to save the state of a task on preemption and the shared registers required to save the remaining values in the tasks, and (iii) a controller based scheme to preclude preemption related performance degradation.",
author = "Kyosun Kim and Ramesh Karri and Miodrag Potkonjak",
year = "1997",
language = "English (US)",
pages = "33--38",
editor = "Anon",
booktitle = "IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers",
publisher = "IEEE Comp Soc",

}

TY - GEN

T1 - Micro-preemption synthesis

T2 - An enabling mechanism for multi-task VLSI systems

AU - Kim, Kyosun

AU - Karri, Ramesh

AU - Potkonjak, Miodrag

PY - 1997

Y1 - 1997

N2 - Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register files must be preserved in order for the task to be resumed. This entails extra memory to save the context and additional clock cycles to restore the context. In this paper, we present techniques and algorithms to incorporate micro-preemption constraints during multi-task VLSI system synthesis. Specifically, we have developed: (i) algorithms to insert and refine preemption points in scheduled task graphs subject to preemption latency constraints, (ii) techniques to minimize the context switch overhead by considering the dedicated registers required to save the state of a task on preemption and the shared registers required to save the remaining values in the tasks, and (iii) a controller based scheme to preclude preemption related performance degradation.

AB - Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register files must be preserved in order for the task to be resumed. This entails extra memory to save the context and additional clock cycles to restore the context. In this paper, we present techniques and algorithms to incorporate micro-preemption constraints during multi-task VLSI system synthesis. Specifically, we have developed: (i) algorithms to insert and refine preemption points in scheduled task graphs subject to preemption latency constraints, (ii) techniques to minimize the context switch overhead by considering the dedicated registers required to save the state of a task on preemption and the shared registers required to save the remaining values in the tasks, and (iii) a controller based scheme to preclude preemption related performance degradation.

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

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

M3 - Conference contribution

SP - 33

EP - 38

BT - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

A2 - Anon, null

PB - IEEE Comp Soc

ER -