A minimized makespan scheduler with multiple factors for Grid computing systems

Expert Systems with Applications

Volumn 36, Issue 8, 2009, Pages 11118-11130

  Tseng, Li Ya ^a   Chin, Yeh Hao ^a   Wang, Shu Ching ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Dynamic heuristic; Makespan; Scheduling; Total weighted tardiness

Indexed keywords

COMMUNICATION TIME; DYNAMIC ENVIRONMENTS; EXECUTION TIME; GRID COMPUTING SYSTEMS; GRID ENVIRONMENTS; HETEROGENEOUS COMPUTING; HIGH-SPEED; LINE MAPPING; LOWER COST; MAKESPAN; MINIMUM COMPLETION TIME; MINIMUM MAKESPAN; MULTIPLE FACTORS; SCHEDULING HEURISTIC; SCHEDULING HEURISTICS; TARDINESS COST; TOTAL WEIGHTED TARDINESS;

GRID COMPUTING; HEURISTIC METHODS; SCHEDULING; TELECOMMUNICATION SYSTEMS;

COSTS;

EID: 67349181013     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.02.071     Document Type: Article

References (26)

1. Anderson D.P., Cobb J., Korpela E., Lebofsky M., and Werthimer D. SETI@home: An experiment in public-resource computing. Communications of the ACM 45 11 (2002) 56-61
2. Braun, T. D., Siegel, H. J., Beck, N., Boloni, L. L., Maheswaran, M., Reuther, A. I., et al. (1999). A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In Proceedings of the eighth IEEE workshop on heterogeneous computing systems (HCW'99) (pp. 15-29).
3. Braun T.D., Siegel H.J., Beck N., Boloni L.L., Maheswaran M., Reuther A.I., et al. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing 61 6 (2001) 810-837
4. Breslau L., Estrin D., Fall K., Floyd S., Heidemann J., Helmy A., et al. Advances in Network Simulation 33 5 (2000) 59-67
5. Buyya R., Abramson D., Giddy J., and Stockinger H. Economic models for resource management and scheduling in Grid computing. Concurrency and Computation-Practice and Experience 14 13-15 (2002) 1507-1542
6. Chen, H.-A. (2005). On the design of task scheduling in the heterogeneous computing environments. In Proceedings of the 2005 IEEE Pacific rim conference on communications, computers and signal processing (PACRIM 2005) (pp. 396-399).
7. Dong, F., & Akl, S. G. (2006). Scheduling algorithms for grid computing: State of the art and open problems. Technical report. (link checked 01.08.2008).
8. Eshagian M.M. Heterogeneous computing. (pp. 2-13) (1996), Artech House
9. Foster, I. (2002). What is the grid? A three point checklist. GRIDToday, 1(6). (link checked 01.08.2008).
10. Foster I., and Kesselman C. The Grid2: Blueprint for a new computing infrastructure. (pp. 3-12) (2004), Morgan Kaufmann
11. Fujimoto, N., & Hagihara, K. (2004). A comparison among grid scheduling algorithms for independent coarse-grained tasks. In Proceedings of the 2004 international symposium on applications an the internet workshops (SAINTW'04) (pp. 674-680).
12. Golconda, K. S., Dogan, A., & Ozguner, F. (2004). Static mapping heuristics for tasks with hard deadlines in real-time heterogeneous systems. In Proceedings of the 19th international symposium on computer and information sciences (ISCIS 2004) (pp. 827-836).
13. Groth, P. T. (2005). Recording provenance in service-oriented architectures. (link checked 01.08.2008).
14. Hamidzadeh B., Atif Y., and Ramamritham K. To schedule or to execute: Decision support and performance implications. Real-Time Systems 16 2-3 (1999) 281-313
15. Han Y., Jiang C., Fu Y., and Luo X. Resource scheduling algorithms for grid computing and its modeling and analysis using petri net. GCC 2 (2003) 73-80
16. Haynos, M. (2004). Perspectives on grid: Grid computing - Next-generation distributed computing. (link checked 01.08.2008).
17. Ilavarasan, E., Thambidurai, P., & Mahilmannan, R. (2005). Performance effective task scheduling algorithm for heterogeneous computing system. In Proceedings of the fourth international symposium on parallel and distributed computing (ISPDC 2005) (pp. 28-38).
18. Khokhar A.A., Prasanna V.K., Shaaban M.E., and Wang C.L. Heterogeneous computing: Challenges and opportunities. IEEE Computer 26 6 (1993) 18-27
19. Kim H.D., and Kim J.S. An online scheduling algorithm for grid computing systems. GCC 2 (2003) 34-39
20. Maheswaran M., Ali S., Siegel H.J., Hensgen D., and Freund R.F. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing 59 2 (1999) 107-131
21. Pinedo M., and Chao X. Operations scheduling with applications in manufacturing and services. (pp. 12-36) (1999), McGraw-Hill Companies Inc.
22. Ritchie, G., & Levine, J. (2003). A fast, effective local search for scheduling independent jobs in heterogeneous computing environments. In Proceedings of the 22nd workshop of the uk planning and scheduling special interest group (PLANSIG 2003) (pp. 178-183).
23. Srisan, E., & Uthayopas, P. (2002). Heuristic scheduling with partial knowledge under gird environment. In Proceedings of the second international symposium on communications and information technology (ISCIT 2002).
24. Sun Microsystems Inc. (2006). World's first utility grid comes alive on the internet - The network is the computer. (link checked 01.08.2008).
25. The Open Grid Forum (OGF). (2002). (link checked 01.08.2008).
26. Wu, M. Y., & Shu, W. (2001). A high-performance mapping algorithm for heterogeneous computing systems. In Proceedings of the 15th international parallel and distributed processing symposium (IPDPS 2001) (p. 10074a).