Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Computer Science and Information Engineering / 資訊工程學系
  4. Flow Time Minimization under Energy Constraints
 
  • Details

Flow Time Minimization under Energy Constraints

Resource
Asia and South Pacific Design Automation Conference , (ASP-DAC), 2007
Journal
Asia and South Pacific Design Automation Conference
Journal Issue
asp-dac
Pages
866-871
Date Issued
2007
Date
2007
Author(s)
Chen, Jian-Jia
Iwama, Kazuo
Kuo, Tei-Wei  
HSUEH-I LU 
TEI-WEI KUO  
DOI
10.1109/ASPDAC.2007.358098
URI
http://www.scopus.com/inward/record.url?eid=2-s2.0-46649092327&partnerID=MN8TOARS
http://scholars.lib.ntu.edu.tw/handle/123456789/331819
http://ntur.lib.ntu.edu.tw/bitstream/246246/232844/-1/11.pdf
Abstract
Power-aware and energy-efficient designs play important roles for modern hardware and software designs, especially for embedded systems. This paper targets a scheduling problem on a processor with the capability of dynamic voltage scaling (DVS), which could reduce the power consumption by slowing down the processor speed. The objective of the targeting problem is to minimize the average flow time of a set of jobs under a given energy constraint, where the flow time of a job is defined as the interval length between the arrival and the completion of the job. We consider two types of processors, which have a continuous spectrum of the available speeds or have only a finite number of discrete speeds. Two algorithms are given: (1) An algorithm is proposed to derive optimal solutions for processors with a continuous spectrum of the available speeds. (2) A greedy algorithm is designed for the derivation of optimal solutions for processors with a finite number of discrete speeds. The proposed algorithms are extended to cope with jobs with different weights for the minimization of the average weighted flow time. The proposed algorithms are also evaluated with comparisons to schedules which execute jobs at a common effective speed. © 2007 IEEE.
SDGs

[SDGs]SDG7

Other Subjects
Algorithms; Boolean functions; Computer aided design; Conservation; Dielectric losses; Digital integrated circuits; Embedded systems; Energy efficiency; Industrial engineering; Integrated circuits; Mechanization; Optimal systems; Software design; Voltage stabilizing circuits; Wireless telecommunication systems; Continuous spectrum; Design automation conference (DAC); Discrete speeds; Dynamic voltage scaling (DVS); energy constraints; Energy-efficient designs; Finite numbers; Flow-time; Greedy algorithms; Hardware and software; Optimal Solutions; Power consumption (CE); Power-aware; Processor speeds; Scheduling problems; South Pacific; Two types; Speed
Type
conference paper
File(s)
Loading...
Thumbnail Image
Name

11.pdf

Size

23.21 KB

Format

Adobe PDF

Checksum

(MD5):3c0a4a13d540e952b7cc7b52a1f74d4f

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science