Example: dental hygienist

MODERN OPERATING SYSTEMS - pub.ro

MODERN . OPERATING SYSTEMS . THIRD EDITION. Other bestselling titles by Andrew S. Tanenbaum Structured Computer Organization, 5th edition This widely read classic, now in its fifth edition, provides the ideal introduction to computer architecture. It covers the topic in an easy-to-understand way, bottom up. There is a chapter on digital logic for beginners, followed by chapters on microarchitecture, the instruction set architecture level, OPERATING SYSTEMS , assem- bly language, and parallel computer architectures. THIRD EDITION. Computer Networks, 4th edition This best seller, currently in its fourth edition, provides the ideal introduction to today's and tomorrow's networks. It explains in detail how MODERN networks are structured. Starting with the physical layer and working up to the application layer, the book covers a vast number of important topics, including wireless com- munication, fiber optics, data link protocols, Ethernet, routing algorithms, network performance, security, DNS, electronic mail, the World Wide Web, and mul- timedia.

3.7.3 Segmentation with Paging: The Intel Pentium 240 3.8 RESEARCH ON MEMORY MANAGEMENT 245 3.9 SUMMARY 246 4 FILE SYSTEMS 4.1 FILES 255 4.1.1 Fit.- W-ming 255 4.1.2 Figgcture 257 4.1.3 Fii^^ws 258 4.1.4 File Access 260 4.1.5 File Attributes 261

Tags:

  Intel, Uipment, Intel pentium

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Transcription of MODERN OPERATING SYSTEMS - pub.ro

1 MODERN . OPERATING SYSTEMS . THIRD EDITION. Other bestselling titles by Andrew S. Tanenbaum Structured Computer Organization, 5th edition This widely read classic, now in its fifth edition, provides the ideal introduction to computer architecture. It covers the topic in an easy-to-understand way, bottom up. There is a chapter on digital logic for beginners, followed by chapters on microarchitecture, the instruction set architecture level, OPERATING SYSTEMS , assem- bly language, and parallel computer architectures. THIRD EDITION. Computer Networks, 4th edition This best seller, currently in its fourth edition, provides the ideal introduction to today's and tomorrow's networks. It explains in detail how MODERN networks are structured. Starting with the physical layer and working up to the application layer, the book covers a vast number of important topics, including wireless com- munication, fiber optics, data link protocols, Ethernet, routing algorithms, network performance, security, DNS, electronic mail, the World Wide Web, and mul- timedia.

2 The book has especially thorough coverage of TCP/IP and the Internet. OPERATING SYSTEMS : Design and Implementation, 3rd edition This popular text on OPERATING SYSTEMS is the only book covering both the princi- ples of OPERATING SYSTEMS and their application to a real system. All the traditional OPERATING SYSTEMS topics are covered in detail. In addition, the principles are care- fully illustrated with MINIX, a free POSIX-based UNIX-like OPERATING system for Vrije Universiteit personal computers. Each book contains a free CD-ROM containing the complete MINIX system, including all the source code. The source code is listed in an Amsterdam, The Netherlands appendix to the book and explained in detail in the text. Distributed OPERATING SYSTEMS , 2nd edition This text covers the fundamental concepts of distributed OPERATING SYSTEMS . Key topics include communication and synchronization, processes and processors, dis- tributed shared memory, distributed file SYSTEMS , and distributed real-time sys- tems.

3 The principles are illustrated using four chapter-long examples: distributed object-based SYSTEMS , distributed file SYSTEMS , distributed Web-based SYSTEMS , PEARSON |. and distributed coordination-based SYSTEMS . PEARSON EDUCATION INTERNATIONAL. If you purchased this book within the United States or Canada you should be aware that it has been wrongfully imported without the approval of the Publisher or the Author. Editorial Director, Computer Science, Engineering, and Advanced Mathematics: Mania J. Ho/ton Executive Editor: Tracy Dimkelberger Editorial Assistant: Melinda Haggerty Associate Editor: ReeAnne Davies Senior Managing Editor Scot! Disauno Production Editor: Irwin Zucker Interior design: Andrew S. Tanenbaton Typesetting: Andrew S. Tanenbaum Art Director: Kenny Beck Art Editor Gregory Dulles Media Editor: David Alick Manufacturing Manager: Alan Fischer Manufacturing Buyer: Lisa McDowell Marketing Manager: Mack Patterson To Suzanne, Barbara, Marvin, and the memory of Brant and Sweetie %.

4 PEARSON 2009 Pearson Education, Inc. Pearson Prentice Hall Pearson Education, Inc. Upper Saddle River, NJ 07458. Ail rights reserved. No part of this book may be reproduced in any form or by any means, without permission in writing from the publisher. Pearson Prentice Hail is a trademark of Pearson Education, Inc. The author and publisher of this book have used their best efforts in preparing this book. These efforts include the development, research, and testing of the theories and programs to determine their effectiveness. The author and publisher make no warranty of any kind, expressed or implied, with regard to these programs or the documentation contained in this book. The author and publisher shall not be liable in any event for incidental or consequential damages in connection with, or arising out of, the furnishing, performance, or use of these programs. Printed in the United States of America 10 9 8 7 6 5 4 3 21. ISBN Q-lB-filBMST-L. Pearson Education Ltd., London Pearson Education Australia Pty.

5 Ltd., Sydney Pearson Education Singapore, Pte. Ltd. Pearson Education North Asia Ltd., Hong Kong Pearson Education Canada, Inc., Toronto Pearson Educacidn de Mexico, de Pearson Education Japan, Tokyo Pearson Education Malaysia, Pte. Ltd. Pearson Education, Inc., Upper Saddle River, New Jersey CONTENT!3. PREFACE xxiv 1 INTRODUCTION 1. WHAT IS AN OPERATING SYSTEM? 3. The OPERATING System as an Extended Machine 4. The OPERATING System as a Resource Manager 6. HISTORY OF OPERATING SYSTEMS 7. The First Generation (1945-55) Vacuum Tubes 7. The Second Generation (1955-65) Transistors and Batch SYSTEMS 8. The Third Generation (1965-1980) ICs and Multiprogramming 10. The Fourth Generation (1980-Present) Personal Computers 13. COMPUTER HARDWARE REVIEW 17. Processors 17. Memory 21. Disks 24. Tapes 25. I/O Devices 25. Buses 28. Booting the Computer 31. vii viii CONTENTS CONTENTS. THE OPERATING SYSTEM ZOO 31 OUTLINE OF THE REST OF THIS BOOK 75. Mainframe OPERATING SYSTEMS 32. Server OPERATING SYSTEMS 32 METRIC UNITS 76.

6 Multiprocessor OPERATING SYSTEMS 32. Personal Computer OPERATING SYSTEMS 33 SUMMARY 77. Handheld Computer OPERATING SYSTEMS 33. Embedded OPERATING SYSTEMS . 33. Sensor Node OPERATING SYSTEMS 34. Real-Time OPERATING SYSTEMS 34. Smart Card OPERATING SYSTEMS 35. 2 PROCESSES AND THREADS. OPERATING SYSTEM CONCEPTS 35. Processes 36 PROCESSES 81. Address Spaces 38 The Process Model 82. Files 38 Process Creation 84. Input/Output 41 Process Termination 86. Protection 42 Process Hierarchies 87. The Shell 42 Process States 88. Ontogeny Recapitulates Phylogeny 44 Implementation of Processes 89. Modeling Multiprogramming 91. SYSTEM CALLS 47. System Calls for Process Management 50 THREADS 93. System Calls for File Management 54 Thread Usage 93. System Calls for Directory Management 55 The Classical Thread Model 98. Miscellaneous System Calls 56 POSIX Threads 102. The Windows Win32 API 57 Implementing Threads in User Space 104. Implementing Threads in the Kernel 107. OPERATING SYSTEM STRUCTURE 60 Hybrid Implementations 108.

7 Monolithic SYSTEMS 60 Scheduler Activations 109. Layered SYSTEMS 61 Pop-Up Threads 110. Microkernels 62 Making Single-Threaded Code Multithreaded 112. Client-Server Model 65. Virtual Machines 65 INTERPROCESS COMMUNICATION 115. Exokeraels 69 Race Conditions 115. Critical Regions 117. THE WORLD ACCORDING TO C 70 Mutual Exclusion with Busy Waiting 118. The C Language 70 Sleep and Wakeup 123. Header Files 71 Semaphores 126. Large Programming Projects 72 Mutexes 128. The Model of Run Time 73 Monitors 132. Message Passing 138. RESEARCH ON OPERATING SYSTEMS 74 Barriers 142. CONTENTS CONTENTS. X. SCHEDULING 143 The WSClock Page Replacement Algorithm 211. Introduction to Scheduling 143 Summary of Page Replacement Algorithms 213. Scheduling in Batch SYSTEMS 150. Scheduling in Interactive SYSTEMS 152 DESIGN ISSUES FOR PAGING SYSTEMS 214. Scheduling in Real-Time SYSTEMS 158 Local versus Global Allocation Policies 214. Policy versus Mechanism 159 Load Control 216. Thread Scheduling 160 Page Size 217.

8 Separate Instruction and Data Spaces 219. CLASSICAL IPC PROBLEMS 161 Shared Pages 219. The Dining Philosophers Problem 162 Shared Libraries 221. The Readers and Writers Problem 165 Mapped Files 223. Cleaning Policy 224. RESEARCH ON PROCESSES AND THREADS 166 Virtual Memory Interface 224. SUMMARY 167 IMPLEMENTATION ISSUES 225. OPERATING System Involvement with Paging 225. Page Fault Handling 226. Instruction Backup 227. 3 MEMORY MANAGEMENT 173 Locking Pages in Memory 228. Backing Store 229. NO MEMORY ABSTRACTION 174 Separation of Policy and Mechanism 231. A MEMORY ABSTRACTION: ADDRESS SPACES 177 SEGMENTATION 232. The Notion of an Address Space 178 Implementation of Pure Segmentation 235. Swapping 179 Segmentation with Paging: MULTICS 236. Managing Free Memory 182 Segmentation with Paging: The intel Pentium 240. VIRTUAL MEMORY 186 RESEARCH ON MEMORY MANAGEMENT 245. Paging 187. Page Tables 191 SUMMARY 246. Speeding Up Paging 192. Page Tables for Large Memories 196. PAGE REPLACEMENT ALGORITHMS 199.

9 The Optimal Page Replacement Algorithm 200. 4 FILE S Y S T E M S. The Not Recently Used Page Replacement Algorithm 201. The First-In, First-Out (FIFO) Page Replacement Algorithm 202 FILES 255. The Second-Chance Page Replacement Algorithm 202 W-ming 255. The Clock Page Replacement Algorithm 203 F i g g c t u r e 257. The Least Recently Used (LRU) Page Replacement Algorithm 204 F i i ^ ^ w s 258. Simulating LRU in Software 205 File Access 260. The Working Set Page Replacement Algorithm 207 File Attributes 261. xii CONTENTS CONTENTS. File Operations 262 Memory-Mapped I/O 330. An Example Program Using File System Calls 263 Direct Memory Access (DMA) 334. Interrupts Revisited 337. DIRECTORIES 266. Single-Level Directory SYSTEMS 266 PRINCIPLES OF I/O SOFTWARE 341. Hierarchical Directory SYSTEMS 266 Goals of the I/O Software 341. Path Names 267 Programmed I/O 342. Directory Operations 270 Interrupt-Driven I/O 344. I/O Using DMA 345. FILE SYSTEM IMPLEMENTATION 271. File System Layout 271 I/O SOFTWARE LAYERS 346.

10 Implementing Files 272 Interrupt Handlers 346. Implementing Directories 278 Device Drivers 347. Shared Files 281 Device-Independent I/O Software 351. Log-Structured File SYSTEMS 283 User-Space I/O Software 357. Journaling File SYSTEMS 285. Virtual File SYSTEMS 286 DISKS 358. Disk Hardware 359. FILE SYSTEM MANAGEMENT AND OPTIMIZATION 290 Disk Formatting 374. Disk Space Management 290 Disk Arm Scheduling Algorithms 377. File System Backups 296 Error Handling 380. File System Consistency 302 Stable Storage 383. File System Performance 305. Defragmenting Disks 309 CLOCKS 386. Clock Hardware 386. EXAMPLE FILE SYSTEMS 310 Clock Software 388. CD-ROM File SYSTEMS 310 Soft Timers 391. The MS-DOS File System 316. The UNIX V7 File System 319 USER INTERFACES: KEYBOARD, MOUSE, MONITOR 392. Input Software 392. RESEARCH ON FILE SYSTEMS 322 Output Software 397. SUMMARY 322 THIN CLIENTS 413. POWER MANAGEMENT 415. Hardware Issues 416. 5 INPUT/OUTPUT OPERATING System Issues 417. Application Program Issues 422.


Related search queries