Java Reference
In-Depth Information
Programming, Systems, Languages, and Applications
, pages 388-402. ACM Press,
2003. URL
http://doi.acm.org/10.1145/949305.949340
.
Tim Harris, Simon Marlow, Simon Peyton-Jones, and Maurice Herlihy. Composable
Memory Transactions. In
PPoPP'05:Proceedings oftheTenthACMSIGPLANSym-
posium on Principles and Practice of Parallel Programming
, pages 48-60. ACM
Press, 2005. URL
http://doi.acm.org/10.1145/1065944.1065952
.
Maurice Herlihy. Wait-Free Synchronization.
ACM Transactions on Programming Lan-
guages and Systems
,
13(1):124-149,
1991.
URL
Maurice Herlihy and Nir Shavit.
Multiprocessor Synchronization and Concurrent Data
Structures
. Morgan-Kaufman, 2006.
C. A. R. Hoare. Monitors: An Operating System Structuring Concept.
Communications of
the ACM
, 17(10):549-557, 1974. URL
http://doi.acm.org/10.1145/355620.361161
.
David Hovemeyer and William Pugh. Finding Bugs is Easy.
SIGPLAN Notices
, 39
(12):92-106, 2004. URL
http://doi.acm.org/10.1145/1052883.1052895
.
Ramnivas Laddad.
AspectJ in Action
. Manning, 2003.
Doug Lea.
Concurrent Programming in Java
, Second Edition. Addison-Wesley, 2000.
Doug Lea. JSR-133 Cookbook for Compiler Writers. URL
http://gee.cs.oswego.edu/dl/
J. D. C. Little. A proof of the Queueing Formula
L = λW
”.
Operations Research
, 9:
383-387, 1961.
Jeremy Manson, William Pugh, and Sarita V. Adve. The Java Memory Model. In
POPL
'05: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles
of Programming Languages
,
pages
378-391.
ACM
Press,
2005.
URL
George Marsaglia. XorShift RNGs.
Journal of Statistical Software
, 8(13), 2003. URL
ht-
Maged M. Michael and Michael L. Scott. Simple, Fast, and Practical Non-Blocking
and Blocking Concurrent Queue Algorithms. In
Symposium on Principles of Dis-
tributed Computing
,
pages
267-275,
1996.
URL
Mark Moir and Nir Shavit.
Concurrent Data Structures
, In
Handbook of Data Structures
and Applications
, chapter 47. CRC Press, 2004.