Process Scheduling in Heterogeneous Multicore System using Agent based Graph Coloring Algorithm
G. Muneeswari1 , Antony Puthussery2

1Dr.G.Muneeswari, Department of Computer Science and Engineering, Faculty of Engineering, CHRIST (Deemed to be University), Bengaluru, India.
2Antony Puthussery, Department of Science and Humanities, CHRIST (Deemed to be University), Bengaluru, India. 

Manuscript received on 03 August 2019. | Revised Manuscript received on 09 August 2019. | Manuscript published on 30 September 2019. | PP: 8449-8452 | Volume-8 Issue-3 September 2019 | Retrieval Number: C6410098319/2019©BEIESP | DOI: 10.35940/ijrte.C6410.098319

Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: 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.
Keywords: Agent Based Graph Coloring, Processor Allocation, Heterogeneous Multicore System, Scheduling, Process Classification.

Scope of the Article: Classification