Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices

  • Christoph Steiger
  • Herbert Walder
  • Marco Platzner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2778)

Abstract

Partially reconfigurable devices allow to configure and execute tasks in a true multitasking manner. The main characteristics of mapping tasks to such devices is the strong nexus between scheduling and placement. In this paper, we formulate a new online real-time scheduling problem and present two heuristics, the horizon and the stuffing technique, to tackle it. Simulation experiments evaluate the performance and the runtime efficiency of the schedulers. Finally, we discuss our prototyping work toward an integration of scheduling and placement into an operating system for reconfigurable devices.

Keywords

Schedule Problem Competitive Ratio Area Model Online Schedule Schedule Horizon 
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.
    Brebner, G.: A Virtual Hardware Operating System for the Xilinx XC6200. In: Glesner, M., Hartenstein, R.W. (eds.) FPL 1996. LNCS, vol. 1142, pp. 327–336. Springer, Heidelberg (1996)Google Scholar
  2. 2.
    Walder, H., Platzner, M.: Reconfigurable Hardware Operating Systems: From Concepts to Realizations. In: Int’l Conf. on Engineering of Reconfigurable Systems and Architectures (ERSA) (2003)Google Scholar
  3. 3.
    Brebner, G., Diessel, O.: Chip-Based Reconfigurable Task Management. In: Brebner, G., Woods, R. (eds.) FPL 2001. LNCS, vol. 2147, pp. 182–191. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Diessel, O., ElGindy, H., Middendorf, M., Schmeck, H., Schmidt, B.: Dynamic scheduling of tasks on partially reconfigurable FPGAs, vol. 147(3), pp. 181–188 (2000)Google Scholar
  5. 5.
    Bazargan, K., Kastner, R., Sarrafzadeh, M.: Fast Template Placement for Reconfigurable Computing Systems, vol. 17(1), pp. 68–83 (2000)Google Scholar
  6. 6.
    Fekete, S., Köhler, E., Teich, J.: Optimal FPGA Module Placement with Temporal Precedence Constraints. In: Design Automation and Test in Europe (DATE), pp. 658–665 (2001)Google Scholar
  7. 7.
    Marescaux, T., Bartic, A.: Interconnection Networks Enable Fine-Grain Dynamic Multi-tasking on FPGAs. In: Glesner, M., Zipf, P., Renovell, M. (eds.) FPL 2002. LNCS, vol. 2438, pp. 795–805. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer, Dordrecht (2000)Google Scholar
  9. 9.
    Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing (9), 846–855 (1980)Google Scholar
  10. 10.
    Walder, H., Steiger, C., Platzner, M.: Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing. In: Reconfigurable Architectures Workshop (RAW) (2003)Google Scholar
  11. 11.
    Lim, D., Peattie, M.: Two Flows for Partial Reconfiguration: Module Based or Small Bit Manipulations. XAPP 290, Xilinx (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Christoph Steiger
    • 1
  • Herbert Walder
    • 1
  • Marco Platzner
    • 1
  1. 1.Swiss Federal Institute of Technology (ETH)ZurichSwitzerland

Personalised recommendations