4 March 2013 Three list scheduling temporal partitioning algorithm of time space characteristic analysis and compare for dynamic reconfigurable computing
Author Affiliations +
Proceedings Volume 8768, International Conference on Graphic and Image Processing (ICGIP 2012); 876851 (2013) https://doi.org/10.1117/12.2011867
Event: 2012 International Conference on Graphic and Image Processing, 2012, Singapore, Singapore
Abstract
Level Based Partitioning (LBP) algorithm, Cluster Based Partitioning (CBP) algorithm and Enhance Static List (ESL) temporal partitioning algorithm based on adjacent matrix and adjacent table are designed and implemented in this paper. Also partitioning time and memory occupation based on three algorithms are compared. Experiment results show LBP partitioning algorithm possesses the least partitioning time and better parallel character, as far as memory occupation and partitioning time are concerned, algorithms based on adjacent table have less partitioning time and less space memory occupation.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Naijin Chen, Naijin Chen, } "Three list scheduling temporal partitioning algorithm of time space characteristic analysis and compare for dynamic reconfigurable computing", Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 876851 (4 March 2013); doi: 10.1117/12.2011867; https://doi.org/10.1117/12.2011867
PROCEEDINGS
7 PAGES


SHARE
Back to Top