Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
Adaptive load sharing in heterogeneous distributed systems
Journal of Parallel and Distributed Computing
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
Exact sampling with coupled Markov chains and applications to statistical mechanics
Proceedings of the seventh international conference on Random structures and algorithms
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling multithreaded computations by work stealing
Journal of the ACM (JACM)
Implementation of multilisp: Lisp on a multiprocessor
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Executing functional programs on a virtual tree of processors
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Parallel and distributed systems: load sharing in heterogeneous distributed systems
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Perfect Simulation of Queueing Networks with Blocking and Rejection
SAINT-W '05 Proceedings of the 2005 Symposium on Applications and the Internet Workshops
Perfect simulation of index based routing queueing networks
ACM SIGMETRICS Performance Evaluation Review
Psi^2 a Software Tool for the Perfect Simulation of Finite Queueing Networks
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
A class of mean field interaction models for computer and communication systems
Performance Evaluation
Perfect simulation and non-monotone Markovian systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
| Hi-index | 0.00 |
This article presents a performance evaluation method for the dimensioning of load sharing policies in high performance distributed systems such as clusters and grids. Even for moderate system size, the corresponding Markovian models are not tractable neither analytically nor numerically.We propose a modelling framework and a simulation kernel which provides an unbiased sampling of the stationary distribution. As needed by the Propp &Wilson algorithm, we prove that events of load sharing systems preserve partial ordering on the state space (monotone events) that guarantees the simulation efficiency. This has been tested on large scale models (about 1000 nodes) in the Ψ2 simulation framework and applied for the comparison between work sharing and work stealing policies performances and for the optimisation of parameters such as the control rate and the probing depth.