ACM Home Page
Please provide us with feedback. Feedback
Detecting data races in Cilk programs that use locks
Full text PdfPdf (1.81 MB)
Source ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures table of contents
Puerto Vallarta, Mexico
Pages: 298 - 309  
Year of Publication: 1998
ISBN:0-89791-989-0
Authors
Guang-Ien Cheng  MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts
Mingdong Feng  Department of Information Systems and Computer Science, National University of Singapore, 10 Lower Kent Ridge Road, Republic of Singapore 119260
Charles E. Leiserson  MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts
Keith H. Randall  MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts
Andrew F. Stark  MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
SIGOPS: ACM Special Interest Group on Operating Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 61,   Citation Count: 22
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/277651.277696
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Barnes and P. Hut. A hierarchical O(NlogN) force-calculation algorithm. Nature, 324:446-449, 1986.
 
2
Philippe Bekaert, Frank Suykens de Laet, and Philip Dutre. Renderpark, 1997. Available on the Internet from http://www.cs. kuleuven, ae./cwis/research/graphi cs/KENDERPARK/.
 
3
 
4
5
 
6
Cilk-5.1 Reference Manual. Available on the lnternet fiom ht;tp:// "theory. Ics .mit. edu/" cilk.
 
7
8
9
10
 
11
Anne Carolyn Dinning. Detecting Nondeterminism in Shared Memory Parallel Pmgrants. PhD thesis, Department of Computer Science, New York University, July 1990.
12
13
 
14
Yaacov Fenster. Detecting parallel access anomalies. Master's thesis, Hebrew University, March 1998.
15
16
 
17
Michael Halbherr, Yuli Zhou, and Chris E Joe,'g. MIMD-style parallel programming with continuation-passing threads. In Pn)ceedings of the 2nd International Workshop on Massive Parallelism: Hardware, Software, and Applications, Capri, Italy, September 1994.
 
18
David R Helmbold, Charles E. McDowell, and Jian-Zhong Wang. Analyzing traces with anonymous synchronization. In Proceedings of the 1990 lnternatiomll Conference on Parallel Processing, pages II70- 1177, August 1990.
19
 
20
 
21
Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690-691, September 1979.
22
23
24
 
25
Greg Nelson, K. Rustan M. Leino, James B, Saxe, and Raymie Stata. Extended static checking home page, 1996. Available on the Internet from http ://www. research, digital, com/SRC/ esc/Esc, html,
 
26
Robert H. B. Netzer and Sanjoy Ghosh. Efficient race condition detection for shared-memory programs with post/wait synchronization. in Proceedings of the 1992 International Conference on Parallel Processing, St. Charles, Illinois, August 1992.
 
27
Robexl H. B. Netzer and Barton R Millet'. On the complexity of event ordering for shared-memory parallel program executions. In Proceedings of the 1990 International Conference on Parallel Processing, pages ll: 93-97, August 1990.
28
 
29
ltzhak Nudler and Larry Rudolph. Tools for the efficient development of efficient parallel programs, in Proceedings #ffthe First Israeli Conference on Computer Systems Engineering, May 1986.
30
31
32
33

CITED BY  22

Collaborative Colleagues:
Guang-Ien Cheng: colleagues
Mingdong Feng: colleagues
Charles E. Leiserson: colleagues
Keith H. Randall: colleagues
Andrew F. Stark: colleagues