Analysis of task migration in shared-memory multiprocessor scheduling
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
The implementation of the Cilk-5 multithreaded language
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Efficient load balancing for wide-area divide-and-conquer applications
PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
The Natural Work-Stealing Algorithm is Stable
SIAM Journal on Computing
KAAPI: A thread scheduling runtime system for data flow computations on cluster of multi-processors
Proceedings of the 2007 international workshop on Parallel symbolic computation
Processor-Oblivious Parallel Stream Computations
PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
Mean field asymptotics of Markov decision evolutionary games and teams
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Load balancing and the power of preventive probing
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Energy-aware capacity scaling in virtualized environments with performance guarantees
Performance Evaluation
Fluid computation of the performance: energy tradeoff in large scale Markov models
ACM SIGMETRICS Performance Evaluation Review
Fluid limits of queueing networks with batches
ICPE '12 Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering
WSCOM: Online Task Scheduling with Data Transfers
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Mean-Field analysis of markov models with reward feedback
ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
Markov chains with discontinuous drifts have differential inclusion limits
Performance Evaluation
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Pull versus push mechanism in large distributed networks: closed form results
Proceedings of the 24th International Teletraffic Congress
Continuous approximation of collective system behaviour: A tutorial
Performance Evaluation
| Hi-index | 0.00 |
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job allocation policies is to balance the workload over the different resources. We present a Markovian model for performance evaluation of such a policy, namely work stealing (idle processors steal work from others) in large-scale heterogeneous systems. Using mean field theory, we show that when the size of the system grows, it converges to a system of deterministic ordinary differential equations that allows one to compute the expectation of performance functions (such as average response times) as well as the distributions of these functions.