Share Email Print

Proceedings Paper

Three list scheduling temporal partitioning agorithm of time space characteristic analysis and compare for dynamic reconfigurable computing
Author(s): Naijin Chen
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 4 March 2013
PDF: 7 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 876851 (4 March 2013); doi: 10.1117/12.2011867
Show Author Affiliations
Naijin Chen, Anhui Polytechnic Univ. (China)
Tongji Univ. (China)

Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, Editor(s)

© SPIE. Terms of Use
Back to Top