東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Detecting and mitigating concurrency...

Huang, Ruirui.

FindBook

Google Book

Amazon

博客來

Detecting and mitigating concurrency bugs.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Detecting and mitigating concurrency bugs./
作者:	Huang, Ruirui.
面頁冊數:	181 p.
附註:	Source: Dissertation Abstracts International, Volume: 74-11(E), Section: B.
Contained By:	Dissertation Abstracts International74-11B(E).
標題:	Engineering, Computer. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3571253
ISBN:	9781303222092

Detecting and mitigating concurrency bugs.
Huang, Ruirui.

Detecting and mitigating concurrency bugs. - 181 p.

Source: Dissertation Abstracts International, Volume: 74-11(E), Section: B.

Thesis (Ph.D.)--Cornell University, 2013.

As computing hardware moves to multi-core systems, future software needs to be parallelized in order to benefit from increasing computing resources. However, writing a correct parallel program is notoriously difficult, partly because of non-determinism in concurrent program executions. Because thread executions can be interleaved in many ways, a parallel program may produce a non-deterministic outcome even for identical program inputs if threads are not properly synchronized. Such a non-deterministic behavior, if not intentional, is often referred to as a concurrency bug. In this research, a solution is presented for efficient concurrency bug detection and mitigation.

ISBN: 9781303222092Subjects--Topical Terms:

1669061
Engineering, Computer.

Detecting and mitigating concurrency bugs.
LDR:04076nam a2200301 4500 001 1964247
005 20141015113819.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303222092
035 $a (MiAaPQ)AAI3571253
035 $a AAI3571253
040 $a MiAaPQ $c MiAaPQ
100 1 $a Huang, Ruirui. $3 2100660
245 1 0 $a Detecting and mitigating concurrency bugs.
300 $a 181 p.
500 $a Source: Dissertation Abstracts International, Volume: 74-11(E), Section: B.
500 $a Adviser: G. Edward Suh.
502 $a Thesis (Ph.D.)--Cornell University, 2013.
520 $a As computing hardware moves to multi-core systems, future software needs to be parallelized in order to benefit from increasing computing resources. However, writing a correct parallel program is notoriously difficult, partly because of non-determinism in concurrent program executions. Because thread executions can be interleaved in many ways, a parallel program may produce a non-deterministic outcome even for identical program inputs if threads are not properly synchronized. Such a non-deterministic behavior, if not intentional, is often referred to as a concurrency bug. In this research, a solution is presented for efficient concurrency bug detection and mitigation.
520 $a As data races are widely used as a way to identify potential concurrency bugs, this research presents an efficient hardware architecture, named RaceSMM, that enables run-time data race detection with high coverage (99%) and minimal performance overhead (4.8% on average). The proposed hardware mechanism is based on the happens-before vector clock algorithm, which is known for its accuracy yet considered to be expensive due to a large amount of meta-data. As the main optimization, the proposed architecture in this research decouples meta-data storage from regular caches so that expensive meta-data is only selectively stored for memory locations that are accessed by multiple threads within a relatively short period where most data races happen.
520 $a While data races can detect a broad range of concurrency bugs where conflicting memory accesses are not controlled at all, recent studies show that many concurrency bugs are not detectable by data races. Hence, this research introduces a new heuristic for non-race concurrency bug detection, named order-sensitive critical sections, which extends the intuition in data races to capture non-race bugs in practice. The order-sensitive critical sections are defined as a pair of critical sections that can lead to non-deterministic shared memory state depending on the order in which they execute. This research presents a run-time algorithm, named OSCS, that uses the notion of order-sensitive critical sections to detect real-world concurrency bugs. Experiments show OSCS provides a good bug coverage (90%) for both non-race atomicity and ordering violations, with a small number of false positives. Additionally, OSCS can be supported in hardware efficiently while maintaining a high detection coverage (84%) and causing a negligible performance overhead.
520 $a Finally, to provide a solution to further mitigate concurrency bugs post detection, an efficient deterministic replay scheme for multithreaded programs is introduced based on a concept of commutative critical sections. The commutative critical sections are critical sections in a multithreaded program that can be executed in any order while producing a consistent program output. In this research, we propose a deterministic replay scheme, named CommuteReplay, which allows the commutative critical sections to execute without enforcing an explicit deterministic order between the commutative critical sections to allow a noticeably better replay performance (reducing more than 20% of the overall performance overhead on average).
590 $a School code: 0058.
650 4 $a Engineering, Computer. $3 1669061
690 $a 0464
710 2 $a Cornell University. $b Electrical and Computer Engineering. $3 2100661
773 0 $t Dissertation Abstracts International $g 74-11B(E).
790 $a 0058
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3571253