Scheduling BoT Applications in Grids Using a Slave Oriented Adaptive Algorithm
Efficient scheduling of Bag-of-Tasks (BoT) applications in a computational grid environment reveals several challenges due to its high heterogeneity, dynamic behavior, and space shared utilization. Currently, most of the scheduling algorithms proposed in the literature use a master-oriented algorithm, in which the master is the only responsible for choosing the best task size to send to each slave. We present in this paper a different approach whose main originality is to be slave-oriented, ie each slave locally determines, from a set of initial runs, which workload size is more adapted to its capacities and notifies the master of it. Finally, we show some measurements comparing our algorithm with other three well-known scheduling algorithms using the SimGrid toolkit.
Unable to display preview. Download preview PDF.
- 1.da Silva, D.P., Cirne, W., Brasileiro, F.V.: Trading cycles for information: Using replication to schedule bag-of-tasks applications on computational grids. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 169–180. Springer, Heidelberg (2003)CrossRefGoogle Scholar
- 2.Chronopoulos, A.T., Andoine, R., Benche, M., Grosu, D.: A CLass of Loop Self-Scheduling for Heterogeneous Clusters. In: Proceedings of CLUSTER 2001 (2001)Google Scholar
- 5.Press, W.e.a.: Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge (1993) Number ISBN 0521431085Google Scholar
- 7.Casanova, H.: Simgrid: A toolkit for the simulation of application scheduling. In: Proceedings of the IEEE Symposium on Cluster Computing and the Grid, CCGrid 2001 (2001)Google Scholar