Multi-Core Processor Scheduling Algorithm under The Influence Of Process Variation

2018 ◽  
Author(s):  
Xiaohui Wei ◽  
Lishuang Su ◽  
Jingweijia Tan
Keyword(s):  
Process Variation ◽  
Scheduling Algorithm ◽  
Processor Scheduling ◽  
Multi Core Processor

Based on Improved Genetic Algorithm for Task Scheduling of Heterogeneous Multi-Core Processor

2014 ◽  
Vol 1030-1032 ◽  
pp. 1671-1675
Author(s):  
Yue Qiu ◽  
Jing Feng Zang
Keyword(s):  
Genetic Algorithm ◽  
Task Scheduling ◽  
Execution Time ◽  
Scheduling Algorithm ◽  
Experimental Results ◽  
Initial Population ◽  
Improved Genetic Algorithm ◽  
High Quality ◽  
Multi Core Processor ◽  
Better Than

This paper puts forward an improved genetic scheduling algorithm in order to improve the execution efficiency of task scheduling of the heterogeneous multi-core processor system and give full play to its performance. The attribute values and the high value of tasks were introduced to structure the initial population, randomly selected a method with the 50% probability to sort for task of individuals of the population, thus to get high quality initial population and ensured the diversity of the population. The experimental results have shown that the performance of the improved algorithm was better than that of the traditional genetic algorithm and the HEFT algorithm. The execution time of tasks was reduced.

Research and Implementation on Multi-Core Processor Task Scheduling Algorithm

2011 ◽  
Vol 58-60 ◽  
pp. 1732-1737
Author(s):  
Fu Zhao ◽  
Yong Ping Zhang
Keyword(s):  
Experimental Data ◽  
Task Scheduling ◽  
Load Balance ◽  
Scheduling Algorithm ◽  
Task Decomposition ◽  
Software Applications ◽  
Task Scheduling Algorithm ◽  
Multi Core Processor ◽  
A Current

This paper firstly proposes one of the problems software applications faced by in the era of multi-core CPU: task decomposition and scheduling, and then analyzes a current scheduling algorithm together with its shortcomings. On the basis, an optimized algorithm is given. The optimized algorithm reduces the error and improves the accuracy. It is easier to achieve the calculation load balance of multi-core CPU. Finally, a multi-core platform is build using Simics system simulator, and the optimized algorithm is tested on this platform. Experimental data proves the superiority of the algorithm.

A Parallel Scheduling Algorithm of Multi-Core Processor Based on Task Clustering and Duplication

2012 ◽  
Vol 546-547 ◽  
pp. 1421-1426
Author(s):  
Xiao Hui Ma
Keyword(s):  
Task Scheduling ◽  
Time Complexity ◽  
Scheduling Algorithm ◽  
Optimal Time ◽  
Parallel Scheduling ◽  
Task Load ◽  
Task Duplication ◽  
Multi Core Processor ◽  
Task Clustering

This thesis presents a parallel scheduling algorithm of multi-core processor based on task clustering and duplication. This algorithm, using the strategy of task clustering, gives priority to the operation of thread nodes of the same process on the same processor and effectively reduces time complexity of task scheduling. In order to avoid the unbalanced task load on the processors, it will employ their ultimate values to control the load. Finally, for achieving the optimal time of task operations, this algorithm, with the adoption of task duplication strategy, looks for the key tasks and duplicates them so as to fully utilize the resources of each core on the processor and improve the efficiency of task scheduling. The analysis of the experiment shows that, with the increasing number of task scheduling, the time of task operation of this algorithm is always the least.

Study and Simulation of CPU Priority Scheduling Algorithm on Multi-Core Processor Platform

2013 ◽  
Vol 694-697 ◽  
pp. 2540-2544
Author(s):  
Zi Guo Fan ◽  
Rong Liang Wang ◽  
Peng Hao Yang
Keyword(s):  
Operating Systems ◽  
Load Balance ◽  
Scheduling Algorithm ◽  
Priority Scheduling ◽  
Response Performance ◽  
The Mean ◽  
A Priority ◽  
Multi Core Processor ◽  
Priority Algorithm

Multi-core processor technology is getting more and more common for both business and private use. However, the operating systems and applications are not keeping the same pace with multi-core hardware. In the mean while, to get better performance, more factors need to be considered under multi-core platform, e.g. load balance, cache, task relationship, etc. This paper focuses on making full use of multi-core processor through scheduling the tasks to proper core with CPU priority Algorithm which calculates a priority of each core when scheduling a task. With CPU Priority, it is easier to take interesting factors into account and combine several factors together. We did our work based on a scheduler simulator implemented with Python and we observed that, with CPU priority scheduling algorithm, it does suggest a flexible way to schedule the CPU assignment and is able to gain some satisfactory improvement on the response performance according to our simulation.

Sign in / Sign up

Export Citation Format

Share Document