Self-adaptive skeletal task farm for computational grids

作者: Horacio González-Vélez

DOI: 10.1016/J.PARCO.2006.07.002

关键词:

摘要: In this work, we introduce a self-adaptive task farm for computational grids which is based on single-round scheduling algorithm called dynamic deal. principle, the deal approach employs skeletal forecasting information to automatically instrument and determine amount of work assigned each worker at execution time, allowing adapt effectively different load network conditions in grid. practice, it uses self-generated predictive values maps tasks onto nodes single-round. The effectiveness illustrated with biology parameter sweep non-dedicated departmental

参考文章(30)
P. Diehl, H. Kellerhals, E. Lustig, Least-Squares Fitting Springer, Berlin, Heidelberg. pp. 77- 80 ,(1972) , 10.1007/978-3-642-65261-5_14
Veeravalli Bharadwaj, Debasish Ghose, V Mani, T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems IEEE Computer Society Press. ,(1996)
Eitan Frachtenberg, Dror G. Feitelson, Pitfalls in parallel job scheduling evaluation job scheduling strategies for parallel processing. pp. 257- 282 ,(2005) , 10.1007/11605300_13
Veeravalli Bharadwaj, Debasish Ghose, Thomas G. Robertazzi, Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems Cluster Computing. ,vol. 6, pp. 7- 17 ,(2003) , 10.1023/A:1020958815308
Jan Weglarz, Jarek Nabrzyski, Jennifer M Schopf, None, Grid resource management: state of the art and future trends Kluwer Academic Publishers. ,(2004)
Murray Cole, Why Structured Parallel Programming Matters Lecture Notes in Computer Science. pp. 37- 37 ,(2004) , 10.1007/978-3-540-27866-5_4
Horacio González-Vélez, An Adaptive Skeletal Task Farm for Grids Euro-Par 2005 Parallel Processing. pp. 401- 410 ,(2005) , 10.1007/11549468_47