Maotai 2.0: Data Race Prevention in View-Oriented Parallel Programming

Leung, Kai-Cheung; Huang, Zhiyi; Huang, Q.; Werstein, P.

doi:10.1109/pdcat.2009.12

Cited by 3 publications

(7 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we compare the performance of Maotai 3.0 with Maotai 2.0 [5] and the software transactional memory system TL-2 version 0.9.6 [3]. Our benchmark applications include Mergesort, Raytrace, Barnes-Hut, Parallel Neural Network (PNN), Binary-tree (BT), Linked-List (LL) and Travelling Salesman Problem (TSP), representing different classes of applications.…”

Section: Performance Evaluation and Discussionmentioning

confidence: 99%

“…Compared with Maotai 2.0 [5], the programmers do not need to keep track of view IDs and the acquire/release statements.…”

Section: A Automatic Detection Of View Accessmentioning

confidence: 99%

“…Data race, which happens when multiple processes/threads access the same object concurrently and at least one of them writes to the variable, is a chronic problem in parallel programming. The View-Oriented Parallel Programming (VOPP) model is designed to eliminate data race [4,5].…”

Section: Introductionmentioning

confidence: 99%

“…However, in Maotai 2.0 [5], which is a VOPP implementation for multicore machines, views must be explicitly acquired before access and released after access. It is often troublesome to manage view acquire/release constructs.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Maotai 3.0: Automatic Detection of View Access in VOPP

Leung

Huang

2010

2010 International Conference on Parallel and Distributed Computing, Applications and Technologies

Self Cite

View full text Add to dashboard Cite

This paper proposes a scheme for automatic detection of view access in the View-Oriented Parallel Programming (VOPP) model. VOPP is a shared-memory-based, data-centric model that uses "views" to bundle mutual exclusion with data access. Based on the automatic detection scheme, a view is automatically acquired when first accessed, and automatically released at proper time. This scheme simplifies the VOPP model and prevents programming errors. With this scheme, the programmability of VOPP is similar to transactional memory models. In addition, VOPP can eliminate data races without compromising performance. A new VOPP implementation, Maotai 3.0, has been developed and incorporated the above features. Experimental results demonstrate that the performance of Maotai 3.0 surpasses transactional memory models such as TL-2.

show abstract

Section: Performance Evaluation and Discussionmentioning

confidence: 99%

“…Compared with Maotai 2.0 [5], the programmers do not need to keep track of view IDs and the acquire/release statements.…”

Section: A Automatic Detection Of View Accessmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Maotai 3.0: Automatic Detection of View Access in VOPP

Leung

Huang

2010

2010 International Conference on Parallel and Distributed Computing, Applications and Technologies

Self Cite

View full text Add to dashboard Cite

show abstract

“…The use of multiple threads has several advantages: (a) concealing the delay of commands like reading from a secondary storage, (b) improving the action of programs, like web servers, that run on multiprocessors, (c) building complex systems for user interface, (d) simplifying the process of organizing huge systems of code. However, the static analysis of multithreaded programs [1][2][3] is intricate due to the possible interaction between multiple threads.…”

Section: Introductionmentioning

confidence: 99%

Untitled

El-Zawawy¹

2011

ScienceAsia

View full text Add to dashboard Cite

The use of pointers and data-structures based on pointers results in circular memory references that are interpreted by a vital compiler analysis, namely pointer analysis. For a pair of memory references at a program point, a typical pointer analysis specifies if the points-to relation between them may exist, definitely does not exist, or definitely exists. The "may be" case, which describes the points-to relation for most of the pairs, cannot be dealt with by most compiler optimizations. This is so to guarantee the soundness of these optimizations. However, the "may be" case can be capitalized by the modern class of speculative optimizations if the probability that two memory references alias can be measured. Focusing on multithreading, a prevailing technique of programming, this paper presents a new flow-sensitive technique for probabilistic pointer analysis of multithreaded programs. The proposed technique has the form of a type system and calculates the probability of every points-to relation at each program point. The key to our approach is to calculate the points-to information via a post-type derivation. The use of type systems has the advantage of associating each analysis results with a justification (proof) for the correctness of the results. This justification has the form of a type derivation and is very much required in applications like certified code.

show abstract

Dead code elimination based pointer analysis for multithreaded programs

El-Zawawy

2012

Journal of the Egyptian Mathematical Society

View full text Add to dashboard Cite

This paper presents a new approach for optimizing multitheaded programs with pointer constructs. The approach has applications in the area of certified code (proof-carrying code) where a justification or a proof for the correctness of each optimization is required. The optimization meant here is that of dead code elimination.Towards optimizing multithreaded programs the paper presents a new operational semantics for parallel constructs like join-fork constructs, parallel loops, and conditionally spawned threads. The paper also presents a novel type system for flow-sensitive pointer analysis of multithreaded programs. This type system is extended to obtain a new type system for live-variables analysis of multithreaded programs. The live-variables type system is extended to build the third novel type system, proposed in this paper, which carries the optimization of dead code elimination. The justification mentioned above takes the form of type derivation in our approach.

show abstract

Maotai 2.0: Data Race Prevention in View-Oriented Parallel Programming

Cited by 3 publications

References 28 publications

Maotai 3.0: Automatic Detection of View Access in VOPP

Maotai 3.0: Automatic Detection of View Access in VOPP

Untitled

Dead code elimination based pointer analysis for multithreaded programs

Contact Info

Product

Resources

About