A Dynamic Scheduling and Placement Algorithm for Reconfigurable Hardware

Ahmadinia A, Bobda C, Teich J (2004)


Publication Type: Conference contribution

Publication year: 2004

Journal

Publisher: Springer-verlag

Edited Volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

City/Town: Berlin, Heidelberg

Book Volume: 2981

Pages Range: 125 - 139

Conference Proceedings Title: Proceedings of 17th International Conference on Architecture of Computing Systems, Lecture Notes in Computer Science

Event location: Augsburg DE

ISBN: 3-540-21238-8

Abstract

Recent generations of FPGAs allow run-time partial reconfiguration. To increase the efficacy of reconfigurable computing, multitasking on FPGAs is proposed. One of the challenging problems in multitasking systems is online template placement. In this paper, we describe how existing algorithms work, and propose a new free space manager which is one main part of the placement algorithm. The decision where to place a new module depends on its finishing time mobility. Therefore the proposed algorithm is a combination of scheduling and placement. The simulation results show a better performance against existing methods. © Springer-Verlag 2004.

Authors with CRIS profile

Related research project(s)

How to cite

APA:

Ahmadinia, A., Bobda, C., & Teich, J. (2004). A Dynamic Scheduling and Placement Algorithm for Reconfigurable Hardware. In Proceedings of 17th International Conference on Architecture of Computing Systems, Lecture Notes in Computer Science (pp. 125 - 139). Augsburg, DE: Berlin, Heidelberg: Springer-verlag.

MLA:

Ahmadinia, Ali, Christophe Bobda, and Jürgen Teich. "A Dynamic Scheduling and Placement Algorithm for Reconfigurable Hardware." Proceedings of the 17th International Conference on Architecture of Computing Systems (ARCS 2004), Augsburg Berlin, Heidelberg: Springer-verlag, 2004. 125 - 139.

BibTeX: Download