請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/55337
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 周承復(Cheng-Fu Chou) | |
dc.contributor.author | Song-Lin Yang | en |
dc.contributor.author | 楊松霖 | zh_TW |
dc.date.accessioned | 2021-06-16T03:57:17Z | - |
dc.date.available | 2020-02-04 | |
dc.date.copyright | 2015-02-04 | |
dc.date.issued | 2014 | |
dc.date.submitted | 2014-12-04 | |
dc.identifier.citation | 1. Facebook Reports Fourth Quarter and Full Year 2013 Results. Available from: http://investor.fb.com/releasedetail.cfm?ReleaseID=821954.
2. 2013 Annual Report of Sina. Available from: http://corp.sina.com.cn/eng/2013_Annual_Report.pdf. 3. Apache cassandra. 4. Mongodb. Available from: http://www.mongodb.org/. 5. METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering. Available from: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview. 6. George, K. and K. Vipin, Multilevel algorithms for multi-constraint graph partitioning, in Proceedings of the 1998 ACM/IEEE conference on Supercomputing. 1998, IEEE Computer Society: San Jose, CA. p. 1-13. 7. Berenice, C., L. Yi, and M.F.d.T. Joana, Partitioning social networks for time-dependent queries, in Proceedings of the 4th Workshop on Social Network Systems %@ 978-1-4503-0728-4. 2011, ACM: Salzburg, Austria. p. 1-6. 8. Josep, M.P., et al., The little engine(s) that could: scaling online social networks, in Proceedings of the ACM SIGCOMM 2010 conference . 2010, ACM: New Delhi, India. p. 375-386. 9. Jayanta, M. and D. Amol, Managing large dynamic graphs efficiently, in Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data. 2012, ACM: Scottsdale, Arizona, USA. p. 145-156. 10. Shengqi, Y., et al., Towards effective partition management for large graphs, in Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data. 2012: Scottsdale, Arizona, USA. p. 517-528. 11. Jiao, L., et al. Multi-Objective Data Placement for Multi-Cloud Socially Aware Services. in IEEE INFOCOM. 2014. 12. Hurst, H.E., {Long-term storage capacity of reservoirs}. Trans. Amer. Soc. Civil Eng., 1951. 116: p. 770-808. 13. Crovella, M.E. and A. Bestavros, Self-similarity in World Wide Web traffic: evidence and possible causes. Networking, IEEE/ACM Transactions on, 1997. 5(6): p. 835-846. 14. Willinger, W., et al., Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level. Networking, IEEE/ACM Transactions on, 1997. 5(1): p. 71-86. 15. Barroso, L.A. and U. Holzle, The case for energy-proportional computing. IEEE computer, 2007. 40(12): p. 33-37. 16. Irena Koprinska, S.C., Temporal video segmentation: A survey. Signal Processing: Image Communication, 2000: p. 477-500. 17. Mohammad, A.-F., L. Alexander, and V. Amin, A scalable, commodity data center network architecture, in Proceedings of the ACM SIGCOMM 2008 conference on Data communication. 2008, ACM: Seattle, WA, USA. p. 63-74. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/55337 | - |
dc.description.abstract | 近年來社群網路服務的快速興起,大部分民眾已經習慣於使用這些社群網路服務來與親朋好友互動,社群網路服務提供者也相對應的使用越來越多的機器以及資源來保證能滿足大量使用者服務需求,但這些社群服務的使用量並不會永遠處在高檔,其實在大部份的時間中整個提供社群網路服務的系統所需要的資源只有全部資源中的一部份而已,這相對而言持續占用全部的資源也造成了資源上的浪費以及金錢上的損失,因此我們可以去在適當的時機去減少一些資源的消耗,已達到更高的能源運用效率。
在本篇論文中,我們從新浪微博的資料當中發現並驗證了這個系統服務負載的變化趨勢以及關係,我們因而去提出了一套考慮系統負載變化量去決定留用多少數量的機器來提供服務,以及考慮時間而造成使用者使用狀態變化的資料放置方法,同時在資源使用量較少的情況下,我們也應該去保證整個系統也能提供一定的服務品質,讓使用者不會受太大的影響,而我們也受惠於能在適當時機去減少資源使用量的原因,我們因而能達到更好的能源使用效率。 | zh_TW |
dc.description.abstract | In recent years, the social aware services become more and more prevalent. Lots of people interact with their friends and family through the social aware service. As a consequence, providers of the social aware services apply a lot of resources to serve their users. However, the workload of the social aware services is not always at the peak. In fact, the services only take part of the resources to work well at lots of the time. And this phenomenon will cause the waste of the resources. Hence, we can reduce the usage amount of the resources to be more energy efficient.
In this paper, we observe the trend and change of the workload of the data of a social aware service, Sina Weibo. We then propose a method to decide the number of machines we will use with regard to the workload change of the system, and we partition the social graph with the considering of different usage patterns of users in different time. At the same time, we need to ensure a level of QoS of the system, while we use fewer resources. And we can also be more energy efficient because we consume fewer resource | en |
dc.description.provenance | Made available in DSpace on 2021-06-16T03:57:17Z (GMT). No. of bitstreams: 1 ntu-103-R01922041-1.pdf: 1469632 bytes, checksum: 8ad8902b08d7571079c46be803caad04 (MD5) Previous issue date: 2014 | en |
dc.description.tableofcontents | 致謝 i
摘要 ii Abstract iii Chapter 1 Introduction 1 Chapter 2 Related Work 4 Chapter 3 Motivation 7 Chapter 4 Trace Analysis 8 4-1 Dataset: 8 4-2 Observations: 9 4-3 Hurst Exponent: 10 4-4 The Period of Repeat Pattern 14 Chapter 5 Problem Statement 16 5-1 Our idea 16 5-2 Problem Formulation 19 5-3 Complexity of the problem 21 Chapter 6 Time-variants Considering Method 23 Step 1. Split the Historical Data with Regard to Time Segments 24 Step 2: Calculate the Minimum Number of Machines needed for Each Time Segment 24 Step 3: Divide the Time Segments into Groups 26 Step 4: Number of Partitions 27 Step 5: Graph Partition 29 Step 6: Check Validity 32 Chapter 7 Evaluation Results 35 7-1 Experiment Setup 35 7-2 Algorithm for Comparison 36 7-3 Number of Machines 37 7-3 Result of the Partition 38 7-4 Response Time 40 7-4 Energy Consumption 41 7-4 Compare with Full Mirror Scheme 42 Chapter 8 Conclusion and Future Work 44 Bibliography 46 | |
dc.language.iso | en | |
dc.title | 考量依時間變化負載於資料中心內社群服務節能資料放置方法 | zh_TW |
dc.title | Energy-efficient Data Placement with Time-variant Workloads Consideration for Social-aware Service in Data Centers | en |
dc.type | Thesis | |
dc.date.schoolyear | 103-1 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 洪士灝(Shih-Hao Hung),蕭旭君(Hsu-Chun Hsiao),蔡子傑(Tzu-Chieh Tsai),陳伶志(Ling-Jyh Chen) | |
dc.subject.keyword | 能源使用效率,負載變化,社群網路服務,圖資料庫,資料中心, | zh_TW |
dc.subject.keyword | energy efficient,time variant,social aware service,datacenter, | en |
dc.relation.page | 48 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2014-12-04 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-103-1.pdf 目前未授權公開取用 | 1.44 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。