Open AccessDissertation
View-Oriented Parallel Programming and its Performance Evaluation on Multicore Architectures
Kai-Cheung Leung
- 01 Jan 2013
TL;DR: Wang et al. as discussed by the authors proposed a data race prevention scheme in the View-Oriented Parallel Programming (VOPP) paradigm, which can prevent data race through the memory protection mechanism while keeping the extra overhead low.
read more
Abstract: Shared-memory multicore architectures have become pervasive, and there is a pressing need for parallel programming models to facilitate both performance and convenience. However, most existing shared-memory programming models are tedious for programming and are prone to errors such as data race, which are difficult to debug. To solve this problem, this thesis proposes a data race prevention scheme in the View-Oriented Parallel Programming (VOPP) paradigm. VOPP was proposed for distributed shared memory systems. It is adapted to shared-memory multicore architectures in this thesis. VOPP is a sharedmemory data-centric parallel programming model, which uses views to bundle mutual exclusion with data access. In VOPP, programmers partition the shared memory into “views”, which are non-overlapping sets of shared data objects. The data race prevention scheme proposed for VOPP can prevent data race through the memory protection mechanism while keeping the extra overhead low. To improve the programmability of VOPP, this thesis proposes an automatic view access management scheme where a view is automatically acquired upon its first access, and automatically released when no longer needed, thus relieving programmers from arranging locks to protect critical sections. To further improve performance and programmability, this thesis proposes the View-Oriented Transactional Memory (VOTM) system, which uses Restricted Admission Control (RAC) to manage the number of processes holding each view according to its contention. In VOTM, RAC can restrict the number of processes holding the view when its contention is high, and in
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
A Lazy Snapshot Algorithm with Eager Validation
TL;DR: This paper formally introduces a lazy snapshot algorithm that verifies at each object access that the view observed by a transaction is consistent and demonstrates that the performance is quite competitive by comparing other STMs with an STM that uses the algorithm.
222
•Proceedings Article
Data race: tame the beast
Kai-Cheung Leung,Zhiyi Huang,Q. Huang,P. Werstein +3 more
- 01 Jan 2010
TL;DR: Wang et al. as mentioned in this paper proposed a data race prevention scheme View-Oriented Data race Prevention (VODAP), which can prevent data races in the view-oriented parallel programming (VOPP) model.
2
References
The SPLASH-2 programs: characterization and methodological considerations
Steven Cameron Woo,Moriyoshi Ohara,Evan Torrie,Jaswinder Pal Singh,Anoop Gupta +4 more
- 01 May 1995
TL;DR: This paper quantitatively characterize the SPLASH-2 programs in terms of fundamental properties and architectural interactions that are important to understand them well, including the computational load balance, communication to computation ratio and traffic needs, important working set sizes, and issues related to spatial locality.
•Book
Using MPI: Portable Parallel Programming with the Message-Passing Interface
William Gropp,Ewing Lusk,Anthony Skjellum +2 more
- 01 Jan 1994
TL;DR: Using MPI as mentioned in this paper provides a thoroughly updated guide to the MPI (Message-Passing Interface) standard library for writing programs for parallel computers, including a comparison of MPI with sockets.
2.9K
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
TL;DR: Many large sequential computers execute operations in a different order than is specified by the program, and a correct execution by each processor does not guarantee the correct execution of the entire program.
Transactional memory: architectural support for lock-free data structures
Maurice Herlihy,J. Eliot B. Moss +1 more
- 01 May 1993
TL;DR: Simulation results show that transactional memory matches or outperforms the best known locking techniques for simple benchmarks, even in the absence of priority inversion, convoying, and deadlock.
•Book
Distributed Systems: Principles and Paradigms
Andrew S. Tanenbaum,Maarten van Steen +1 more
- 01 Jan 2001
TL;DR: Intended for use in a senior/graduate level distributed systems course or by professionals, this text systematically shows how distributed systems are designed and implemented in real systems.
Related Papers (5)
Maurice Herlihy,Nir Shavit +1 more
- 25 Jun 2012
Piyush Mehrotra,John Vanrosendale +1 more
- 01 Oct 1990