發(fā)布時(shí)間：2018-01-18 16:05

  本文關(guān)鍵詞：基于Signature的STM沖突管理的研究　出處：《東北大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 多核 軟件事務(wù)存儲(chǔ) signature 沖突管理

【摘要】：傳統(tǒng)單核處理器中程序只能串行運(yùn)行,這在很大程度上限制了計(jì)算機(jī)的性能,于是人們開(kāi)始將更多的目光放到多核處理器的研究上。在多核處理器中,程序可以更好地并行執(zhí)行,使并行計(jì)算的性能得到進(jìn)一步的改進(jìn)。然而,多核處理器提高處理性能,也給程序設(shè)計(jì)帶來(lái)了問(wèn)題和挑戰(zhàn)。傳統(tǒng)的并行編程模型使用同步變量和鎖來(lái)實(shí)現(xiàn)同步,這會(huì)導(dǎo)致死鎖、優(yōu)先級(jí)倒置等各種問(wèn)題。如何提高并行程序的開(kāi)發(fā)效率,為程序員提供更加高效的編程語(yǔ)言和模型,使得多核的資源得到充分的利用成為近些年關(guān)注的熱點(diǎn)。事務(wù)存儲(chǔ)系統(tǒng)就是在這種情況下應(yīng)運(yùn)而生的,它是一種全新的多核編程模型,把數(shù)據(jù)庫(kù)中事務(wù)的概念引入到程序設(shè)計(jì)中,使得在程序中可以將對(duì)內(nèi)存的一系列訪問(wèn)封裝成一個(gè)原子操作,為并行程序的設(shè)計(jì)提供簡(jiǎn)潔高效的編程環(huán)境。 本文主要針對(duì)軟件事務(wù)存儲(chǔ)(STM, Software Transaction Memory)進(jìn)行研究,設(shè)計(jì)并實(shí)現(xiàn)了Mix Bloom沖突檢測(cè)算法及Synthesized沖突解決策略。在Mix Bloom沖突檢測(cè)算法中,將True Bloom和Hash Bloom相結(jié)合,利用二者的優(yōu)勢(shì),取長(zhǎng)補(bǔ)短,提高了事務(wù)整體的并行性,降低了中止率。在沖突解決策略Synthesized中,引入了混合優(yōu)先級(jí)、隨機(jī)退避等待、標(biāo)記事務(wù)當(dāng)前狀態(tài)等思想,增加了成功提交的事務(wù)數(shù)目,整體上提高了系統(tǒng)的性能。使用RSTM中的基準(zhǔn)測(cè)試程序?qū)ix Bloom沖突檢測(cè)算法及Synthesized沖突解決策略的測(cè)試結(jié)果顯示：對(duì)于不同的測(cè)試程序,Mix Bloom中止率都比Hash Bloom的中止率低；Synthesized沖突解決策略在大多數(shù)情況下都有很好的表現(xiàn),平均每秒提交的事務(wù)個(gè)數(shù)都很高。由此可以得出結(jié)論,Mix Bloom沖突檢測(cè)算法及Synthesized沖突解決策略可以使系統(tǒng)的性能得到整體的提高。 論文首先介紹了研究背景,并給出了論文的結(jié)構(gòu)安排；然后介紹了與研究相關(guān)的工作；接下來(lái)介紹了現(xiàn)有的基于signature的沖突檢測(cè)算法；然后提出了Mix Bloom沖突檢測(cè)算法及Synthesized沖突解決策略,并給出了二者詳細(xì)的算法設(shè)計(jì)及測(cè)試結(jié)果。最后,對(duì)本文工作做了總結(jié),并進(jìn)行了下一步工作展望。
[Abstract]:In traditional single-core processors, programs can only run in serial, which limits the performance of computers to a great extent, so people begin to pay more attention to the research of multi-core processors. Programs can be executed in parallel, and the performance of parallel computing can be further improved. However, multi-core processors can improve processing performance. Traditional parallel programming model uses synchronous variables and locks to achieve synchronization, which will lead to deadlock, priority inversion and other problems. How to improve the efficiency of parallel programming. Providing programmers with more efficient programming languages and models, making the full use of multi-core resources has become a hot topic in recent years. Transaction storage system is born in this situation. It is a new multi-core programming model, which introduces the concept of transaction in database into programming, so that a series of access to memory can be encapsulated into an atomic operation in the program. It provides a concise and efficient programming environment for the design of parallel programs. This paper focuses on the software transaction storage (STM, Software Transaction memory). Design and implement Mix Bloom conflict detection algorithm and Synthesized conflict resolution strategy in Mix Bloom conflict detection algorithm. True Bloom and Hash Bloom are combined to improve the parallelism of the whole transaction. In the conflict resolution strategy Synthesized, the ideas of mixed priority, random Backoff wait, marking the current state of the transaction, and so on are introduced to increase the number of successfully committed transactions. The test results of Mix Bloom collision detection algorithm and Synthesized conflict resolution strategy using the benchmark program in RSTM show that:. For different test programs. The discontinuation rate of Mix Bloom was lower than that of Hash Bloom. The Synthesized conflict resolution strategy performs well in most cases, with a high average number of transactions committed per second. Mix Bloom collision detection algorithm and Synthesized conflict resolution strategy can improve the overall performance of the system. Firstly, the research background is introduced, and the structure of the thesis is given. Then the work related to the research is introduced. Then the existing conflict detection algorithms based on signature are introduced. Then, the Mix Bloom conflict detection algorithm and Synthesized conflict resolution strategy are proposed, and the detailed algorithm design and test results are given. Finally. The work of this paper is summarized and the future work is prospected.
【學(xué)位授予單位】：東北大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP332

【參考文獻(xiàn)】

相關(guān)期刊論文 前6條

1 竇強(qiáng);王勇;;事務(wù)存儲(chǔ)系統(tǒng)中PGHB沖突檢測(cè)算法改進(jìn)[J];電子學(xué)報(bào);2010年01期

2 彭林;謝倫國(guó);張小強(qiáng);;事務(wù)存儲(chǔ)系統(tǒng)[J];計(jì)算機(jī)研究與發(fā)展;2009年08期

3 魏廣博;張平;黃國(guó)睿;;面向多核的基于RSTM系統(tǒng)的沖突管理策略[J];計(jì)算機(jī)工程;2010年10期

4 陳芳園;張冬松;王志英;;異構(gòu)多核處理器體系結(jié)構(gòu)設(shè)計(jì)研究[J];計(jì)算機(jī)工程與科學(xué);2011年12期

5 黃國(guó)睿;張平;魏廣博;馬航;;事務(wù)存儲(chǔ)研究[J];計(jì)算機(jī)工程與設(shè)計(jì);2010年02期

6 王文義;趙建建;王若雨;;關(guān)于并行程序設(shè)計(jì)方法的分析與研究[J];鄭州大學(xué)學(xué)報(bào)(工學(xué)版);2009年02期

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

1 徐禎;面向并行程序設(shè)計(jì)的可視化建模語(yǔ)言體系及支撐系統(tǒng)研究[D];天津大學(xué);2010年

，

本文編號(hào)：1441596