帳號:guest(18.223.203.191)          離開系統
字體大小: 字級放大   字級縮小   預設字形  

詳目顯示

以作者查詢圖書館館藏以作者查詢臺灣博碩士論文系統以作者查詢全國書目
作者(中文):楊舜宇
論文名稱(中文):雲端儲存中工作排程問題的演算法
論文名稱(外文):Algorithms for Task Scheduling Problem in Cloud Storage
指導教授(中文):許健平
口試委員(中文):許健平
高榮駿
周志遠
學位類別:碩士
校院名稱:國立清華大學
系所名稱:資訊工程學系
學號:100062582
出版年(民國):102
畢業學年度:102
語文別:英文
論文頁數:32
中文關鍵詞:雲端運算資料中心網路資料存儲資源分配
相關次數:
  • 推薦推薦:0
  • 點閱點閱:270
  • 評分評分:*****
  • 下載下載:10
  • 收藏收藏:0
近年來雲端運算在學界與業界都是一個熱門的議題,越來越多的雲端資料服務提供可信賴的與靈活的資料儲存服務給使用者。如何提供服務達到使用者的服務層級協議(service level agreement ; SLA),對於服務提供者與使用者是很重要的議題。服務提供者必須排程每一個使用者的任務,並且決定這些任務應該被哪個伺服器服務,使得服務提供者可以服務更多的使用者。因為這個任務排程問題在雲端儲存中是一個NP-hard的問題,我們提出啟發式演算法解決這個問題,與最佳解相比,我們的方法有不錯的效能,並且我們的演算法在頻寬分配率跟隨機的方法比好了平均百分之十,在請求服務率跟隨機的方法比好了平均百分之十五。
Abstract ii
List of Contents iii
List of Figures iv
List of Tables v
Chapter 1 Introduction 1
Chapter 2 Related Work 4
2.1 Cloud Storage Architecture 4
2.2 Content Delivery Network 6
2.3 Task Scheduling Problem 7
Chapter 3 Task Scheduling Algorithm 9
3.1 System Model and Architecture 9
3.2 Algorithms for Task Scheduling Problem 12
3.2.1 Algorithm for MKAR 13
3.2.2 Algorithms for UFP 15
Chapter 4 Simulation Results 19
4.1 Simulation Results for MKAR 19
4.2 Simulation Results for UFP 23
Chapter 5 Conclusion 29
References 30
[1] M. Al-Fares, A. Loukissas, and A. Vahdat, “A scalable, commodity data center network architecture,” in Proceedings of the ACM SIGCOMM 2008 Conference on Data communication, Seattle, WA, USA, August 17–22, 2008.
[2] H. Amur, J. Cipar, V. Gupta, G. R. Ganger, M. A. Kozuch, and K. Schwan, “Robust and flexible power-proportional storage,” in Proceedings of the 1st ACM Symposium on Cloud Computing, Indianapolis, Indiana, USA, June 10–11, 2010.
[3] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rankin, I. Stoica, and M. Zaharoa, “A view of cloud computing,” Communications of the ACM, vol. 53, no. 4, pp. 50–58, April 2010.
[4] J. Broberg, R. Buyya, and Z. Tari, “MetaCDN: Harnessing 'storage clouds' for high performance content delivery”, Journal of Network and Computer Applications, vol. 32 no. 5, pp. 1012–1022, September 2009.
[5] N. Cao, S. Yu, Zhenyu Yang, W. Lou, and Y.T. Hou, “Lt codes-based secure and reliable cloud storage service,” in Proceedings of the 31st IEEE INFOCOM 2012, Orlando, Florida, USA, pp. 693–701, March 2012.
[6] F. Chen, K. Guo, J. Lin, and T. F. La Porta, “Intra-cloud lightning: building CDNs in the cloud,” in Proceedings of the 31st IEEE INFOCOM 2012, Orlando, Florida, USA, pp. 433–441, March 2012.
[7] M. W. Dawande, J. R. Kalagnanam, P. Keskinocak, F. S. Salman, and R. Ravi, “Approximation algorithms for the multiple knapsack problem with assignment restrictions,” Journal of Combinatorial Optimization, vol. 4, pp. 171–186, June 2000.
[8] J. Deng, J.L. Hu, A.C.M. Liu, and J. Wu, “Research and application of cloud storage,” in Proceeding of the 2nd International Workshop on Intelligent Systems and Applications (ISA), pp. 1–5, May 2010
[9] A. Dimakis, P. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran. “Network coding for distributed storage systems,” IEEE Transcations on Information Theory, vol. 56, no. 9, pp. 4539–4551, September 2010.
[10] A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta, “VL2: a scalable and flexible data center network,” in Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, Barcelona, Spain, August 16–21, 2009.
[11] Q. He, Z. Li, and X. Zhang, “Analysis of the key technology on cloud storage,” in Proceedings of the International Conference on Future Information Technology and Management Engineering (FITME), Changzhou, China, pp. 426–429, October 2010.
[12] C. Hopps, “Analysis of an equal-cost multi-path algorithm,” RFC 2992, Internet Engineering Task Force, 2000.
[13] J. Kim and D. Rotem, “FREP: energy proportionality for disk storage using replication,“ Journal of Parallel and Distributed Computing vol. 72, issue 8, pp. 960–974, August 2012.
[14] J. M. Kleinberg, “Single-source unsplittable flow,” in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Washington, DC, USA, pp. 68–77, 1996.
[15] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, “OpenFlow: enabling innovation in campus networks,” ACM SIGCOMM Computer Communication Review, vol. 38, no. 2, April 2008.
[16] E. Otoo, D. Rotem, and S.-c. Tsao, "Dynamic data reorganization for energy savings in disk storage systems," in Proceedings of the 22nd International Conference on Scientific and Statistical Database Management, Heidelberg, Germany, pp. 322–341, 2010.
[17] Y. Xiao, Y. Li, J. Wang, and H. Gao, “An energy-efficient data placement algorithm and node scheduling strategies in cloud computing systems,” in 2nd International Conference on Advances in Computer Science and Engineering, Los Angeles, CA, USA, 2013.
[18] Amazon simple storage service (Amazon S3): http://aws.amazon.com/s3/.
[19] Cisco Data Center Infrastructure 2.5 Design Guide. : http://www.cisco.com/application/pdf/en/us/guest/netsol/ns107/c649/ccmigration_09186a008073377d.pdf.
[20] Dropbox. http://www.dropbox.com/.
[21] GNU Linear Programming Kit. http://www.gnu.org/software/glpk/
[22] OMNeT++ http://www.omnetpp.org/
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
* *