Open Access Open Access  Restricted Access Subscription Access

A Tutorial on Genetic Algorithm based Scheduling of Bag-of-Tasks on Heterogeneous Computing System


Affiliations
1 Department of Computer Science Aligarh Muslim University, Aligarh, India
 

.
User
Notifications
Font Size

  • M. M. Eshaghian, 1996, Heterogeneous Computing, Artech House, Norwood, MA.
  • R. F. Freund & H. J. Siegel, 1993, Heterogeneous Processing, IEEE Computer, 26(6), pp. 13-17.
  • K. Asanovic et al., 2006, The landscape of parallel computing research: A view from Berkeley, Technical Report UCB/EECS -2006183, EECS Department, University of California, Berkeley.
  • S. Crago et al., 2011, Heterogeneous Cloud Computing, IEEE International Conference on Cluster Computing, pp. 378 –385.
  • C. Reiss et al., 2012, Towards understanding heterogeneous clouds at scale: Google trace analysis, Techni cal Report ISTC-CC-TR-12101, Intel Science and Technology Centre for Cloud Computing.
  • E. Kenny et al., 2005, Heterogeneous grid computing: Issues and early benchmarks, International Conference on Computational Science, pp. 870–874.
  • K. Hwang, J. Dongarra, G. C. Fox, 2011, Distributed and Cloud Computing: From Parallel Processing to the Internet of Things, Morgan Kaufmann.
  • Leung JYT, Handbook of scheduling algorithms, models and performance analysis, New York, US, Chapman & Hall/CRC, 2004.
  • R. L. Graham et al., 1979, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5, pp. 287–326.
  • L. Linderoth& S. J. Wright, 2003, Decomposition algorithms for stochastic programming on a computational grid, Computational Optimization and Applications, 24, pp.207–250.
  • M.D. Beynon et al., 2001, Optimization for data intensive grid applications, Third Annual International Workshop on Active Middleware Services, pp.97–106.
  • S. Caballé et al., 2004, Towards a generic platform for developing CSCL applications using grid infrastructure, IEEE International Symposium on Cluster Computing and the Grid, pp. 20-207.
  • T. Braun et al., 2001, 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), pp. 810-837.
  • M. Maheswaran et al., 1999, Dynamic mapping of a class of independent tasks onto heterogeneous computing systems, Journal of Parallel and Distributed Computing, 59(2), pp. 107-131.
  • O. H. Ibarra & C. E. Kim, 1977, Heuristic algorithms for scheduling independent tasks on non-identical processors, Journal of the ACM, 24(2), pp. 280-289.
  • J.H. Holland, 1992, Genetic Algorithms, Scientific American, pp 66-72.
  • J. Kennedy & R. Eberhart, 1995, Particle swarm optimization, IEEE International Conference on Neural Networks, Piscataway, NJ , pp. 1942-1948.
  • L. Wang et al., 1997, Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach, Journal of Parallel and Distributed Computing, 47(1), pp. 8-22.
  • M. Sajid, Z. Raza, M. Shahid, Energy-efficient task scheduling algorithms for batch-of-tasks (BoT) applications on Heterogeneous Computing system, Concurrency and Computation: Practice and Experience, Vol. 28(9), pp. 2664-2669, 2016.

Abstract Views: 214

PDF Views: 0




  • A Tutorial on Genetic Algorithm based Scheduling of Bag-of-Tasks on Heterogeneous Computing System

Abstract Views: 214  |  PDF Views: 0

Authors

Mohammad Usaid
Department of Computer Science Aligarh Muslim University, Aligarh, India
Mohammad Sajid
Department of Computer Science Aligarh Muslim University, Aligarh, India

Abstract


.

References