Low power scheduling schemes that consider latency and resource constraints at multiple voltages Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/t148fk81c

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Power reduction can be achieved at many different levels, such as architecture, algorithm, logic, and transistor levels in circuit design. This thesis focuses on low power scheduling at the algorithm level. We present a latency-constrained scheduling and a latency and resource constrained scheduling, which minimize power consumption for the resources and registers operating at multiple cycles and voltages. The proposed schemes are based on the consideration of assigning most nodes to low voltage and reducing the number of registers simultaneously. We present a comprehensive scheduling methodology to decrease average power, peak power, and the number of registers during the scheduling stage. To target this goal, we propose the efficient algorithms to schedule DFG with the least power dissipation that satisfies the system constraints in timing and resources. Our benchmark shows that our approach has succeeded to reduce power in 12.99~41.97% in latency-constrained scheduling and 20.19~80.64% in latency and resource constrained scheduling for those multimedia kernels.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Language
File Format
File Extent
  • 298148 bytes
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2006-07-11T18:29:48Z (GMT) No. of bitstreams: 1 thesis.pdf: 298148 bytes, checksum: 02ffb5c485017c3e29b24198d6b342c1 (MD5)
  • description.provenance : Made available in DSpace on 2006-07-25T16:15:34Z (GMT). No. of bitstreams: 1 thesis.pdf: 298148 bytes, checksum: 02ffb5c485017c3e29b24198d6b342c1 (MD5)
  • description.provenance : Submitted by Shyh-Sen Huang (huangsh@onid.orst.edu) on 2006-07-07T20:44:01Z No. of bitstreams: 1 thesis.pdf: 298148 bytes, checksum: 02ffb5c485017c3e29b24198d6b342c1 (MD5)

Relationships

In Administrative Set:
Last modified: 08/14/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items