Hardware Task Scheduling and Placement in Operating Systems for Dynamically Reconfigurable SoC

  • Yuan-Hsiu Chen
  • Pao-Ann Hsiung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3824)


Existing operating systems can manage the execution of software tasks efficiently, however the manipulation of hardware tasks is very limited. In the research on the design and implementation of an embedded operating system that manages both software and hardware tasks in the same framework, two major issues are the dynamic scheduling and the dynamic placement of hardware tasks into a reconfigurable logic space in an SoC . The distinguishing criteria for good dynamic scheduling and placement methods include the total schedule length and the amount of fragmentation incurred while tasks are dynamically placed and replaced. Existing methods either do not take fragmentation into consideration or postpone the consideration of fragmentation to a later stage of space allocation. In our method, we try to reduce fragmentation during placement itself. The advantage of such an approach is that not only the reconfigurable space is utilized more efficiently, but the total schedule length is also reduced, that is, hardware tasks complete faster. Experimental results on large random tasks sets have shown that the proposed improvement is as much as 23.3% in total fragmentation and 2.0% in total schedule time.


Operating System for Reconfigurable SoC Hardware Scheduling Placement Dynamic Partial Reconfiguration 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bansal, N., Harchol-Balter, M.: Analysis of SRPT scheduling: investigating unfairness. In: Proc. of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 279–290. ACM Press, New York (2001)Google Scholar
  2. 2.
    Leung, J.: A new algorithm for scheduling periodic, real-time tasks. Algorithmica 4, 209–219 (1989)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Loo, S.M., Wells, B.E.: Task scheduling in a finite resource reconfigurable hardware/software co-design environment. INFORMS Journal on Computing (2005) (to appear)Google Scholar
  4. 4.
    Mei, B., Schaumont, P., Vernalde, S.: A hardware-software partitioning and scheduling algorithm for dynamically reconfigurable embedded systems. In: Proc. of the 11th ProRISC Workshop on Circuits, Systems, and Signal Processing (2000)Google Scholar
  5. 5.
    Noguera, J., Badia, R.M.: System-level power-performance trade-offs in task scheduling for dynamically reconfigurable architectures. In: Proc. of the 2003 International Conference on Compilers, Architectures and Synthesis for Embedded Systems, pp. 73–83. ACM Press, New York (2003)CrossRefGoogle Scholar
  6. 6.
    Steiger, C., Walder, H., Platzner, M.: Operating systems for reconfigurable embedded platforms: Online scheduling of real-time tasks. IEEE Transactions on Computers 53(11), 1392–1407 (2004)CrossRefGoogle Scholar
  7. 7.
    Walder, H., Platzner, M.: Online scheduling for block-partitioned reconfigurable devices. In: Proc. of the Design Automation and Test, Europe (DATE), March 2003, vol. 1, pp. 290–295 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yuan-Hsiu Chen
    • 1
  • Pao-Ann Hsiung
    • 1
  1. 1.National Chung Cheng UniversityChiayiTaiwan, R.O.C

Personalised recommendations