Advertisement

A Preemption Algorithm for a Multitasking Environment on Dynamically Reconfigurable Processor

  • Vu Manh Tuan
  • Hideharu Amano
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4943)

Abstract

Task preemption is a critical mechanism for building an effective multitasking environment on dynamically reconfigurable processors. When being preempted, necessary state information of the interrupted task in registers and distributed internal memories must be correctly preserved. This paper aims at studying a method for saving and restoring the state data of a hardware task, executing on a dynamically reconfigurable processing array, taking into account the great amount and the distribution on different storage elements of data. Performance degradation caused by task preemption is minimized by allowing preemption only at predefined points where demanded resources are small. Specifically, we propose: 1) algorithms to insert preemption points subject to user-specified preemption latency and resource overhead constraints; 2) modification steps to incorporate the offered algorithms on the system design flow. Evaluation results on the NEC DRP architecture show that the proposed method achieves a reasonable hardware overhead (from 6% to 14%) while satisfying a given preemption latency.

Keywords

Critical Path Task Switching Hardware Overhead State Transition Graph Restore State Data 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kim, K., Karri, R., Potkonjak, M.: Micropreemption Synthesis: An Enabling Mechanism for Multitask VLSI Systems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25(1), 19–30 (2006)CrossRefGoogle Scholar
  2. 2.
    Jean, J.S.N., Tomko, K., Yavagal, V., Shah, J., Cook, R.: Dynamic reconfiguration to support concurrent applications. IEEE Trans. on Computers 48(6), 591–602 (1999)CrossRefGoogle Scholar
  3. 3.
    Brebner, G.: The Swappable Logic Unit: A Paradigm for Virtual Hardware. In: IEEE Symposium on FPGAs for CCMs, pp. 77–86 (1997)Google Scholar
  4. 4.
    Simmler, H., Levinson, L., Manner, R.: Multitasking on FPGA Coprocessors. In: Proc. of the 10th International Workshop on FPGA, pp. 121–130 (2000)Google Scholar
  5. 5.
    Levinson, L., Männer, R., Sesler, M., Simmler, H.: Preemptive Multitasking on FPGAs. In: Proc. of the 2000 IEEE Symposium on FCCM (2000)Google Scholar
  6. 6.
    Guccione, S.A., Levi, D., Sundararajan, P.: JBits: A Java-based interface for reconfigurable computing. In: Proc. of Second Annual MAPLD (September 1999)Google Scholar
  7. 7.
    Kalte, H., Porrmann, M.: Context Saving and Restoring for Multitasking in Reconfigurable Systems. In: Proc. of 15th FPL, vol. 228, pp. 223–228 (August 2005)Google Scholar
  8. 8.
    Koch, D., Haubelt, C., Teich, J.: Efficient hardware checkpointing: concepts, overhead analysis, and implementation. In: Proc. of FPGA, pp. 188–196 (February 2007)Google Scholar
  9. 9.
    Jovanovic, S., Tanougast, C., Weber, S.: A Hardware Preemptive Multitasking Mechanism Based on Scan-path Register Structure for FPGA-based Reconfigurable Systems. In: Proc. of NASA/ESA Conference on Adaptive Hardware and Systems (AHS), pp. 358–364 (August 2007)Google Scholar
  10. 10.
    Ullmann, M., Hübner, M., Grimm, B., Becker, J.: An FPGA Run-Time System for Dynamical On-Demand Reconfiguration. In: Proc. of 11th RAW (April 2004)Google Scholar
  11. 11.
    Motomura, M.: A Dynamically Reconfigurable Processor Architecture. Microprocessor Forum (October 2002)Google Scholar
  12. 12.
    Simonson, J., Patel, J.H.: Use of Preferred Preemption Points in Cache-Based Real-Time Systems. In: Proc. of International Computer Performance and Dependability Symposium, pp. 316–325 (April 1995)Google Scholar
  13. 13.
    Lee, E.A., Messerschmitt, D.C.: Static Scheduling of Synchronous Data flow Programs for Digital Signal Processing. IEEE Trans. on Computers 36(1), 24–36 (1987)zbMATHCrossRefGoogle Scholar
  14. 14.
    Aho, A.V., Sethi, R., Ullman, J.D.: Compiler: Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Vu Manh Tuan
    • 1
  • Hideharu Amano
    • 1
  1. 1.Keio University, Hiyoshi, KohokuYokohamaJapan

Personalised recommendations