Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊工程學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/53195
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor劉邦鋒(Pangfeng Liu)
dc.contributor.authorTing-Wei Changen
dc.contributor.author張庭維zh_TW
dc.date.accessioned2021-06-15T16:50:14Z-
dc.date.available2025-12-31
dc.date.copyright2015-08-07
dc.date.issued2015
dc.date.submitted2015-08-07
dc.identifier.citation[1] Michael Armbrust, O Fox, Rean Griffith, Anthony D Joseph, Y Katz, Andy Kon-
winski, Gunho Lee, David Patterson, Ariel Rabkin, Ion Stoica, et al. M.: Above the
clouds: a berkeley view of cloud computing. 2009.
[2] Tharam Dillon, Chen Wu, and Elizabeth Chang. Cloud computing: issues and chal-
lenges. In Advanced Information Networking and Applications (AINA), 2010 24th
IEEE International Conference on, pages 27–33. Ieee, 2010.
[3] Jian Li, Sen Su, Xiang Cheng, Meina Song, Liyu Ma, and Jie Wang. Cost-efficient
coordinated scheduling for leasing cloud resources on hybrid workloads. Parallel
Computing, 44:1–17, 2015.
[4] Abhishek Verma, Luis Pedrosa, Madhukar Korupolu, David Oppenheimer, Eric
Tune, andJohnWilkes. Large-scaleclustermanagementatgooglewithborg. InPro-
ceedings of the Tenth European Conference on Computer Systems, page 18. ACM,
2015.
[5] Saurabh Kumar Garg, Srinivasa K Gopalaiyengar, and Rajkumar Buyya. Sla-based
resource provisioning for heterogeneous workloads in a virtualized cloud datacenter.
In Algorithms and Architectures for Parallel Processing, pages 371–384. Springer,
2011.
[6] Martin T Hagan, Howard B Demuth, Mark H Beale, et al. Neural network design.
Pws Pub. Boston, 1996.
[7] Chee Shin Yeo and Rajkumar Buyya. Service level agreement based allocation of
cluster resources: Handling penalty to enhance utility. In Cluster Computing, 2005.
IEEE International, pages 1–10. IEEE, 2005.
[8] Linlin Wu, Saurabh Kumar Garg, and Rajkumar Buyya. Sla-based resource alloca-
tion for software as a service provider (saas) in cloud computing environments. In
Cluster, Cloud and Grid Computing (CCGrid), 2011 11th IEEE/ACM International
Symposium on, pages 195–204. IEEE, 2011.
[9] Raymond Keith Clark. Scheduling dependent real-time activities. PhD thesis,
Carnegie Mellon University, 1990.
[10] Shuo Liu, Gang Quan, and Shangping Ren. On-line scheduling of real-time services
forcloudcomputing. InServices(SERVICES-1), 20106thWorldCongresson, pages
459–464. IEEE, 2010.
[11] Yue Yu, Shangping Ren, Nianen Chen, and Xing Wang. Profit and penalty aware
(pp-aware) scheduling for tasks with variable task execution time. In Proceedings
of the 2010 ACM Symposium on Applied Computing, pages 334–339. ACM, 2010.
[12] Hyeonjoong Cho, Binoy Ravindran, and E Douglas Jensen. On utility accrual pro-
cessor scheduling with wait-free synchronization for embedded real-time software.
In Proceedings of the 2006 ACM symposium on Applied computing, pages 918–922.
ACM, 2006.
[13] R Garey Michael and S Johnson David. Computers and intractability: a guide to the
theory of np-completeness. WH Freeman & Co., San Francisco, page 237, 1979.
[14] Michael L Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer, 2012.
[15] Shrikant S Panwalkar and Wafik Iskander. A survey of scheduling rules. Operations
research, 25(1):45–61, 1977.
[16] Myunggwon Hwang, Dongjin Choi, and Pankoo Kim. Least slack time rate first:
New scheduling algorithm for multi-processor environment. In Complex, Intelligent and Software Intensive Systems (CISIS), 2010 International Conference on, pages
806–811. IEEE, 2010.
[17] San diego supercomputer center. http://www.sdsc.edu/.
[18] D Feitelson, D TALBY, and JP JONES. Standard workload format, 2007.
[19] The internet traffic archive. http://ita.ee.lbl.gov/.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/53195-
dc.description.abstract在這篇論文中,我們描述了一個可以將資源分配給批次工作和互動式工作,並讓它們同時運行的系統架構。在這個系統中,每個工作有各自的服務協議層級,違反服務協議層級會導致罰款。我們提出了一個可以量化批次工作和互動式工作的罰款的模型。以此模型為基礎,我們提出了一個估計批次工作和互動式工作的罰款,並降低總罰款的演算法。我們的實驗結果指出此系統可以正確的將資源分配給不同類型的工作,藉以有效地降低總罰款。zh_TW
dc.description.abstractIn this paper we describe a scheduling framework that allocates resources to both batch jobs and interactive jobs simultaneously in a private cloud with a static amount of resources. In the system, every job has an individual service level agreement (SLA), and violating the SLA incurs penalty. We propose a model to formally quantify the SLA violation penalty of both batch and interactive jobs. The analysis on the interactive jobs focuses on queuing analysis and response time. The analysis on batch jobs focuses on the non-preemptive job
scheduling for multiple processing units. Based on this model we also propose algorithms to estimate the penalty for both batch jobs and interactive jobs, and algorithms that reduce the total SLA violation penalty. Our experiment results suggest that our system effectively
reduces the total penalty by allocating the right amount of resources to heterogeneous jobs in a private cloud system.
en
dc.description.provenanceMade available in DSpace on 2021-06-15T16:50:14Z (GMT). No. of bitstreams: 1
ntu-104-R02922100-1.pdf: 631598 bytes, checksum: bda7de09b826c47ab9ae17e84885a43a (MD5)
Previous issue date: 2015
en
dc.description.tableofcontents口試委員會審定書 i
致謝 ii
中文摘要 iii
Abstract iv
Contents v
List of Figures vii
1 Introduction 1
2 Related Work 4
3 Models 6
3.1 Batch Job . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3.2 Interactive Job . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
4 Architecture 9
4.1 Supervisor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
4.2 Decision Maker . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
4.3 Manager . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
4.4 Worker . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
4.5 Client . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
5 Resource Provisioning 12
5.1 Problem Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
5.2 Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
5.2.1 Estimating the Cost of Interactive Jobs . . . . . . . . . . . . . . 13
5.2.2 Estimating the Penalty of Batch Jobs . . . . . . . . . . . . . . . . 16
5.2.3 Determine m i and m b . . . . . . . . . . . . . . . . . . . . . . . 19
6 Experiment 21
6.1 Hardware Settings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
6.2 Workload Traces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
6.3 Experiment Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
6.3.1 Penalty Estimation of Batch Jobs . . . . . . . . . . . . . . . . . 22
6.3.2 SLA Violation Penalty of Batch Jobs . . . . . . . . . . . . . . . 24
6.3.3 SLA Violation Penalty of Batch Jobs Compared to LibraSLA . . 25
6.3.4 SLA Violation Penalty of Mixed Jobs . . . . . . . . . . . . . . . 26
7 Conclusion 32
Bibliography 33
dc.language.isoen
dc.subject排程演算法zh_TW
dc.subject雲端運算系統zh_TW
dc.subject平行處理zh_TW
dc.subjectScheduling algorithmsen
dc.subjectClient-sever systemsen
dc.subjectParallel process- ingen
dc.subjectMultiprocessing systemsen
dc.subjectDynamic schedulingen
dc.title資料中心內批次與交互式工作之資源分配zh_TW
dc.titleResource Provision for Batch and Interactive Workloads in Data Centersen
dc.typeThesis
dc.date.schoolyear103-2
dc.description.degree碩士
dc.contributor.oralexamcommittee吳真貞(Jan-Jan Wu),施吉昇(Chi-Sheng Shih)
dc.subject.keyword排程演算法,雲端運算系統,平行處理,zh_TW
dc.subject.keywordScheduling algorithms,Client-sever systems,Parallel process- ing,Multiprocessing systems,Dynamic scheduling,en
dc.relation.page35
dc.rights.note有償授權
dc.date.accepted2015-08-07
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept資訊工程學研究所zh_TW
顯示於系所單位:資訊工程學系

文件中的檔案:
檔案 大小格式 
ntu-104-1.pdf
  未授權公開取用
616.79 kBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved