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.

DEVS OS (Discrete Even Visualization and Simulation Operating System)

2018 ◽  
Author(s):  
Adnan Hajar
Keyword(s):  
Operating System ◽  
Operating Systems ◽  
Scheduling Algorithm ◽  
The Novel ◽  
Priority Scheduling ◽  
First Come First Serve ◽  
Multiple Cycles ◽  
Visualization And Simulation ◽  
Traditional Approaches

The use of traditional approaches to teach Operating Systems usually lacks the visual aspect. The following research investigates the novel use of DEVS (Discrete Even Visualization and Simulation) in simulating the operation of an operating system. Cd boost++ was the framework of choice for this project. The simulation successfully mimicked the work of an operating system by simulating multiple cycles of program requests. This simulation is capable of further enhance the explanation of how an operating system works. The cases studied in this work include: 1- two processes running concurrently doing multiple IO’s, 2-four processes running concurrently based on a first come first serve scheduling algorithm, and 3- 20 processes running concurrently using highest priority scheduling algorithm. Output observation of the last case show promising results of successful use of DEVS and cd boost++ as a framework to build an operating system.

scholarly journals Development of café web-based system using priority scheduling approach

2018 ◽  
Vol 7 (2.15) ◽  
pp. 111
Author(s):  
Fatimah Ghazali ◽  
Rohana Ismail ◽  
Mohamad Hariz Hasni
Keyword(s):  
Scheduling Algorithm ◽  
Processing Unit ◽  
Priority Scheduling ◽  
Web Based ◽  
Preliminary Testing ◽  
A Priority ◽  
The Cost ◽  
Web Based System

Manual food ordering system requires on many employees to handle ordering process. It can be dull and disorganized, and can end up with data irregularity for generating sales report. Moreover, the total time taken for food preparations is longer.  Therefore, the café web based system is developed using priority scheduling algorithm to reduce the duration in ordering process, handling and preparing bulk and concurrent order, and at the same time minimizing the cost of handling employees. The priority scheduling algorithm is based on Control Processing Unit scheduling algorithm where it has a priority to execute tasks in waiting queue. The system is implemented at UniSZA’s café where it will be used by café owner and UniSZA students. This system is developed based on three-tier architecture. The JSP, JavaScript, Java and MySQL have been employed to improve manual ordering management. Initially, the preliminary testing shows that the priority scheduling algorithm has a potential to exchange the traditional ordering system. 

A Research on Dynamic Scheduling Algorithm of Real-Time Operating Systems on Uniprocessor

2011 ◽  
Vol 219-220 ◽  
pp. 40-44
Author(s):  
Kun Shang ◽  
Huan Ding
Keyword(s):  
Real Time ◽  
Operating Systems ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Priority Scheduling ◽  
The Real ◽  
Dynamic Priority ◽  
Important Measure

Real-Time operating systems not only request the logical correctness, but also request the correct computing results in a set time and the instant response to the real-time tasks. Therefore scheduling algorithms of real-time operating systems become an important measure to determine the real-time capability of a system. In this paper, we discuss the dynamic priority scheduling algorithm –Priority Inheritance Scheduling Algorithm. Then we analyze the algorithm from two aspects: description and schedulability.

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.

scholarly journals MOBILE-BASED OUTPATIENT QUEUE SYSTEM USING THE PRIORITY SCHEDULING AND FIRST COME FIRST SERVED SCHEDULING METHOD

2019 ◽  
Vol 11 (1) ◽  
pp. 54
Author(s):  
Anton - Setiawan ◽  
Dwi - Nugraheny ◽  
Saprudin -
Keyword(s):  
System Application ◽  
Scheduling Algorithm ◽  
Test Results ◽  
Priority Scheduling ◽  
Queue System ◽  
Online Test ◽  
Test Application ◽  
Scheduling Method ◽  
A Priority ◽  
Improve Health

The outpatient queue system at the Pratama Clinic still uses manuals so that it can implement computerized technology (mobile) to improve health services for patients. In making this outpatient queue system application using the Priority Scheduling method which is a priority scheduling algorithm. Each process is equipped with a priority number (the smallest integer value is usually the biggest priority). This outpatient queue system is mobile based with the aim that patients can register online. Test results using a comparison of smartphones from the Android 4.1 version of Jelly Bean to the Android 7.0 version of Nougat can run. Comparison of distances in applications with google maps, get the same results and test application users using a questionnaire that is calculated with a Likert Scale to get 81.8% results including the "Very Good" category.

Workflow scheduling algorithm based on load balance in grid

2011 ◽  
Vol 30 (12) ◽  
pp. 3184-3186
Author(s):  
Ming-quan WANG ◽  
Jiong YU ◽  
Yuan TIAN ◽  
Yun HAN
Keyword(s):  
Load Balance ◽  
Scheduling Algorithm ◽  
Workflow Scheduling
Sign in / Sign up

Export Citation Format

Share Document