Abstract
The computing Grid has emerged as a platform to solve the complex and ever-increasing processing need of man and advances in computing technology have birthed the multicore era aimed for high throughput and efficient parallel computing. However, most systems still rely on the underlying hardware for parallelism despite the hard evidence that sequential algorithms do not optimally exploit parallel systems. This research seeks to harness the benefits of multicore systems using job and machine grouping methods to enhance parallelism in the scheduling of Grid jobs. The paper presents the result of two separate experiments on a method that parallelize scheduling algorithm on two multicore platforms. An arbitrary method was employed to group machines; a summation of the total processing power of machines in each group was made. To ensure load balancing, jobs were allocated to machine groups based on the ratio of the total processing power of the machines in each group. The MinMin Grid scheduling algorithm was implemented independently within the groups using a range of threads varied in powers of two. Also, the numbers of groups were varied between 2, 4, and 8. The same experiment was executed on a single processor computer; a duocore machine and a quadcore machine. A performance improvement of 16% to 85% was recorded by the group method against the best ordinary MinMin results and an improvement of 50% to 84% was recorded by the group method against the ordinary MinMin on corresponding machines. We prove that an increase in the number of groups results in improved performance on corresponding machines (approximately 2 times using 2 groups, approximately 3 times using four groups, and approximately 6 times using 8 groups). And most importantly, we established that as the number of processors increases, the grouping method makes more significant improvements over the ordinary MinMin scheduling algorithm executed on the multicore systems.
Highlights
The advent of Grid computing has been acclaimed as the paradigm to solve the ever-increasing computing need of an ever-demanding world while multicore systems have been heralded as the major architecture choice for modern computing platforms - this is anticipated to remain so for long [1, 2] and [3]
SingleCPU or SingleProc, 1CPU or 1Proc refer to result obtained on the single processor machine; duocore refers to results from the duocore machine while Quadcore refers to results obtained on the quadcore machine
The Quadcore machine improved performance 1.6 times or 38% over the duocore machine. These results show that the MinMin algorithm is scalable and gained immensely from the multicore system’s underlying parallelism
Summary
The advent of Grid computing has been acclaimed as the paradigm to solve the ever-increasing computing need of an ever-demanding world while multicore systems have been heralded as the major architecture choice for modern computing platforms - this is anticipated to remain so for long [1, 2] and [3]. It has been shown that sequential algorithms do not gain much from parallel systems if the algorithm is not Parallelized [4]. Current Grid scheduling algorithms are mostly sequential and do not exploit the inherent benefits in the underlying multicore systems, while most others focus on scheduling parallel jobs rather than scheduling jobs in parallel. Grid jobs without exploiting the underlying multicore hardware in this era of multicore systems poses a negative trend for the growth and purpose of the Grid. The method presented in this work provides a general means of Parallelization of sequential algorithms. The remainder of the paper is organized as follows: the section discusses related literature.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
