Work dealing
暂无分享,去创建一个
[1] Eli Upfal,et al. A simple load balancing scheme for task allocation in parallel machines , 1991, SPAA '91.
[2] Mark Moir,et al. Lock-free reference counting , 2002 .
[3] Leslie Lamport,et al. Specifying Concurrent Program Modules , 1983, TOPL.
[4] Michael Mitzenmacher,et al. Analyses of load stealing models based on differential equations , 1998, SPAA '98.
[5] Leslie Ann Goldberg,et al. The Natural Work-Stealing Algorithm is Stable , 2001, SIAM J. Comput..
[6] C. Greg Plaxton,et al. Thread Scheduling for Multiprogrammed Multiprocessors , 1998, SPAA '98.
[7] Maged M. Michael,et al. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms , 1996, PODC '96.
[8] Nir Shavit,et al. Parallel Garbage Collection for Shared Memory Multiprocessors , 2001, Java Virtual Machine Research and Technology Symposium.
[9] Guy E. Blelloch,et al. The data locality of work stealing , 2000, SPAA.
[10] Maurice Herlihy,et al. Dynamic-sized lockfree data structures , 2002 .
[11] Nir Shavit,et al. Non-blocking steal-half work queues , 2002, PODC '02.
[12] Girija J. Narlikar,et al. Scheduling threads for low space requirement and good locality , 1999, SPAA '99.
[13] Nir Shavit,et al. Elimination Trees and the Construction of Pools and Stacks , 1997, Theory of Computing Systems.
[14] Reinhard Lüling,et al. A dynamic distributed load balancing algorithm with provable good performance , 1993, SPAA '93.