• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 863
Next 10 →

Eraser: a dynamic data race detector for multithreaded programs

by Stefan Savage, Michael Burrows, Greg Nelson, Patrick Sobalvarro, Thomas Anderson - ACM Transaction of Computer System , 1997
"... Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lock-based ..."
Abstract - Cited by 688 (2 self) - Add to MetaCart
Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lock

Ownership Types for Safe Programming: Preventing Data Races and Deadlocks

by Chandrasekhar Boyapati, Robert Lee, Martin Rinard , 2002
"... This paper presents a new static type system for multi-threaded programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers to partition the locks into a fixed number of equivalence classes and specify a partial order among th ..."
Abstract - Cited by 358 (10 self) - Add to MetaCart
This paper presents a new static type system for multi-threaded programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers to partition the locks into a fixed number of equivalence classes and specify a partial order among

Speculative Lock Elision: Enabling Highly Concurrent Multithreaded Execution

by Ravi Rajwar, James R. Goodman , 2001
"... Serialization of threads due to critical sections is a fundamental bottleneck to achieving high performance in multithreaded programs. Dynamically, such serialization may be unnecessary because these critical sections could have safely executed concurrently without locks. Current processors cannot f ..."
Abstract - Cited by 227 (10 self) - Add to MetaCart
Serialization of threads due to critical sections is a fundamental bottleneck to achieving high performance in multithreaded programs. Dynamically, such serialization may be unnecessary because these critical sections could have safely executed concurrently without locks. Current processors cannot

Atomizer: a dynamic atomicity checker for multithreaded programs

by Cormac Flanagan, Stephen N. Freund - In POPL , 2004
"... Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. We focus on the fundamental non-interference property of atomicity and present a dynamic analysis for detecting atomicity violations. This analysis combines i ..."
Abstract - Cited by 241 (14 self) - Add to MetaCart
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. We focus on the fundamental non-interference property of atomicity and present a dynamic analysis for detecting atomicity violations. This analysis combines

Transactional Lock-Free Execution of Lock-Based Programs

by Ravi Rajwar, James R Goodman - In Proceedings of the Tenth International Conference on Architectural Support for Programming Languages and Operating Systems , 2002
"... This paper is motivated by the difficulty in writing correct high-performance programs. Writing shared-memory multithreaded programs imposes a complex trade-off between programming ease and performance, largely due to subtleties in coordinating access to shared data. To ensure correctness programmer ..."
Abstract - Cited by 201 (9 self) - Add to MetaCart
This paper is motivated by the difficulty in writing correct high-performance programs. Writing shared-memory multithreaded programs imposes a complex trade-off between programming ease and performance, largely due to subtleties in coordinating access to shared data. To ensure correctness

Escape analysis for Java

by Jong-deok Choi, Mannish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, Sam Midkiff - OOPSLA , 1999
"... This paper presents a simple and efficient data flow algorithm for escape analysis of objects in Java programs to determine (i) if an object can be allocated on the stack; (ii) if an object is accessed only by a single thread duriing its lifetime, so that synchronization operations on that object ca ..."
Abstract - Cited by 300 (12 self) - Add to MetaCart
programs (with a median of 5 l%), and the overall execution time reduction ranges from 2 % to 23 % (with a median of 7%) on a 333 MHz PowerPC workstation with 128 MB memory. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided

Social Capital: implications for Development Theory

by Michael Woolcock, Deepa Narayan - World Bank Research Observer , 2000
"... In the 1990s, the idea of social capital—defined here as the norms and networks that enable people to act collectively—enjoyed a remarkable rise to prominence across all the social science disciplines. We trace out the evolution of social capital research as it pertains to economic development, and ..."
Abstract - Cited by 288 (4 self) - Add to MetaCart
at both the community and institutional level, and tease out the policy implications for poverty reduction programs. We conclude by arguing that a significant virtue of the idea and discourse of social capital is that it helps to bridge orthodox divides among scholars, practitioners, and policymakers

Runtime analysis of atomicity for multi-threaded programs

by Liqiang Wang, Scott D. Stoller - IEEE Transactions on Software Engineering , 2006
"... Abstract—Atomicity is a correctness condition for concurrent systems. Informally, atomicity is the property that every concurrent execution of a set of transactions is equivalent to some serial execution of the same transactions. In multithreaded programs, executions of procedures (or methods) can b ..."
Abstract - Cited by 93 (9 self) - Add to MetaCart
Abstract—Atomicity is a correctness condition for concurrent systems. Informally, atomicity is the property that every concurrent execution of a set of transactions is equivalent to some serial execution of the same transactions. In multithreaded programs, executions of procedures (or methods) can

Detailed Design and Evaluation of Redundant Multithreading Alternatives

by Shubhendu S. Mukherjee, et al. , 2002
"... ... with reductions in voltage levels, makes each generation of microprocessors increasingly vulnerable to transient faults. In a multithreaded environment, we can detect these faults by running two copies of the same program as separate threads, feeding them identical inputs, and comparing their ou ..."
Abstract - Cited by 167 (7 self) - Add to MetaCart
... with reductions in voltage levels, makes each generation of microprocessors increasingly vulnerable to transient faults. In a multithreaded environment, we can detect these faults by running two copies of the same program as separate threads, feeding them identical inputs, and comparing

A type and effect system for atomicity

by Cormac Flanagan, Shaz Qadeer - In PLDI 03: Programming Language Design and Implementation , 2003
"... Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work addressed this problem by devising tools for detecting race conditions, a situation where two threads simultaneously access the same d ..."
Abstract - Cited by 252 (22 self) - Add to MetaCart
type system for specifying and verifying the atomicity of methods in multithreaded Java programs. The atomic type system is a synthesis of Lipton’s theory of reduction and type systems for race detection. We have implemented this atomic type system for Java and used it to check a variety of standard
Next 10 →
Results 1 - 10 of 863
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University