SIGN IN
SIGN UP
Detecting data races in Cilk programs that use locks
Full Text:
Pdf
Buy this Article
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
1998 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 33
· Downloads (cumulative): 430
· Citation Count: 38
Published in:
· Proceeding
SPAA '98
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Pages 298 - 309
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-989-0
doi>
10.1145/277651.277696
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithm
algorithms
cilk
data race
debugging
design
management
multithreading
parallel programming
race detection
reliability
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder