System calls and interrupt vectors in an operating systems course
Pages 53 - 57
Abstract
The introductory operating systems course has a tendency to appear to the student as a disparate collection of topics such as synchronization primitives, process scheduling algorithms, and page replacement policies. We describe a sequence of material to cover early in the operating systems course that prevents this tendency by clarifying the goal of the course and by providing a framework for understanding how the later course material is used in kernel design. The material centers around two concepts. First is the importance of the abstraction provided by the system call interface, that the kernel is the implementation of that interface, and the analogy with the instruction set interface the student has already encountered. Second is how the interrupt vector mechanism in a broad sense is central to how the kernel functions and underpins the actual implementation of many of the other topics in the course. Illustration through code from a real operating system kernel is a key feature of how this sequence makes clear the workings of an operating system.
References
[1]
Ramakrishnan, S. and Lancaster, AM. Operating System Projects: Linking Theory, Practice, and Use. Proc. of the 24th SIGCSE Tech. Symp. 24, 1 (Feb 1993).
[2]
Silberschatz, A. and Galvin, P.B. Operating System Concepts, Fourth Edition. Addison-Wesley, Reading, MA, 1994.
[3]
Tanenbaum, A. Operating Systems: Design and Implementation. Prentice-Hall, Englewood Cliffs, NJ, 1987.
[4]
Tanenbatun, A. Modern Operating Systems. Prentice- Hall, Englewood Cliffs, NJ, 1992.
Index Terms
- System calls and interrupt vectors in an operating systems course
Recommendations
System calls and interrupt vectors in an operating systems course
SIGCSE '97: Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science educationThe introductory operating systems course has a tendency to appear to the student as a disparate collection of topics such as synchronization primitives, process scheduling algorithms, and page replacement policies. We describe a sequence of material to ...
Comments
Information & Contributors
Information
Published In
- March 1997410 pagesISBN:0897918894DOI:10.1145/268084
- Chairmen:
- Curt M. White,
- Carl Erickson,
- Bruce Klein,
- Editor:
- James E. Miller
Copyright © 1997 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 1997
Published in SIGCSE Volume 29, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations4Total Citations
- 939Total Downloads
- Downloads (Last 12 months)161
- Downloads (Last 6 weeks)32
Reflects downloads up to 20 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in