Priority-grouping method for parallel multi-scheduling in Grid》.pdf

Journal of Computer and System Sciences 81 (2015) 943–957 Contents lists available at ScienceDirect Journal of Computer and System Sciences /locate/jcss Priority-grouping method for parallel multi-scheduling in Grid Goodhead Tomvie Abraham ∗, Anne James, Norlaily Yaacob Distributed Systems and Modelling Group, Coventry University, Priory Street, Coventry, CV1 5FB, United Kingdom a r t i c l e i n f o a b s t r a c t Article history: This article presents a method of enhancing the efficiency of Grid scheduling algorithms by Received 3 July 2014 employing a job grouping method based on priorities and also grouping of Grid machines Received in revised form 20 September based on their configuration before implementing a suitable scheduling algorithm within 2014 paired groups. The Priority method is employed to group jobs into four groups, while Accepted 1 October 2014 Available online 30 December 2014 two different methods, SimilarTogether and EvenlyDistributed, are employed to group machines into four groups before implementing the MinMin Grid scheduling algorithm Keywords: simultaneously. Implementing the scheduling algorithms simultaneously within paired Grid computing groups (multi-scheduling) ensures a high degree of parallelism, increases throughput Scheduling