ACM Home Page
Please provide us with feedback. Feedback
Implementation of the reconfiguration port scheduling on the erlangen slot machine
Source
International Symposium on Field Programmable Gate Arrays archive
Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays table of contents
Monterey, California, USA
POSTER SESSION: Applications table of contents
Pages 282-282  
Year of Publication: 2009
ISBN:978-1-60558-410-2
Authors
Florian Dittmann  TWT GmbH, Science & Innovation, Stuttgart, Germany
Elmar Weber  University of Paderborn, Paderborn, Germany
Norma Montealegre  Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
Additional Information:

abstract   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1508128.1508192
What is a DOI?

ABSTRACT

Despite the possibility to execute several hardware tasks in parallel on an FPGA, partial reconfiguration is sequential. There exist only one reconfiguration port which is used exclusively during the reconfiguration of a task. Single processor scheduling algorithms for task reconfiguration with preemption are evaluated in a real time application implemented on the Erlangen Slot Machine. The Erlangen Slot Machine besides having reconfigurable connection of peripherals to pins of the FPGA, offers a large Virtex II FPGA, in which a reasonable number of slots can be implemented. In the example, the scheduling algorithm is implemented on the PowerPC processor available on the board. Among other results, preemption in the reconfiguration phase is shown.


Collaborative Colleagues:
Florian Dittmann: colleagues
Elmar Weber: colleagues
Norma Montealegre: colleagues