Visualizing the CPU scheduler and page replacement algorithms

ABSTRACT

In this paper, we present two packages that simulate the multilevel feedback queue scheduling algorithm for a single CPU, and five page replacement algorithms that are used in the context of memory management. The paper gives a brief description of the interactive, self-paced packages and explains how we use them in Operating System courses. We also highlight the merits of the packages and the benefits to the students derived from our Java written simulations.

REFERENCES

• 1: Helen Custer, Inside Windows NT, Microcomputer Applications, Suisun City, CA, 1992
• 2: Lawrence, A., Badre, A., and Stasko, J. Empirically Evaluating the Use of Animations to Teach Algorithms. Technical Report GIT-G VU-94-07 (Georgia Institute of Technology, Atlanta, GA, 1994).
• 3: McGrory and Migliore, CS240A: Operating Systems, Class Notes, Stanford University, Winter 1991.
• 4: Thomas L. Naps, Algorithm visualization served off the World Wide Web: why and how, Proceedings of the 1st conference on Integrating technology into computer science education, p.66-71, June 02-06, 1996, Barcelona, Spain
• 5: Andrew S. Tanenbaum , Albert S. Woodhull, Operating systems (2nd ed.): design and implementation, Prentice-Hall, Inc., Upper Saddle River, NJ, 1997
• 6: Uresh Vahalia, UNIX internals: the new frontiers, Prentice Hall Press, Upper Saddle River, NJ, 1995

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Computer science education

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: Java
  D.4 OPERATING SYSTEMS

General Terms:
Algorithms, Languages