-
1
-
-
33646421297
-
-
version 1.0. Technical report, Sun Microsystems, Inc., March, Publications/fortress.1.0.pdf
-
E. Allen, D. Chase, J. Hallett, V. Luchango, J.-W. Maessen, S. Ryu, G. L. S. Jr., and S. Tobin-Hochstadt. The Fortress language specification, version 1.0. Technical report, Sun Microsystems, Inc., March 2008. URL http://research.sun.com/projects/plrg/ Publications/fortress.1.0.pdf.
-
(2008)
The Fortress Language Specification
-
-
Allen, E.1
Chase, D.2
Hallett, J.3
Luchango, V.4
Maessen, J.-W.5
Ryu, S.6
Jr., G.L.S.7
Tobin-Hochstadt, S.8
-
2
-
-
0031628001
-
Thread scheduling for multiprogrammed multiprocessors
-
Puerto Vallarta, Mexico
-
N. S. Arora, R. D. Blumofe, and C. G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 119-129, Puerto Vallarta, Mexico, 1998.
-
(1998)
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures
, pp. 119-129
-
-
Arora, N.S.1
Blumofe, R.D.2
Plaxton, C.G.3
-
3
-
-
84991003269
-
A method for implementing lock-free shared-data structures
-
New York, NY, USA, ACM. ISBN 0-89791-599-2
-
G. Barnes. A method for implementing lock-free shared-data structures. In SPAA '93: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 261-270, New York, NY, USA, 1993. ACM. ISBN 0-89791-599-2.
-
(1993)
SPAA ' 93: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures
, pp. 261-270
-
-
Barnes, G.1
-
4
-
-
0000269759
-
Scheduling multithreaded computations by work stealing
-
R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. Journal of the ACM, 46(5):720-748, 1999.
-
(1999)
Journal of the ACM
, vol.46
, Issue.5
, pp. 720-748
-
-
Blumofe, R.D.1
Leiserson, C.E.2
-
7
-
-
56449105131
-
Hopscotch hashing
-
Berlin, Heidelberg, Springer-Verlag
-
M. Herlihy, N. Shavit, and M. Tzafrir. Hopscotch hashing. In DISC '08: Proceedings of the 22nd International Symposium on Distributed Computing, pages 350-364, Berlin, Heidelberg, 2008. Springer-Verlag.
-
(2008)
DISC ' 08: Proceedings of the 22nd International Symposium on Distributed Computing
, pp. 350-364
-
-
Herlihy, M.1
Shavit, N.2
Tzafrir, M.3
-
8
-
-
84938938481
-
Disjoint-access-parallel implementations of strong shared memory primitives
-
New York, NY, USA, ACM
-
A. Israeli and L. Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. In PODC '94: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, pages 151-160, New York, NY, USA, 1994. ACM.
-
(1994)
PODC ' 94: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing
, pp. 151-160
-
-
Israeli, A.1
Rappoport, L.2
-
10
-
-
35248854503
-
A concurrent Blink-tree algorithm using a cooperative locking protocol
-
Springer Berlin / Heidelberg
-
S.-C. Lim, J. Ahn, and M. H. Kim. A concurrent Blink-tree algorithm using a cooperative locking protocol. In Lecture Notes in Computer Science, volume 2712, pages 253-260. Springer Berlin / Heidelberg, 2003.
-
(2003)
Lecture Notes in Computer Science
, vol.2712
, pp. 253-260
-
-
Lim, S.-C.1
Ahn, J.2
Kim, M.H.3
-
11
-
-
77957550930
-
-
OpenMP Architecture Review Board. OpenMP application program interface, version 3.0., May
-
OpenMP Architecture Review Board. OpenMP application program interface, version 3.0. http://www.openmp.org/mp-documents/ spec30.pdf, May 2008.
-
(2008)
-
-
-
13
-
-
0026965767
-
Locking without blocking: Making lock based concurrent data structure algorithms nonblocking
-
New York, NY, USA, ACM
-
J. Turek, D. Shasha, and S. Prakash. Locking without blocking: Making lock based concurrent data structure algorithms nonblocking. In PODS '92: Proceedings of the Eleventh ACM SIGACT-SIGMOD- SIGART Symposium on Principles of Database Systems, pages 212- 222, New York, NY, USA, 1992. ACM.
-
(1992)
PODS ' 92: Proceedings of the Eleventh ACM SIGACT-SIGMOD- SIGART Symposium on Principles of Database Systems
, pp. 212-222
-
-
Turek, J.1
Shasha, D.2
Prakash, S.3
|