Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/64331
Title: Loop scheduling for real-time DSPs with minimum switching activities on multiple-functional-unit architectures
Authors: Shao, Z
Zhuge, Q
Liu, M
Sha, EHM
Xiao, B 
Issue Date: 2004
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), v. 3207, p. 53-63 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: This paper studies the scheduling problem that minimizes both schedule length and switching activities for applications with loops on multiple-functional-unit architectures. We formally prove that to find a schedule that has the minimal switching activities among all minimum-latency schedules with or without resource constraints is NP-complete. An algorithm, SAMLS (Switching-Activity Minimization Loop Scheduling), is proposed to minimize both schedule length and switching activities. In SAMLS, the best schedule is selected from the ones generated from a given initial schedule by repeatedly rescheduling the nodes with schedule length and switching activities minimization based on rotation scheduling and bipartite matching. The experimental results show our algorithm can greatly reduce both schedule length and switching activities compared with the previous work.
Description: International Conference on Embedded and Ubiquitous Computing (EUC 2004), Aizu-Wakamatsu City, 25-27 Aug 2004
URI: http://hdl.handle.net/10397/64331
ISBN: 978-3-540-22906-3 (print)
978-3-540-30121-9 (online)
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-540-30121-9_6
Appears in Collections:Conference Paper

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

Page view(s)

20
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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