本文選題：協(xié)同內(nèi)核 + 數(shù)據(jù)一致性　； 參考：《南京大學(xué)》2013年碩士論文

【摘要】：計(jì)算與通信技術(shù)的高速發(fā)展加速了互聯(lián)網(wǎng)應(yīng)用在人們?nèi)粘Ｉ钪械钠占?而在數(shù)據(jù)中心內(nèi)構(gòu)建高效可靠的數(shù)據(jù)中心應(yīng)用系統(tǒng)是支持高質(zhì)量互聯(lián)網(wǎng)應(yīng)用的重要保障。數(shù)據(jù)中心中主要包括三類軟件實(shí)體：數(shù)據(jù)中心應(yīng)用、協(xié)同服務(wù)、協(xié)同內(nèi)核。多個(gè)數(shù)據(jù)中心應(yīng)用共同為用戶提供服務(wù),它們之間必須進(jìn)行有效的合作。協(xié)同服務(wù)為數(shù)據(jù)中心應(yīng)用的協(xié)調(diào)與合作提供了有效支持。協(xié)同服務(wù)可以有很多種形式,而協(xié)同內(nèi)核的主要目標(biāo)是用來(lái)支撐這些不同形式的協(xié)同服務(wù)的構(gòu)建。協(xié)同內(nèi)核作為一個(gè)通用模塊,提供了一組用于構(gòu)建協(xié)同服務(wù)的接口。基于協(xié)同內(nèi)核,我們可以高效地構(gòu)建各種不同的協(xié)同服務(wù)。協(xié)同內(nèi)核是構(gòu)建數(shù)據(jù)中心應(yīng)用的一個(gè)關(guān)鍵元素,我們希望設(shè)計(jì)出一個(gè)同時(shí)滿足數(shù)據(jù)一致性,系統(tǒng)可用性,以及容忍網(wǎng)絡(luò)分隔的協(xié)同內(nèi)核。但是理論分析表明上述三個(gè)性質(zhì)不能同時(shí)滿足。對(duì)于協(xié)同內(nèi)核而言,為了確保協(xié)同的正確完成,數(shù)據(jù)的一致性必須被滿足。而同時(shí)網(wǎng)絡(luò)的分隔難以避免,系統(tǒng)必須對(duì)網(wǎng)絡(luò)分隔具有充分的容忍度。因此對(duì)協(xié)同內(nèi)核而言,在必要的時(shí)候犧牲系統(tǒng)的可用性是一個(gè)必然的選擇。這樣,構(gòu)建協(xié)同內(nèi)核的主要挑戰(zhàn)在于如何在同時(shí)滿足數(shù)據(jù)一致性和網(wǎng)絡(luò)分隔容忍性的前提下,盡量保證協(xié)同內(nèi)核的可用性。針對(duì)上述問(wèn)題,本文著重研究協(xié)同內(nèi)核構(gòu)建技術(shù)。具體而言,本文的主要貢獻(xiàn)包括：首先,本文給出協(xié)同內(nèi)核KVSmith的設(shè)計(jì)與優(yōu)化。KVSmith的外在表現(xiàn)形式是一個(gè)鍵值存儲(chǔ)服務(wù),它的主要原理是基于多臺(tái)機(jī)器之間的容錯(cuò)協(xié)商,保證存儲(chǔ)數(shù)據(jù)的一致性和整個(gè)系統(tǒng)的網(wǎng)絡(luò)分隔容忍性,由此完成協(xié)同內(nèi)核的功能。在上述設(shè)計(jì)的基礎(chǔ)上,KVSmith采用三個(gè)優(yōu)化技術(shù)提升系統(tǒng)的性能：并行協(xié)商優(yōu)化、選主優(yōu)化和本地讀優(yōu)化。這些優(yōu)化技術(shù)是提升KVSmith性能的關(guān)鍵。其次,協(xié)同內(nèi)核的主要目標(biāo)是支撐高效構(gòu)建不同的協(xié)同服務(wù)。本文選擇了兩個(gè)典型的協(xié)同服務(wù)-鎖服務(wù)和選主服務(wù)-作為應(yīng)用案例,討論了如何基于KVSmith協(xié)同內(nèi)核來(lái)構(gòu)建具體的協(xié)同服務(wù)�；贙VSmith提供的鍵值數(shù)據(jù)模型的接口,本文給出了鎖服務(wù)和選主服務(wù)的具體實(shí)現(xiàn)。最后,本文實(shí)現(xiàn)了KVSmith原型系統(tǒng),并且對(duì)KVSmith的性能進(jìn)行了全面的實(shí)驗(yàn)評(píng)估。實(shí)驗(yàn)驗(yàn)證的結(jié)果表明,在不同類型不同數(shù)量的系統(tǒng)負(fù)載下,KVSmith均具有較好的性能,并能較快地從節(jié)點(diǎn)失效中恢復(fù)。
[Abstract]:The rapid development of computing and communication technology accelerates the popularization of Internet application in people's daily life, and the construction of efficient and reliable data center application system in data center is an important guarantee to support high-quality Internet application. The data center mainly includes three kinds of software entities: data center application, cooperative service and cooperative kernel. Multiple data center applications provide services to users together, and they must cooperate effectively. Collaborative services provide effective support for the coordination and cooperation of data center applications. There can be many forms of collaborative services, and the main goal of the cooperative kernel is to support the construction of these different forms of collaborative services. As a common module, the cooperative kernel provides a set of interfaces for building collaborative services. Based on the cooperative kernel, we can build various cooperative services efficiently. The cooperative kernel is a key element in building data center applications. We hope to design a cooperative kernel that can satisfy data consistency, system availability, and tolerate network separation at the same time. But the theoretical analysis shows that the above three properties can not be satisfied at the same time. For the cooperative kernel, in order to ensure the correct completion of the collaboration, the consistency of the data must be satisfied. At the same time, the separation of network is inevitable, the system must have sufficient tolerance to network separation. Therefore, it is an inevitable choice for cooperative kernel to sacrifice the availability of the system when necessary. In this way, the main challenge of constructing cooperative kernel is how to ensure the availability of cooperative kernel while satisfying both data consistency and network separation tolerance. In view of the above problems, this paper focuses on the cooperative kernel construction technology. In particular, the main contributions of this paper are as follows: first, this paper presents the design and optimization of the collaborative kernel KVSmith. The external representation of .KV Smith is a key-value storage service, whose main principle is based on fault-tolerant negotiation between multiple machines. To ensure the consistency of storage data and the network separation tolerance of the whole system, the function of cooperative kernel is completed. Based on the above design, KV Smith uses three optimization techniques to improve the performance of the system: parallel negotiation optimization, selection master optimization and local read optimization. These optimization techniques are the key to improve KVSmith performance. Secondly, the main goal of cooperative kernel is to support efficient construction of different cooperative services. In this paper, two typical collaborative services, lock service and master service, are selected as application cases, and how to construct concrete cooperative service based on KVSmith cooperative kernel is discussed. Based on the interface of key data model provided by KVSmith, this paper presents the implementation of locking service and selecting master service. Finally, the KVSmith prototype system is implemented and the performance of KVSmith is evaluated. The experimental results show that KV Smith has better performance under different types of system loads and can recover from node failure quickly.
【學(xué)位授予單位】：南京大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP308

【相似文獻(xiàn)】

相關(guān)碩士學(xué)位論文 前1條

1 陸掾;協(xié)同內(nèi)核KVSmith的設(shè)計(jì)與實(shí)現(xiàn)[D];南京大學(xué);2013年

，

本文編號(hào)：1875398