Paper Authors

Abstract

NOTE: The first page of text has been automatically extracted and included below in lieu of an abstract

Main Menu

Session 1520

A Comparison of Common Processor Scheduling Algorithms

Mohammad B. Dadfar, Michael Brachtl, Sub Ramakrishnan

Department of Computer Science Bowling Green State University Bowling Green, Ohio 43403 Phone: (419) 372 2337 fax: 419 372 8061 email: datacomm@cs.bgsu.edu

Abstract

This paper describes some projects given in an operating systems course that deal with processor scheduling in a multiprogramming environment. We use a Java program to simulate a number of CPU scheduling algorithms including first-come first-served, shortest process next, round robin, shortest remaining time next, highest response ratio next, and feedback queue. We describe a single processor system and explain different performance criteria including response time, turnaround time, throughput, and processor utilization. Students can use the simulator to study the impact of additional soft constraints such as deadlines on the performance of a given algorithm.

1. Introduction

Study of operating systems concepts is an important subject area for most undergraduate computer science programs. A course on operating systems covers a range of topics including processes, CPU scheduling, concurrency, file and memory management. Where possible, hands- on programming projects can be used to enhance the learning process and to gain additional insight into the topic. This paper concerns study of CPU scheduling algorithms in an operating systems course. There are many textbooks available for teaching operating systems courses1, 2, 3, 4. In the past few years we have used different textbooks including the Applied Operating System Concepts by Silberschatz, Galvin, and Gagne that uses Java to demonstrate different concepts.

Processor scheduling can be used to create a multiprogramming environment even with a single processor. There are many possible scheduling algorithms each having different characteristics. In general efficient scheduling algorithms attempt to maximize processor utilization. We describe some projects given in an operating systems course that deal with processor scheduling. The key to multiprogramming is processor and I/O scheduling. We use a Java program to simulate a number of CPU scheduling algorithms. The program can be parameterized to show the behavior of the algorithms and for visually displaying the results of the simulation. Some of the algorithms discussed in this paper are first-come first-served, shortest process next, round robin, shortest remaining time next, highest response ratio next, and feedback queue. The algorithms described

Proceedings of the 2002 American Society for Engineering Education Annual Conference & Exposition Copyright ã 2002, American Society for Engineering Education

Main Menu

• Citation

• Format
  • APA
  • APA - LaTeX bibitem
  • MLA
  • MLA - LaTeX bibitem
  • Bibtex
  • EndNote - RIS

Brachtl, M., & Ramakrishnan, S., & Dadfar, M. (2002, June), A Comparison Of Common Processor Scheduling Algorithms Paper presented at 2002 Annual Conference, Montreal, Canada. 10.18260/1-2--11224