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 language | English (US) |
---|---|
Title of host publication | IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers |
Editors | Anon |
Publisher | IEEE Comp Soc |
Pages | 33-38 |
Number of pages | 6 |
State | Published - 1997 |
Event | Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD - San Jose, CA, USA Duration: Nov 9 1997 → Nov 13 1997 |
Other
Other | Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD |
---|---|
City | San Jose, CA, USA |
Period | 11/9/97 → 11/13/97 |
ASJC Scopus subject areas
- Software