Scheduling and 2D placement heuristics for partially reconfigurable systems
Name
Redaelli-2009-Scheduling and 2D placement heuristics for partially reconfigurable systems.pdf
Size
1.16 MB
Format
Adobe PDF
Checksum (MD5)
1e32d82b364f53b1863f1d7f672bfd3c
Author(s)
Santambrogio, Marco Domenico
Redaelli, F.
Rana, V.
Ogrenci Memik, S.
Date Issued
January 2010
Journal
International Conference on Field-Programmable Technology, 2009. FPT 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Redaelli, F. et al. “Scheduling and 2D placement heuristics for partially reconfigurable systems.” Field-Programmable Technology, 2009. FPT 2009. International Conference on. 2009. 223-230. © 2010 IEEE.
Version
Final published version
Abstract
This paper proposes new scheduling and 2D placement heuristics for partially dynamically reconfigurable systems. One specific focus of this work is to deal with applications containing hundreds of tasks grouped in a few number of task types. Such a task graph structure is representative of data intensive high performance applications. We present three variations to our task management method that correspond to three possible system scenarios: (i) possessing complete static knowledge of task sequences, (ii) only having information on the maximum resource requirement by any task expected to be executed, and (iii) having no prior knowledge of any kind about the workload. Each variant of our scheduler addresses an architecture that best matches the needs of a particular configuration of the system. Together they form a complete set of techniques to serve partial dynamic reconfiguration of massively parallel computing systems.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1109/FPT.2009.5377683
