共 76 条
[1]
Berenbrink P(2003)The natural work-stealing algorithm is stable SIAM Journal on Computing 32 1260-1279
[2]
Friedetzky T(1999)Scheduling multi-threaded computations by work stealing Journal of the ACM 46 720-748
[3]
Goldberg L A(2010)Randomized load balancing with general service time distributions ACM SIGMETRICS Performance Evaluation Review 38 275-286
[4]
Blumofe R D(2012)Asymptotic independence of queues under randomized load balancing Queueing Systems 71 247-292
[5]
Leiserson C E(2013)Decay of tails at equilibrium for FIFO join the shortest queue networks The Annals of Applied Probability 23 1841-1878
[6]
Bramson M(2011)CloudSim: A toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms Software: Practice and experience 41 23-50
[7]
Lu Y(2010)A mean field model of work stealing in large-scale systems ACM SIGMETRICS Performance Evaluation Review 38 13-24
[8]
Prabhakar B(2000)Chaoticity on path space for a queueing network with selection of the shortest queue among several Journal of Applied Probability 37 198-211
[9]
Bramson M(2005)Functional central limit theorems for a large network in which customers join the shortest of several queues Probability Theory and Related Fields 131 97-120
[10]
Lu Y(2011)Performance analysis of cloud computing services for many-tasks scientific computing IEEE Transactions on Parallel and Distributed Systems 22 931-945