Design and evaluation of tabu search method for job scheduling in distributed environments

IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

Volumn , Issue , 2008, Pages

  Xhafa, Fatos ^a   Carretero, Javier ^a   Alba, Enrique ^b   Dorronsoro, Bernabé ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF MÁLAGA   (Spain)

^c UNIVERSITY OF LUXEMBOURG   (Luxembourg)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW-TIME; JOB SCHEDULING; MAKESPAN;

BISMUTH PLATING; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; COMPUTER SYSTEMS; DATA DESCRIPTION; DISTRIBUTED PARAMETER NETWORKS; OPTIMIZATION; SCHEDULING; TABU SEARCH;

SCHEDULING ALGORITHMS;

EID: 51049088407     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2008.4536364     Document Type: Conference Paper

References (24)

1. The hebrew university parallel systems lab., parallel workload archive, http://www.cs.huji.ac.il/labs/parallel/workload/.
2. E. Alba, F. Almeida, M. Blesa, C. Cotta, M. Díaz, I. Dorta, J. Gabarró, C. León, G. Luque, J. Petit, C. Rodríguez, A. Rojas, and F. Xhafa. Efficient parallel LAN/WAN algorithms for optimization. the Mallba project. Parallel Computing, 32(5-6):415-440, 2006.
3. M. Blesa, L. Hernandez, and F. Xhafa. Tabu search for 0-1 multidimensional knapsack revisited: choosing internal heuristics and fine tuning of parameters. In 12th Young Operational Research Conference, 2001.
4. M. Blesa, L. Hernandez, and F. Xhafa. Parallel skeletons for tabu search method based on search strategies and neighborhood partition. In 4th International Conf. on Parallel Processing and Applied Mathematics (PPAM'01), volume 2328 of LNCS, pages 185-193. Springer, 2002.
5. M. Blesa, J. Petit, and F. Xhafa. Generic parallel implementations for tabu search. To appear, 2006.
6. H. Braun, T. D. Siegel, N. Beck, L. Bölöni, M. Maheswaran, A. Reuther, J. Robertson, M. Theys, and B. Yao. 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):810-837, 2001.
7. J. Carretero and F. Xhafa. Using genetic algorithms for scheduling jobs in large scale grid applications. Journal of Technological and Economic Development -A Research Journal of Vilnius Gediminas Technical University, 12(1):11-17, 2006.
8. H. Casanova and J. Dongarra. Netsolve: Network enabled solvers. IEEE Computational Science and Engineering, 5(3):57-67, 1998.
9. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for scheduling parameter sweep applications in grid environments. In Heterogeneous Computing Workshop, pages 349-363, 2000.
10. H. Casanova, G. Obertelli, F. Berman, and R. Wolski. The AppLeS parameter sweep template: user-level middleware for the grid. In Proc. of the 2000 ACM/IEEE Conf. on Supercomputing (CDROM), pages 75-76. IEEE Press, 2000.
11. I. Foster. What is the grid? A three point checklist. White Paper, 2002.
12. I. Foster and C. Kesselman. The Grid - Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, 1998.
13. I. Foster, C. Kesselman, and S. Tuecke. The anatomy of the grid: Enabling scalable virtual organizations. International Journal of Supercomputer Applications, 15(3):200-222, 2001.
14. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 5:533-549, 1986.
15. J. Goux and S. Leyffer. Solving large MINLPs on computational grids. Optimization and Engineering, 3:327-346, 2002.
16. S. Hotovy. Workload evolution on the Cornell theory center IBM SP2. In Job Scheduling Strategies for Parallel Proc. Workshop, IPPS'96, pages 27-40, 1996.
17. L. Linderoth and S. Wright. Decomposition algorithms for stochastic programming on a computational grid. Computational Optimization and Applications, 24:207-250, 2003.
18. F. Luna, A. Nebro, and E. Alba. Observations in using grid-enabled technologies for solving multi-objective optimization problems. Parallel Computing, 32:377-393, 2006.
19. G. Ritchie and J. Levine. A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments. In 23rd Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2004), 2004.
20. B. Srivastava. An affective heuristic for minimising makespan on unrelated parallel machines. Journal of the Op. Research Soc., 49(8):886-894, 1998.
21. E. Taillard. Robust Tabu Search for the Quadratic Assignment Problem. Parallel Computing, 17:443-455, 1991.
22. E.-G. Talbi and A. Zomaya. Grids for Bioinformatics and Computational Biology. John Wiley & Sons, USA, 2007.
23. A. Thesen. Design and evaluation of tabu search algorithms for multiprocessor scheduling. Journal Heuristics, 4(2):141-160, 1998.
24. S. Wright. Solving optimization problems on computational grids. Optima, 65, 2001.