Three list scheduling temporal partitioning agorithm of time space characteristic analysis and compare for dynamic reconfigurable computing

Naijin Chen

doi:10.1117/12.2011867

4 March 2013 Three list scheduling temporal partitioning algorithm of time space characteristic analysis and compare for dynamic reconfigurable computing

Naijin Chen

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.

Citation Download Citation

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); https://doi.org/10.1117/12.2011867

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available