scholarly journals CPU Scheduling Visualization

2014 ◽  
Vol 7 (1) ◽  
pp. 16-29
Author(s):  
Taqwa Flayyih Hasan

Scheduling is a key concept in computer multitasking and multiprocessing operating system design, and in real-time operating system design. CPU scheduling is the basis of multiprogramming operating systems by switching the CPU among process; the operating system can make the computer more productive, scheduling algorithms are widely used in communications networks and in operating systems to allocate resources to competing tasks. In this paper, visual interfaces for CPU scheduling algorithms were designed by using Visual Basic6 language. They may use to learn users about this algorithms and how they work

2021 ◽  
Vol 1 (2) ◽  
pp. 1-16
Author(s):  
Mohammed Y. Shakor ◽  

An operating system is software that is designed to manage computer hardware and software resources. However, this management requires applying an ample number of techniques and algorithms which are called synchronization and scheduling. The scheduling algorithms are used to arrange the way that the CPU is assigned to the processes, while synchronization is utilized to indicate how to work with multi-processes at the same time. Therefore, they are related to each other. CPU scheduling is a vital phenomenon of an operating system. At present, numerous CPU scheduling algorithms exist as First Come First Serve) FCFS(, Shortest Job First (SJF), Shortest Remaining Time First (SRTF), Priority Scheduling, and Round Robin (RR). In this paper, a survey of the current synchronization and scheduling algorithms have been presented. An overview of each technique with the main algorithms have been described in detail with the advantages and the issues of each algorithm. Furthermore, this paper has dug deep into the real-time operating system scheduling issues, which is the current trend in operating system researches.


Author(s):  
Sonia Zouaoui ◽  
Lotfi Boussaid ◽  
Abdellatif Mtibaa

<p>This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.</p>


Author(s):  
Massimo Violante ◽  
Gianpaolo Macario ◽  
Salvatore Campagna

Automotive infotainment applications are examples of embedded systems in which a heterogeneous software stack is used, which most likely comprises a real-time operating system, an automotive-grade Linux, and possibly Android. Thanks to the availability of modern systems-on-a-chip providing multicore computing platforms, architects have the possibility of integrating the entire software stack in a single chip. Embedded virtualization appears an interesting technology to achieve this goal, while providing the different operating systems the capability of exchanging data as well as optimizing resource usage. Although very well known in server-class systems, virtualization is rather new to the embedded domain; in order to leverage its benefits, it is therefore mandatory to understand its peculiarities and shortcomings. In this chapter, the authors illustrate the virtualization technologies with particular emphasis on hypervisors and Linux Containers. Moreover, they illustrate how those technologies can cooperate to fulfill the requirements on automotive infotainment applications. Finally, the authors report some experimental evidence of the performance overheads introduced when using embedded virtualization.


2010 ◽  
Vol 47 (2) ◽  
pp. 120-131 ◽  
Author(s):  
Janez Puhan ◽  
Árpád Bűrmen ◽  
Tadej Tuma ◽  
Iztok Fajfar

The paper discusses whether (and how) to teach assembly coding as opposed to (or in conjunction with) higher programming languages as part of a modern electrical engineering curriculum. We describe the example of a very simple cooperative embedded real-time operating system, first programmed in C and then in assembler. A few lines of C language code are compared with the slightly longer assembly code equivalent, and the advantages and drawbacks are discussed. The example affords students a much deeper understanding of computer architecture and operating systems. The course is linked to other courses in the curriculum, which all use the same hardware and software platform; this lowers prices, reduces overheads and encourages students to reuse parts of a written code in subsequent courses. A student learns that badly written and poorly documented code is very difficult to reuse.


Author(s):  
Tri Cong Phung

Controlling accurately the position and velocity of robots in a given time is an important requirement in the industry. The open-source real-time operating systems not only have more advantages than the normal operating systems in both economy and flexibility but also meet the needs. This paper concentrates on building algorithms for controlling the robot trajectory in time using a modern real-time operating system called Linux-Xenomai. Firstly, the paper analyzes several advantages of the real-time operating system Linux-Xenomai comparing general operating systems and other real-time operating systems. Secondly, a real-time controller of a 5 degree-of-freedom (DOF) robot is built based on the real-time operating system Linux-Xenomai. After that, the paper proposes algorithms to test the ability of working in time of the robot. Finally, the real experiments are done to verify the proposed algorithms.


Author(s):  
Frederick M. Proctor ◽  
Justin R. Hibbits

General-purpose computers are increasingly being used for serious control applications, due to their prevalence, low cost and high performance. Real-time operating systems are available for PCs that overcome the nondeterminism inherent in desktop operating systems. Depending on the timing requirements, however, many users can get by with a non-real-time operating system. This paper discusses timing techniques applicable to non-real-time operating systems, using Linux as an example, and compares them with the performance that can be obtained with true real-time OSes.


2014 ◽  
Vol 7 (3) ◽  
pp. 337-344
Author(s):  
Yue-hua Li ◽  
Xue Liu ◽  
Yun-feng Ding ◽  
Hao-xin Cui ◽  
Yong-bin Du ◽  
...  

Author(s):  
Amit K. Shukla ◽  
Rachit Sharma ◽  
Pranab K. Muhuri

A real-time operating system (RTOS) is an integral part of a real-time embedded system (RTES). Most of the RTESs work on dynamic environments, and hence, the computational cost of tasks cannot be calculated in advance. Thus, RTOSs play a significant role in the smooth operations of the RTES through efficient task scheduling schemes and resource managements. This article investigates the existing design challenges and scope of the modern RTOSs. A wide variety of latest RTOSs are discussed and elaborated in detail. A comparative study with their prospects has been explained so that interested readers can use the article as a readily available starting point for their further studies on this topic.


Sign in / Sign up

Export Citation Format

Share Document