English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94201/94201 (100%)
造訪人次 : 81699048      線上人數 : 3463
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/106191


    題名: Adaptive scheduling for parallel tasks with QoS satisfaction for hybrid cloud environments
    作者: 王尉任;Wang, Wei-Jen;Chang, Yue-Shan;Lo, Win-Tsung;Lee, Yi-Kang
    貢獻者: 資訊電機學院資訊工程學系
    關鍵詞: Algorithms;Compilers;Computer Science;Interpreters;Processor Architectures;Programming Languages
    日期: 2013-02-11
    上傳時間: 2026-04-23 13:12:46 (UTC+8)
    出版者: Springer Netherlands;Boston: Springer US
    摘要: 摘要: A hybrid cloud integrates private clouds and public clouds into one unified environment. For the economy and the efficiency reasons, the hybrid cloud environment should be able to automatically maximize the utilization rate of the private cloud and minimize the cost of the public cloud when users submit their computing jobs to the environment. In this paper, we propose the Adaptive-Scheduling-with-QoS-Satisfaction algorithm, namely AsQ , for the hybrid cloud environment to raise the resource utilization rate of the private cloud and to diminish task response time as much as possible. We exploit runtime estimation and several fast scheduling strategies for near-optimal resource allocation, which results in high resource utilization rate and low execution time in the private cloud. Moreover, the near-optimal allocation in the private cloud can reduce the amount of tasks that need to be executed on the public cloud to satisfy their deadline. For the tasks that have to be dispatched to the public cloud, we choose the minimal cost strategy to reduce the cost of using public clouds based on the characteristics of tasks such as workload size and data size. Therefore, the AsQ can achieve a total optimization regarding cost and deadline constraints. Many experiments have been conducted to evaluate the performance of the proposed AsQ. The results show that the performance of the proposed AsQ is superior to recent similar algorithms in terms of task waiting time, task execution time and task finish time. The results also show that the proposed algorithm achieves a better QoS satisfaction rate than other similar studies.
    其他題名: J Supercomput
    出版者: Boston: Springer US
    出版日期: 2013-11
    出處: The Journal of supercomputing, 2013-11, Vol.66 (2), p.783-811
    資源來源: Springer Journals Access Only (NTUSG)
    版權: Springer Science+Business Media New York 2013
    識別號: ISSN: 0920-8542
    識別號: EISSN: 1573-0484
    識別號: DOI: 10.1007/s11227-013-0890-2
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML11檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明