dissertation · VTechWorks (Virginia Tech) · 2013
Safe Concurrent Programming and Execution
Cited by 1Abstract and details only
Abstract
The increasing prevalence of multi and many core processors has brought the issues of concurrency and parallelism to the forefront of everyday computing. Even for applications amenable to traditional parallelization techniques, the subtleties of concurrent programming are known to introduce concurrency bugs. Due to the potential of concurrency bugs, programmers find it hard to write correct concurrent code. To take full advantage of parallel shared memory platforms, application programmers need safe and efficient mechanisms that can support a wide range of parallel applications. In addition, a large body of applications are inherently hard-to-parallelize; their data and control dependencies impose execution order constraints that preclude the use of traditional parallelization techniques. Sensitive to their input data, a substantial number of applications fail to scale well, leaving cores idle. To improve the performance of such applications, application programmers need effective mechanisms that can fully leverage multi and many core architectures. These challenges stand in the way of realizing the true potential of emerging many core platforms. The techniques described in this dissertation address these challenges. Specifically, this dissertation contributes techniques to transparently detect and eliminate several concurrency bugs, including deadlocks, asymmetric write-write data races, priority inversion, live-locks, order violations, and bugs that stem from the presence of asynchronous signaling and locks. A second major contribution of this dissertation is a programming framework that exploits coarse-grain speculative parallelism to improve the performance of otherwise hard-to-parallelize applications.
Cite this paper
Pyla, H. K. (2013). Safe Concurrent Programming and Execution. VTechWorks (Virginia Tech).
Pyla, Hari K. “Safe Concurrent Programming and Execution.” VTechWorks (Virginia Tech), 2013.
Pyla, Hari K. 2013. “Safe Concurrent Programming and Execution.” VTechWorks (Virginia Tech).
Pyla, H.K. (2013) ‘Safe Concurrent Programming and Execution’, VTechWorks (Virginia Tech).
@phdthesis{pyla2013safe,
title = {{Safe Concurrent Programming and Execution}},
author = {Pyla, Hari K.},
school = {VTechWorks (Virginia Tech)},
year = {2013}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
4 Concurrent programming
J. Ahrens, K. Debattista, R. Pajarola (editors et al. · Lecture notes in computer science · 1987
Cited by 4
Concurrent Programming
Gary J. Stolz · Purdue University Press eBooks · 2013
Cited by 251Open access
On Concurrent Programming
Reinhard Möller · 1998
Cited by 0
Concurrent programming in an upper level operating systems course
J. L. Silver · ACM Technical Symposium on Computer Science Education (SIGCSE) · 1989
Cited by 3Open access
A system for teaching concurrent programming
C. William Higginbotham, Ralph A. Morelli · ACM Technical Symposium on Computer Science Education (SIGCSE) · 1991
Cited by 22Open access
Concurrent approach to systems engineering and analysis
Thomas Burns, Edward Szczerbicki · Systems Analysis Modelling Simulation · 1999
Cited by 0
Lecture Notes on Programming Concurrent Computer Systems
Zhiming Liu · 2005
Cited by 0
SIR: inter-program concurrency support for SR programs
Eugene F. Fodor, Ronald A. Olsson · Computer Languages · 2002
Cited by 0