Process scheduling in heterogeneous multicore system using agent based graph coloring algorithm

Title

Process scheduling in heterogeneous multicore system using agent based graph coloring algorithm

Creator

Muneeswari G.; Puthussery A.

Description

In any heterogeneous multicore system, there are numerous amount of processors with different platform and all the processing units are fabricated on a common single unit preferably on a System on Chip. As there is a tremendous amount of parallelism encompassed in a multicore system, proper utilization of the cores is a big challenge in the current era. Hence a more automated software approach is required like an agent based graph coloring algorithm to find the free processor and schedule the tasks on the respective cores. Predominantly the entire process of scheduling the tasks on multicore system is based on arrival time of process. This paper incorporates the scheduling on the linux 2.6.11 kernel and GEMS simulator for multicore implementation. The core utilization in this type of agent scheduling is 50% more than the existing scheduling mechanism. BEIESP.

Source

International Journal of Recent Technology and Engineering, Vol-8, No. 3, pp. 8449-8452.

Date

2019-01-01

Publisher

Blue Eyes Intelligence Engineering and Sciences Publication

Subject

Agent based graph coloring; Heterogeneous Multicore system; Process classification; Processor allocation; Scheduling

Coverage

Muneeswari G., Department of Computer Science and Engineering, Faculty of Engineering, CHRIST (Deemed to be University), Bengaluru, India; Puthussery A., Department of Science and Humanities, CHRIST (Deemed to be University), Bengaluru, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 22773878

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.35940/ijrte.C6410.098319

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85073531578&doi=10.35940%2fijrte.C6410.098319&partnerID=40&md5=f1feaf1b63960645932710deb0745695