-
2
-
-
0036590708
-
The data locality of work stealing
-
U. A. Acar, G. E. Blelloch, and R. D. Blumofe, -The data locality of work stealing." Theory of Computing Systems, vol. 35, no. 3, pp. 321-347, 2002.
-
(2002)
Theory of Computing Systems
, vol.35
, Issue.3
, pp. 321-347
-
-
Acar, U.A.1
Blelloch, G.E.2
Blumofe, R.D.3
-
4
-
-
32844466488
-
-
D. Hendler, Y. Lev, M. Moir, and N. Shavit, 'A dynamic-sized nonblock-ing work stealing deque, Distrib. Comput., 18, no. 3, pp. 189-207, 2006.
-
D. Hendler, Y. Lev, M. Moir, and N. Shavit, 'A dynamic-sized nonblock-ing work stealing deque," Distrib. Comput., vol. 18, no. 3, pp. 189-207, 2006.
-
-
-
-
6
-
-
33646417311
-
Factory: An object-oriented parallel programming substrate for deep multiprocessors,
-
High Performance Computing and Communications HPCC
-
S. Schneider, C. D. Antonopoulos, and D. S. Nikolopoulos, "Factory: An object-oriented parallel programming substrate for deep multiprocessors, " in High Performance Computing and Communications (HPCC), ser. Lecture Notes in Computer in Science, vol. 3726, 2005, pp. 223-232.
-
(2005)
ser. Lecture Notes in Computer in Science
, vol.3726
, pp. 223-232
-
-
Schneider, S.1
Antonopoulos, C.D.2
Nikolopoulos, D.S.3
-
7
-
-
53149092598
-
-
The Cilk Project
-
"The Cilk Project." http://supertech.csail.mit.edu/cilk.
-
-
-
-
8
-
-
0003230603
-
Parallel garbage collection for shared memory multiprocessors
-
Monterey, CA
-
C. Flood, D. Detlefs, N. Shavit and C. Zhang, "Parallel garbage collection for shared memory multiprocessors," in Usenix Java Virtual Machine Research and Technology Symposium (JVM '01), Monterey, CA, 2001.
-
(2001)
Usenix Java Virtual Machine Research and Technology Symposium (JVM '01)
-
-
Flood, C.1
Detlefs, D.2
Shavit, N.3
Zhang, C.4
-
9
-
-
35248898044
-
Deadlock-free scheduling of X10 computations with bounded resources
-
ACM
-
S. Agarwal, R. Barik, D. Bonachea, V. Sarkar, R. K. Shyamasundar. and K. Yelick, "Deadlock-free scheduling of X10 computations with bounded resources," in Proceedings of the nineteenth annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). ACM, 2007, pp. 229-240.
-
(2007)
Proceedings of the nineteenth annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)
, pp. 229-240
-
-
Agarwal, S.1
Barik, R.2
Bonachea, D.3
Sarkar, V.4
Shyamasundar, R.K.5
Yelick, K.6
-
10
-
-
0025917643
-
Wait-free synchronization
-
M. Herlihy, "Wait-free synchronization," ACM Trans. Program. Lang. Syst., vol. 13, no. 1, pp. 124-149, 1991.
-
(1991)
ACM Trans. Program. Lang. Syst
, vol.13
, Issue.1
, pp. 124-149
-
-
Herlihy, M.1
-
11
-
-
53149136690
-
-
H. Boehm, http://www.hpl.hp.com/research/linux/atomic_ops.
-
-
-
Boehm, H.1
-
12
-
-
0000269759
-
Scheduling multithreaded computations by work stealing
-
C. E. L. Robert D. Blumofe, "Scheduling multithreaded computations by work stealing," ACM 46(5), pp. 720-748, 1999.
-
(1999)
ACM
, vol.46
, Issue.5
, pp. 720-748
-
-
Robert, C.E.L.1
Blumofe, D.2
-
13
-
-
0035608253
-
-
C. G. P. Nimar S. Arora, Robert D. Blumofe, Thread scheduling for multiprogrammed multiprocessors, Theory of Computing Systems, 34, no. 2, pp. 115-144, 2001.
-
C. G. P. Nimar S. Arora, Robert D. Blumofe, "Thread scheduling for multiprogrammed multiprocessors," Theory of Computing Systems, vol. 34, no. 2, pp. 115-144, 2001.
-
-
-
-
14
-
-
0032093943
-
The performance of work stealing in multiprogrammed environments (extended abstract)
-
R. D. Blumofe and D. Papadopoulos, "The performance of work stealing in multiprogrammed environments (extended abstract)," in Measurement and Modeling of Computer Systems, 1998, pp. 266-267.
-
(1998)
Measurement and Modeling of Computer Systems
, pp. 266-267
-
-
Blumofe, R.D.1
Papadopoulos, D.2
-
16
-
-
6344267043
-
-
Computing Science, Chalmers University of Technology. Tech. Rep, 2004
-
A. Gidenstam, M. Papatriantafilou, and P. Tsigas, "Allocating Memory in a Lock-Free Manner," Computing Science, Chalmers University of Technology. Tech. Rep. 2004-04, 2004.
-
(2004)
Allocating Memory in a Lock-Free Manner
-
-
Gidenstam, A.1
Papatriantafilou, M.2
Tsigas, P.3
-
17
-
-
17544362263
-
Hoard: A scalable memory allocator for multithreaded applications
-
E. D. Berger, K. S. McKinley, R. D. Blumofe, and P. R. Wilson, "Hoard: a scalable memory allocator for multithreaded applications," SIGPLAN Not, vol. 35, no. 11, pp. 117-128, 2000.
-
(2000)
SIGPLAN Not
, vol.35
, Issue.11
, pp. 117-128
-
-
Berger, E.D.1
McKinley, K.S.2
Blumofe, R.D.3
Wilson, P.R.4
-
18
-
-
38049138578
-
-
S. Thibault, R. Namyst, and P.-A. Wacrenier, in Building Portable Thread Schedulers for Hierarchical Multiprocessors: The BubbleSched Framework, ser. Lecture Notes in Computer in Science, 464. Parallel Processing, 13th International Euro-Par Conference, 8 2007, pp. 42-51.
-
S. Thibault, R. Namyst, and P.-A. Wacrenier, in Building Portable Thread Schedulers for Hierarchical Multiprocessors: The BubbleSched Framework, ser. Lecture Notes in Computer in Science, vol. 464. Parallel Processing, 13th International Euro-Par Conference, 8 2007, pp. 42-51.
-
-
-
-
22
-
-
53149146411
-
-
K. Asanovic, R. Bodik. B. C. Catanzaro, J. J. Gebis, P. Husbands, K. Keutzer, D. A. Patterson, W. L. Plishker, J. Shalf, S. W. Williams, and K. A. Yelick, The landscape of parallel computing research: A view from berkeley, EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2006-183, Dec 2006.
-
K. Asanovic, R. Bodik. B. C. Catanzaro, J. J. Gebis, P. Husbands, K. Keutzer, D. A. Patterson, W. L. Plishker, J. Shalf, S. W. Williams, and K. A. Yelick, "The landscape of parallel computing research: A view from berkeley," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2006-183, Dec 2006.
-
-
-
-
23
-
-
0038842248
-
Algorithm 821: A Fortran interface to POSIX threads
-
R. J. Hanson, C. P. Breshears, and H. A. Gabb. "Algorithm 821: A Fortran interface to POSIX threads," ACM Trans. Math. Softw., vol. 28, no. 3, pp. 354-371, 2002.
-
(2002)
ACM Trans. Math. Softw
, vol.28
, Issue.3
, pp. 354-371
-
-
Hanson, R.J.1
Breshears, C.P.2
Gabb, H.A.3
|