• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Provably good race detection that runs in parallel (2005)

Cached

  • Download as a PDF

Download Links

  • [theory.csail.mit.edu]
  • [www.cs.cmu.edu]
  • [people.csail.mit.edu]
  • [supertech.csail.mit.edu]
  • [supertech.csail.mit.edu]
  • [supertech.csail.mit.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jeremy T. Fineman
Citations:2 - 1 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Fineman05provablygood,
    author = {Jeremy T. Fineman},
    title = {Provably good race detection that runs in parallel},
    institution = {},
    year = {2005}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Citations

7321 Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
940 How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs - Lamport - 1979
431 Cilk: an efficient multithreaded runtime system - Blumofe, Joerg, et al. - 1991
368 Garbage Collection: Algorithms for Automatic Dynamic Memory Managem ent.John Wiley&Sons,Ltd,1996 - Jones
316 Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1999
301 Recursive functions of symbolic expressions and their computation by machine, part I - McCarthy - 1960
248 The implementation of the Cilk-5 multithreaded language - Frigo, Leiserson, et al. - 1998
149 Compact routing schemes - Thorup, Zwick
143 Two algorithms for maintaining order in a list - Dietz, Sleator - 1987
130 Thread scheduling for multiprogrammed multiprocessors - Arora, Blumofe, et al.
110 A Method for Overlapping and Erasure of Lists - Collins - 1960
103 An empirical comparison of monitoring algorithms for access anomaly detection - Dinning, Schonberg - 1990
91 A comparison of labeling schemes for ancestor queries - Kaplan, Milo, et al. - 2002
84 Techniques for debugging parallel programs with flowback analysis - Choi, Miller, et al. - 1991
83 Distance labeling in graphs - Gavoille, Peleg, et al.
80 Maintaining order in a linked list - Dietz - 1982
79 Detecting access anomalies in programs with critical sections - Dinning, Schonberg - 1991
75 Detecting data races in cilk programs that use locks - Cheng, Feng, et al. - 1998
70 On-the-fly detection of data races for programs with nested fork-join parallelism - Mellor-Crummey - 1991
67 A general-purpose algorithm for analyzing concurrent programs - Taylor
65 Nearest common ancestor: a survey and a new algorithm for a distributed environment - Alstrup, Gavoille, et al. - 2004
65 Automatic detection of nondeterminacy in parallel programs - Emrath, Padua - 1988
65 A mechanism for efficient debugging of parallel programs - Miller, Choi - 1988
65 Improving the accuracy of data race detection - Netzer, Miller - 1991
52 Two simplified algorithms for maintaining order in a list - Bender, Cole, et al. - 2005
52 Static Analysis of Low-level Synchronization - CALLAHAN, SUBHLOK - 1988
48 On the Complexity of Event Ordering for Shared-Memory Parallel Program Executions - Netzer, Miller - 1990
47 Improved labeling scheme for ancestor queries - Alstrup, Rauhe - 2002
45 H.: Wait-free parallel algorithms for the union-find problem - Anderson, Woll - 1991
43 M.: A sparse table implementation of priority queues - Itai, Konheim, et al. - 1981
42 Efficient detection of determinacy races in Cilk programs - Feng, Leiserson - 1997
41 Event synchronization analysis for debugging parallel programs - Emrath, Ghosh, et al. - 1991
39 Eraser: A Dynamic Race Detector for Multithreaded Programs - Savage, Burrows, et al. - 1997
38 Endre Tarjan. Data structures and network algorithms - Robert - 1983
32 Tools for the efficient development of efficient parallel programs - Nudler, Rudolph - 1986
31 Labeling schemes for flow and connectivity - Katz, Katz, et al. - 2007
30 A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time - Willard - 1992
29 Maintaining order in a generalized linked list - Tsakalidis - 1984
27 Compile-time detection of race conditions in a parallel program - Balasundaram, Kennedy - 1989
27 Compile-time support for efficient data race detection in shared memory parallel programs - Mellor-Crummey - 1992
26 Analyzing traces with anonymous synchronization - Helmbold, McDowell, et al. - 1990
23 E cient race condition detection for shared-memory programs with post/wait synchronization - Netzer, Ghosh - 1992
22 Mehlhorn, Friedhelm Meyer auf der - Dietzfelbinger, Karlin, et al. - 1994
20 Labeling Schemes for Small Distances in Trees - Alstrup, Bille, et al.
19 A tight lower bound for online monotonic list labeling - Dietz, Seiferas, et al. - 2004
18 Lower bounds for monotonic list labeling - Dietz, Zhang - 1990
16 Endre Tarjan. Efficiency of a good but not linear set union algorithm - Robert - 1975
15 Direct routing on trees - Alstrup, Holm, et al. - 1998
14 Endre Tarjan. Applications of path compression on balanced trees - Robert - 1979
14 Maintaining dense sequential files in a dynamic environment - Willard - 1982
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2010 The Pennsylvania State University