• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.941-950
• /
• 2017

The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.165-170
• /
• 2023

Scheduling algorithms plays a significant role in optimizing the CPU in operating system. Each scheduling algorithms schedules the processes in the ready queue with its own algorithm design and its properties. In this paper, the performance analysis of First come First serve scheduling, Non preemptive scheduling, Preemptive scheduling, Shortest Job scheduling and Round Robin algorithm has been discussed with an example and the results has been analyzed with the performance parameters such as minimum waiting time, minimum turnaround time and Response time.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.19-26
• /
• 2021

CPU is considered the main and most important resource in the computer system. The CPU scheduling is defined as a procedure that determines which process will enter the CPU to be executed, and another process will be waiting for its turn to be performed. CPU management scheduling algorithms are the major service in the operating systems that fulfill the maximum utilization of the CPU. This article aims to review the studies on the CPU scheduling algorithms towards comparing which is the best algorithm. After we conducted a review of the Round Robin, Shortest Job First, First Come First Served, and Priority algorithms, we found that several researchers have suggested various ways to improve CPU optimization criteria through different algorithms to improve the waiting time, response time, and turnaround time but there is no algorithm is better in all criteria.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.1
• /
• pp.1-9
• /
• 2024

This paper proposes an integration of the ED-H scheduling algorithm, known for optimal real-time scheduling, with the LoRaEnergySim simulator. This integration facilitates the simulation of interactions between real-time scheduling algorithms for tasks with time constraints in Class-A LoRaWAN Class-A devices using a super-capacitor-based energy harvesting system. The time and energy characteristics of LoRaWAN status and state transitions are extracted in a log format, and the task model is structured to suit the time-slot-based ED-H scheduling algorithm. The algorithm is extended to perform tasks while satisfying time constraints based on CPU executions. To evaluate the proposed approach, the ED-H scheduling algorithm is executed on a set of tasks with varying time and energy characteristics and CPU occupancy rates ranging from 10% to 90%, under the same conditions as the LoRaEnergySim simulation results for packet transmission and reception. The experimental results confirmed the applicability of co-simulation by demonstrating that tasks are prioritized based on urgency without depleting the supercapacitor's energy to satisfy time constraints, depending on the scheduling algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.575-580
• /
• 2006

It is important matter that inflect well allocated frequency resource in cellular network and is still more serious element in environment that provide multimedia services. This paper describes model and algorithm that increase two elements that is frequency allocation and job scheduling that consider multimedia service traffic special quality by emphasis that do mapping present in CDMA cellular system. We proposed the model composed three parts (channel allocation algorithm, mapping algorithm and scheduling algorithm) and simulation results.

• Journal of Digital Convergence
• /
• v.12 no.3
• /
• pp.227-235
• /
• 2014

Mobile virtualization is an approach to mobile device management in which two virtual platforms are installed on a single wireless device. A smartphone, a single wireless device, might have one virtual environment for business use and one for personal use. Mobile virtualization might also allow one device to run two different operating systems, allowing the same phone to run both RTOS and Android apps. In this paper, we propose the techniques to virtualize the cores of a multicore, allowing the reassign any number of vCPUs that are exposed to a OS to any subset of the pCPUs. And then we also propose the real-time scheduling method to assigning the vCPUs to the pCPU. Suggested technology in this paper solves problem that increases time of real-time process when interrupt are handled, and is able more to fast processing than previous algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.835-842
• /
• 2012

Operating Systems is a discipline which handles abstract concepts and techniques. However, most of OS courses have been textbook-oriented theoretical classes. Theoretical classes lead to the decline in the understanding of a lecture, and hurt their concentration. Many instructors have tried to make use of educational tools to help students understand lectures and arouse interests. This paper describes the design and implementation of a CPU scheduling simulator which shows the operation of process scheduling algorithms visually. The academic achievement evaluation for 2010's students and 2011's and t-test results show that the differences of the correct answer ratio for the exam about CPU scheduling algorithms are meaningful. The survey shows that the simulator is useful as an educational tool which causes the interests and enhances the understanding of a lecture, this teaching method is effective to develop problem solving skills.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.511-520
• /
• 2007

Decay usage scheduling algorithm gives preference to processes that have consumed little CPU in the recent past. It has been widely-used in time-sharing systems such as UNIX, where CPU-intensive processes and interactive processes are mixed. However, there has been no sound understanding about the mixed effects of decay usage parameters on the service performance. This paper empirically analyzes their effects in terms of the resulting service bandwidth and delay Based on such empirical analysis, we derive the clear meaning of each parameter. Such analysis and understanding provides a basis of controlling decay usage parameters for desirable service provision as required by applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2003-2021
• /
• 2020

Today's computer systems are widely integrated with CPU and GPU to achieve considerable performance, but energy consumption of such system directly affects operational cost, maintainability and environmental problem, which has been aroused wide concern by researchers, computer architects, and developers. To cope with energy problem, we propose a task-scheduling framework to reduce energy under performance constraint by rationally allocating the tasks across the CPU and GPU. The framework first collects the estimated energy consumption of programs and performance information. Next, we use above information to formalize the scheduling problem as the 0-1 knapsack problem. Then, we elaborate our experiment on typical platform to verify proposed scheduling framework. The experimental results show that our proposed algorithm saves 14.97% energy compared with that of the time-oriented policy and yields 37.23% performance improvement than that of energy-oriented scheme on average.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1653-1659
• /
• 2015

Operating Systems is a discipline which handles abstract concepts and techniques. However, most of OS courses have been textbook-oriented theoretical classes. Theoretical classes lead to the decline in the understanding of a lecture and hurt their concentration. Many instructors have tried various ways to help students understand lectures and arouse interests. This paper describes the design and implementation of a web-based educational CPU scheduling simulator which enables learners to set up various situations and simulate scheduling processes using a web browser or a smart-phone. After utilizing the implemented simulator for the class, the survey result for 2014's students shows that it is useful as an educational tool which enhances the understanding of a lecture and develops their problem solving skills.