Skip to content
Research Article Open access CC BY 4.0

Parallel Scheduling of Grid Jobs on Quadcore Systems using Grouping Methods

Goodhead T. Abraham, Evans F. Osaisai, Nicholas S. Dienagha

Asian Journal of Research in Computer Science · pp. 21–34 · Published 17 May 2021

10.9734/ajrcos/2021/v8i430207

Abstract

As Grid computing continues to make inroads into different spheres of our lives and multicore computers become ubiquitous, the need to leverage the gains of multicore computers for the scheduling of Grid jobs becomes a necessity. Most Grid schedulers remain sequential in nature and are inadequate in meeting up with the growing data and processing need of the Grid. Also, the leakage of Moore’s dividend continues as most computing platforms still depend on the underlying hardware for increased performance. Leveraging the Grid for the data challenge of the future requires a shift away from the traditional sequential method. This work extends the work of [1] on a quadcore system. A random method was used to group machines and the total processing power of machines in each group was computed, a size proportional to speed method is then used to estimates the size of jobs for allocation to machine groups. The MinMin scheduling algorithm was implemented within the groups to schedule a range of jobs while varying the number of groups and threads. The experiment was executed on a single processor system and on a quadcore system. Significant improvement was achieved using the group method on the quadcore system compared to the ordinary MinMin on the quadcore. We also find significant performance improvement with increasing groups. Thirdly, we find that the MinMin algorithm also gained marginally from the quadcore system meaning that it is also scalable.

Quadcore multicore-environment parallel scheduling multi-scheduling machine grouping job grouping

References (16)

  1. 1 Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems [DOI]
  2. 2 Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors [DOI]
  3. 3 Load balancing in cloud computing: A big picture [DOI]
  4. 4 An improved genetic algorithm using greedy strategy toward task scheduling optimization in cloud environments [DOI]
  5. 5 High performance computing using MPI and OpenMP on multi-core parallel systems [DOI]
  6. 6 EXOCHI [DOI]
  7. 7 A dynamic job grouping-based scheduling for deploying applications with fine-grained tasks on global grids
  8. 8 Multi objective task scheduling algorithm based on SLA and processing time suitable for cloud environment [DOI]
  9. 9 On Advantages of Grid Computing for Parallel Job Scheduling [DOI]
  10. 10 Spending Moore's dividend [DOI]
  11. 11 GPU implementation of a parallel two‐list algorithm for the subset‐sum problem [DOI]
  12. 12 Grouping-Based Job Scheduling Model In Grid Computing [DOI]
  13. 13 Parallel Implementation of a Machine Learning Algorithm on GPU [DOI]
  14. 14 Estimating job execution time and handling missing job requirements using rough set in grid scheduling [DOI]
  15. 15 The Next Fifty Years of Software
  16. 16 Validity of the single processor approach to achieving large scale computing capabilities [DOI]

Cited by 1

1 citation reported by external sources — individual citing-article records aren't available to list yet.

Article metrics

Real usage data collected on this platform.

6

Page views

0

PDF downloads

0

Outbound clicks

1

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.