A resource-constrained scheduling scheme that considers resources operating at multiple voltages and register assignment Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/5138jh286

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Power and timing requirements are becoming more and more stringent as applications move from less mobile devices to more mobile ones. As such, it is important to optimize these applications as much as possible in order to provide the best solution that is low power and low latency. Although there are many different techniques to achieve a low power, low latency solution, this thesis focuses specifically on low power scheduling at the behavioral level where resource-constrained scheduling is the technique of choice since it directly considers the resource limitations of mobile devices. Conventional resource-constrained scheduling schemes are concerned with minimizing the latency or improving the speed of an algorithm--represented by a data flow graph (DFG)--given a limitation on resources. However, these conventional resource-constrained scheduling schemes are no longer applicable since power has grown to be a major issue, especially in mobile devices. Hence, the conventional resource-constrained scheduling schemes gave way to current resource-constrained scheduling schemes that utilize multiple voltages, which work to find a balance between speed and power. These current multiple voltage schemes use various techniques to balance and meet the speed and power requirements. But while they do a good job of meeting these requirements, they fail to address a new issue that is beginning to surface the number of memory registers needed. Therefore, to address this new arising issue, this paper presents a novel resource-constrained scheduling scheme that balances the speed, power, and register requirements. This algorithm is compared to both a conventional resource-constrained scheduling scheme and a current resource-constrained scheduling scheme with multiple voltages to show that it performs better in finding a scheduling solution. Benchmark results show that, on average, our algorithm has a better power savings while keeping the maximum number of registers needed and the latency low compared to conventional resource-constrained scheduling schemes and current resource-constrained scheduling schemes utilizing just multiple voltages.
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
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 256 Grayscale) using Capture Perfect 3.0.82 on a Canon DR-9080C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-07-06T18:17:40Z (GMT). No. of bitstreams: 1 LeeChee2004.pdf: 988525 bytes, checksum: 46191831db3d84ebab5927c6146edd8d (MD5) Previous issue date: 2003-05-30
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-07-05T18:56:20Z (GMT) No. of bitstreams: 1 LeeChee2004.pdf: 988525 bytes, checksum: 46191831db3d84ebab5927c6146edd8d (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-07-06T18:17:40Z (GMT) No. of bitstreams: 1 LeeChee2004.pdf: 988525 bytes, checksum: 46191831db3d84ebab5927c6146edd8d (MD5)
  • description.provenance : Submitted by Sergio Trujillo (jstscanner@gmail.com) on 2012-06-25T18:52:14Z No. of bitstreams: 1 LeeChee2004.pdf: 988525 bytes, checksum: 46191831db3d84ebab5927c6146edd8d (MD5)

Relationships

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

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items