Tsichritzis / Bernstein / Rheinboldt Operating Systems

1. Auflage 2014
ISBN: 978-1-4832-6858-3
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 318 Seiten, Web PDF

Operating Systems deals with the fundamental concepts and principles that govern the behavior of operating systems. Many issues regarding the structure of operating systems, including the problems of managing processes, processors, and memory, are examined. Various aspects of operating systems are also discussed, from input-output and files to security, protection, reliability, design methods, performance evaluation, and implementation methods. Comprised of 10 chapters, this volume begins with an overview of what constitutes an operating system, followed by a discussion on the definition and properties of the basic unit of computation within an operating system, the process. The reader is then introduced to processor allocation schemes as well as various classes of scheduling disciplines and their implementations; memory management functions; and virtual memory. Subsequent chapters focus on input-output and files; protection in an operating system; and design and implementation of an operating system. The book concludes by describing two operating systems to help the reader visualize how the major components of a system interact in a complete system: the Venus Operating System developed by MITRE Corp. and the SUE nucleus, designed at the University of Toronto. This monograph is intended for fourth-year undergraduates and first-year graduate students, as well as lecturers who plans to institute a course on operating systems.

Autoren/Hrsg.

Tsichritzis, Dionysios C.

Bernstein, Philip A.

Rheinboldt, Werner

Inhaltsverzeichnis

1;Front Cover;1
2;Operating Systems;4
3;Copyright Page;5
4;Table of Contents;6
5;Preface;10
6;Acknowledgments;14
7;Notes to the Instructor;16
8;PART I: PRINCIPLES;20
8.1;Chapter 1. Operating System Functions and Concepts;22
8.1.1;1.1 Introduction;22
8.1.2;1.2 Operating Systems;27
8.1.3;1.3 Resource Allocation;29
8.1.4;1.4 The Supervisor;33
8.1.5;1.5 Conclusion;36
8.1.6;Problems;36
8.2;Chapter 2. Processes;38
8.2.1;2.1 Introduction;38
8.2.2;2.2 Process Definition;40
8.2.3;2.3 Process Implementation;42
8.2.4;2.4 Process Communication;45
8.2.5;2.5 Low-Level Synchronization Primitives;49
8.2.6;2.6 High-Level Synchronization Primitives;57
8.2.7;2.7 Deadlocks;64
8.2.8;Problems;68
8.3;Chapter 3. Processor Allocation;71
8.3.1;3.1 Introduction;71
8.3.2;3.2 Multiprogramming;73
8.3.3;3.3 Multiprogramming Scheduling Methods;75
8.3.4;3.4 Multilevel Scheduling;83
8.3.5;3.5 Final Remarks;85
8.3.6;Problems;86
8.4;Chapter 4. Memory Management;88
8.4.1;4.1 Memory Management Functions;88
8.4.2;4.2 Linking Methods;91
8.4.3;4.3 Storage Allocation;93
8.4.4;4.4 Overlaying;95
8.4.5;4.5 Job Swapping;97
8.4.6;4.6 Segmentation;99
8.4.7;4.7 Paging;103
8.4.8;4.8 Segmentation with Paging;107
8.4.9;4.9 Linking Using Segmentation with Paging;110
8.4.10;Problems;113
8.5;Chapter 5. Virtual Memory;115
8.5.1;5.1 Introduction;115
8.5.2;5.2 Hardware Devices for Virtual Memory;116
8.5.3;5.3 Allocation Strategies in Segmentation and Paging;119
8.5.4;5.4 Analysis of Paging Systems;128
8.5.5;5.5 Final Remarks;136
8.5.6;Problems;136
9;PART II: TECHNIQUES;140
9.1;Chapter 6. I/O and Files;142
9.1.1;6.1 Introduction;142
9.1.2;6.2 I/O System;148
9.1.3;6.3 Basic File System;151
9.1.4;6.4 Logical File System;153
9.1.5;6.5 Access Methods;156
9.1.6;6.6 Data Base Management Systems;159
9.1.7;6.7 Example of a Simple File System;160
9.1.8;6.8 Conclusion;163
9.1.9;Problems;164
9.2;Chapter 7. Protection;167
9.2.1;7.1 Introduction;167
9.2.2;7.2 Domains and Capabilities;170
9.2.3;7.3 Describing the Protection Status;172
9.2.4;7.4 Protection Implementation;174
9.2.5;7.5 Capability Passing and Format;177
9.2.6;7.6 Security;180
9.2.7;7.7 Conclusion;185
9.2.8;Problems;185
9.3;Chapter 8. Design;188
9.3.1;8.1 Introduction;188
9.3.2;8.2 Design Methodology;189
9.3.3;8.3 A Design Approach;202
9.3.4;8.4 Project Management;205
9.3.5;8.5 Concluding Remarks;208
9.3.6;Problems;209
9.4;Chapter 9. Implementation;211
9.4.1;9.1 Introduction;211
9.4.2;9.2 Choice of Implementation Language;213
9.4.3;9.3 Program Engineering;216
9.4.4;9.4 Program Verification;221
9.4.5;9.5 Performance Evaluation;227
9.4.6;9.6 Conclusion;236
9.4.7;Problems;237
9.5;Chapter 10. Examples of Systems;239
9.5.1;10.1 Introduction;239
9.5.2;10.2 The SUE System;240
9.5.3;10.3 The Venus Operating System;251
9.5.4;10.4 Other Systems;258
9.5.5;Problems;259
10;Appendix I: Data Structures;260
10.1;I.1 Definition of Terms;260
10.2;I.2 Sequential Allocation of Lists;261
10.3;I.3 Linked Lists;262
10.4;I.4 Management of Linked Lists;263
10.5;I.5 Stacks;265
10.6;I.6 Queues;266
10.7;I.7 Dequeues;266
10.8;I.8 Tables;267
11;Appendix II: Computational Structures;268
11.1;II.1 Introduction;268
11.2;II.2 Petri Nets;268
11.3;II.3 Computational Schemata;272
11.4;II.4 A Model for the Deadlock Problem;278
11.5;II.5 Conclusion;280
12;Appendix III: A Toy Operating System;281
12.1;III.1 Introduction;281
12.2;III.2 Simulated Hardware;282
12.3;III.3 The Toy Operating System;283
12.4;III.4 Conclusion;284
13;Annotated References;286
14;Index;308