Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16000
Title: Algorithms and analysis of scheduling for loops with minimum switching
Authors: Shao, Z 
Zhuge, Q
Liu, M
Xue, C
Sha, EHM
Xiao, B 
Keywords: Loop
Low power
Scheduling
Switching activity
Issue Date: 2006
Source: International journal of computational science and engineering, 2006, v. 2, no. 1-2, p. 88-97 How to cite?
Journal: International Journal of Computational Science and Engineering 
Abstract: Switching activity and schedule length are the two of the most important factors in power dissipation. This paper studies the scheduling problem that minimises both schedule length and switching activities for applications with loops on multiple functional unit architectures. We show that, to find a schedule that has the minimal switching activities among all minimum latency schedules with or without resource constraints is NP-complete. Although the minimum latency scheduling problem is polynomial time solvable if there is no resource constraint or only one functional unit (FU), the problem becomes NP-complete when switching activities are considered as the second constraint. An algorithm, Power Reduction Rotation Scheduling (PRRS), is proposed. The algorithm attempts to minimise both switching activities and schedule length while performing scheduling and allocation simultaneously. Compared with the list scheduling, PRRS shows an average of 20.1% reduction in schedule length and 52.2% reduction in bus switching activities. Our algorithm also shows better performance than the approach that considers scheduling and allocation in separate phases.
URI: http://hdl.handle.net/10397/16000
ISSN: 1742-7185
DOI: 10.1504/IJCSE.2006.009939
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

7
Last Week
0
Last month
1
Citations as of Dec 3, 2017

Page view(s)

54
Last Week
1
Last month
Checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.