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.
This work was supported by the Swiss National Science Foundation (SNF) under grant number 2100-59274.99.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
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)
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)
Bazargan, K., Kastner, R., Sarrafzadeh, M.: Fast Template Placement for Reconfigurable Computing Systems, vol. 17(1), pp. 68–83 (2000)
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)
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)
Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer, Dordrecht (2000)
Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing (9), 846–855 (1980)
Walder, H., Steiger, C., Platzner, M.: Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing. In: Reconfigurable Architectures Workshop (RAW) (2003)
Lim, D., Peattie, M.: Two Flows for Partial Reconfiguration: Module Based or Small Bit Manipulations. XAPP 290, Xilinx (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steiger, C., Walder, H., Platzner, M. (2003). Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices. In: Y. K. Cheung, P., Constantinides, G.A. (eds) Field Programmable Logic and Application. FPL 2003. Lecture Notes in Computer Science, vol 2778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45234-8_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-45234-8_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40822-2
Online ISBN: 978-3-540-45234-8
eBook Packages: Springer Book Archive