Modern operating systems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Upper Saddle River, NJ
Prentice-Hall
2001
|
| Ausgabe: | 2. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXIV, 951 S. graph. Darst. |
| ISBN: | 0130313580 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV013737058 | ||
| 003 | DE-604 | ||
| 005 | 20130321 | ||
| 007 | t | ||
| 008 | 010522s2001 d||| |||| 00||| eng d | ||
| 020 | |a 0130313580 |9 0-13-031358-0 | ||
| 035 | |a (OCoLC)45284637 | ||
| 035 | |a (DE-599)BVBBV013737058 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-29T |a DE-19 |a DE-20 |a DE-703 |a DE-M347 |a DE-858 |a DE-706 |a DE-525 | ||
| 050 | 0 | |a QA76.76.O63 | |
| 082 | 0 | |a 005.4/3 |2 21 | |
| 084 | |a ST 260 |0 (DE-625)143632: |2 rvk | ||
| 084 | |a DAT 400f |2 stub | ||
| 100 | 1 | |a Tanenbaum, Andrew S. |d 1944- |e Verfasser |0 (DE-588)120278979 |4 aut | |
| 245 | 1 | 0 | |a Modern operating systems |c Andrew S. Tanenbaum |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Upper Saddle River, NJ |b Prentice-Hall |c 2001 | |
| 300 | |a XXIV, 951 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 7 | |a Besturingssystemen |2 gtt | |
| 650 | 4 | |a İşletim sistemleri (Bilgisayarlar) | |
| 650 | 4 | |a Operating systems (Computers) | |
| 650 | 0 | 7 | |a Verteiltes Betriebssystem |0 (DE-588)4243910-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Betriebssystem |0 (DE-588)4006216-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Verteiltes Betriebssystem |0 (DE-588)4243910-3 |D s |
| 689 | 0 | 1 | |a Betriebssystem |0 (DE-588)4006216-8 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 689 | 1 | 0 | |a Verteiltes Betriebssystem |0 (DE-588)4243910-3 |D s |
| 689 | 1 | |5 DE-604 | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009389599&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009389599 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804128555533074432 |
|---|---|
| adam_text | MODERN OPERATING SYSTEMS SECOND EDITION ANDREW S. TANENBAUM VRIJE
UNIVERSITEIT AMSTERDAM, THE NETHERLANDS PRENTICE HALL PRENTICE HALL
UPPER SADDLE RIVER, NEW JERSEY 07458 CONTENTS PREFACE INTRODUCTION 1.1.
WHAT IS AN OPERATING SYSTEM? 3 1.1.1. THE OPERATING SYSTEM AS AN
EXTENDED MACHINE 1.1.2. THE OPERATING SYSTEM AS A RESOURCE MANAGER 1.2.
HISTORY OF OPERATING SYSTEMS 6 1.2.1. THE FIRST GENERATION (1945-55) 6
1.2.2. THE SECOND GENERATION (1955-65) 7 1.2.3. THE THIRD GENERATION
(1965-1980) 9 1.2.4. THE FOURTH GENERATION (1980-PRESENT) 13 1.2.5.
ONTOGENY RECAPITULATES PHYLOGENY 16 1.3. THE OPERATING SYSTEM ZOO 18
1.3.1. MAINFRAME OPERATING SYSTEMS 18 1.3.2. SERVER OPERATING SYSTEMS 19
1.3.3. MULTIPROCESSOR OPERATING SYSTEMS 19 1.3.4. PERSONAL COMPUTER
OPERATING SYSTEMS 19 1.3.5. REAL-TIME OPERATING SYSTEMS 19 1.3.6.
EMBEDDED OPERATING SYSTEMS 20 1.3.7. SMART CARD OPERATING SYSTEMS 20 VII
VIII CONTENTS 1.4. COMPUTER HARDWARE REVIEW 20 1.4.1. PROCESSORS 21
1.4.2. MEMORY 23 1.4.3. I/O DEVICES 28 1.4.4. BUSES 31 1.5. OPERATING
SYSTEM CONCEPTS 34 1.5.1. PROCESSES 34 1.5.2. DEADLOCKS 36 1.5.3. MEMORY
MANAGEMENT 37 1.5.4. INPUT/OUTPUT 38 1.5.5. FILES 38 1.5.6. SECURITY 41
1.5.7. THE SHELL 41 1.5.8. RECYCLING OF CONCEPTS 43 1.6. SYSTEM CALLS 44
1.6.1. SYSTEM CALLS FOR PROCESS MANAGEMENT 48 1.6.2. SYSTEM CALLS FOR
FILE MANAGEMENT 50 1.6.3. SYSTEM CALLS FOR DIRECTORY MANAGEMENT 51
1.6.4. MISCELLANEOUS SYSTEM CALLS 53 1.6.5. THE WINDOWS WIN32 API 53
1.7. OPERATING SYSTEM STRUCTURE 56 1.7.1. MONOLITHIC SYSTEMS 56 1.7.2.
LAYERED SYSTEMS 57 1.7.3. VIRTUAL MACHINES 59 1.7.4. EXOKERNELS 61
1.7.5. CLIENT-SERVER MODEL 61 1.8. RESEARCH ON OPERATING SYSTEMS 63 1.9.
OUTLINE OF THE REST OF THIS BOOK 65 1.10. METRIC UNITS 66 1.11. SUMMARY
67 CONTENTS PROCESSES AND THREADS 2.1. PROCESSES 71 2.1.1. THE PROCESS
MODEL 72 2.1.2. PROCESS CREATION 73 2.1.3. PROCESS TERMINATION 75 2.1.4.
PROCESS HIERARCHIES 76 2.1.5. PROCESS STATES 77 2.1.6. IMPLEMENTATION OF
PROCESSES 79 2.2. THREADS 81 2.2.1. THE THREAD MODEL 81 2.2.2. THREAD
USAGE 85 2.2.3. IMPLEMENTING THREADS IN USER SPACE 90 2.2.4.
IMPLEMENTING THREADS IN THE KERNEL 93 2.2.5. HYBRID IMPLEMENTATIONS 94
2.2.6. SCHEDULER ACTIVATIONS 94 2.2.7. POP-UP THREADS 96 2.2.8. MAKING
SINGLE-THREADED CODE MULTITHREADED 2.3. INTERPROCESS COMMUNICATION 100
2.3.1. RACE CONDITIONS 100 2.3.2. CRITICAL REGIONS 102 2.3.3. MUTUAL
EXCLUSION WITH BUSY WAITING 103 2.3.4. SLEEP AND WAKEUP 108 2.3.5.
SEMAPHORES 110 2.3.6. MUTEXES 113 2.3.7. MONITORS 115 2.3.8. MESSAGE
PASSING 119 2.3.9. BARRIERS 123 2.4. CLASSICAL IPC PROBLEMS 124 2.4.1.
THE DINING PHILOSOPHERS PROBLEM 125 2.4.2. THE READERS AND WRITERS
PROBLEM 128 2.4.3. THE SLEEPING BARBER PROBLEM 129 2.5. SCHEDULING 132
2.5.1. INTRODUCTION TO SCHEDULING 132 2.5.2. SCHEDULING IN BATCH SYSTEMS
138 2.5.3. SCHEDULING IN INTERACTIVE SYSTEMS 142 2.5.4. SCHEDULING IN
REAL-TIME SYSTEMS 148 2.5.5. POLICY VERSUS MECHANISM 149 2.5.6. THREAD
SCHEDULING 150 X CONTENTS 2.6. RESEARCH ON PROCESSES AND THREADS 151
2.7. SUMMARY 152 3 DEADLOCKS 159 3.1. RESOURCES 160 3.1.1. PREEMPTABLE
AND NONPREEMPTABLE RESOURCES 160 3.1.2. RESOURCE ACQUISITION 161 3.2.
INTRODUCTION TO DEADLOCKS 163 3.2.1. CONDITIONS FOR DEADLOCK 164 3.2.2.
DEADLOCK MODELING 164 3.3. THE OSTRICH ALGORITHM 167 3.4. DEADLOCK
DETECTION AND RECOVERY 168 3.4.1. DEADLOCK DETECTION WITH ONE RESOURCE
OF EACH TYPE 168 3.4.2. DEADLOCK DETECTION WITH MULTIPLE RESOURCE OF
EACH TYPE 171 3.4.3. RECOVERY FROM DEADLOCK 173 3.5. DEADLOCK AVOIDANCE
175 3.5.1. RESOURCE TRAJECTORIES 175 3.5.2. SAFE AND UNSAFE STATES 176
3.5.3. THE BANKER S ALGORITHM FOR A SINGLE RESOURCE 178 3.5.4. THE
BANKER S ALGORITHM FOR MULTIPLE RESOURCES 179 3.6. DEADLOCK PREVENTION
180 3.6.1. ATTACKING THE MUTUAL EXCLUSION CONDITION 180 3.6.2. ATTACKING
THE HOLD AND WAIT CONDITION 181 3.6.3. ATTACKING THE NO PREEMPTION
CONDITION 182 3.6.4. ATTACKING THE CIRCULAR WAIT CONDITION 182 3.7.
OTHER ISSUES 183 3.7.1. TWO-PHASE LOCKING 183 3.7.2. NONRESOURCE
DEADLOCKS 184 3.7.3. STARVATION 184 3.8. RESEARCH ON DEADLOCKS 185 3.9.
SUMMARY 185 CONTENTS MEMORY MANAGEMENT 4.1. BASIC MEMORY MANAGEMENT 190
4.1.1. MONOPROGRAMMING WITHOUT SWAPPING OR PAGING 190 4.1.2.
MULTIPROGRAMMING WITH FIXED PARTITIONS 191 4.1.3. MODELING
MULTIPROGRAMMING 192 4.1.4. ANALYSIS OF MULTIPROGRAMMING SYSTEM
PERFORMANCE 194 4.1.5. RELOCATION AND PROTECTION 194 4.2. SWAPPING 196
4.2.1. MEMORY MANAGEMENT WITH BITMAPS 199 4.2.2. MEMORY MANAGEMENT WITH
LINKED LISTS 200 4.3. VIRTUAL MEMORY 202 4.3.1. PAGING 202 4.3.2. PAGE
TABLES 205 4.3.3. TLBS*TRANSLATION LOOKASIDE BUFFERS 211 4.3.4. INVERTED
PAGE TABLES 213 4.4. PAGE REPLACEMENT ALGORITHMS 214 4.4.1. THE OPTIMAL
PAGE REPLACEMENT ALGORITHM 215 4.4.2. THE NOT RECENTLY USED PAGE
REPLACEMENT ALGORITHM 216 4.4.3. THE FIRST-IN, FIRST-OUT 217 4.4.4. THE
SECOND CHANCE PAGE REPLACEMENT ALGORITHM 217 4.4.5. THE CLOCK PAGE
REPLACEMENT ALGORITHM 218 4.4.6. THE LEAST RECENTLY USED 218 4.4.7.
SIMULATING LRU IN SOFTWARE 220 4.4.8. THE WORKING SET PAGE REPLACEMENT
ALGORITHM 222 4.4.9. THE WSCLOCK PAGE REPLACEMENT ALGORITHM 225 4.4.:.
SUMMARY OF PAGE REPLACEMENT ALGORITHMS 227 4.5. MODELING PAGE
REPLACEMENT ALGORITHMS 228 4.5.1. BELADY S ANOMALY 229 4.5.2. STACK
ALGORITHMS 229 4.5.3. THE DISTANCE STRING 232 4.5.4. PREDICTING PAGE
FAULT RATES 233 4.6. DESIGN ISSUES FOR PAGING SYSTEMS 234 4.6.1. LOCAL
VERSUS GLOBAL ALLOCATION POLICIES 234 4.6.2. LOAD CONTROL 236 4.6.3.
PAGE SIZE 237 4.6.4. SEPARATE INSTRUCTION AND DATA SPACES 239 XII
CONTENTS 4.6.5. SHARED PAGES 239 4.6.6. CLEANING POLICY 241 4.6.7.
VIRTUAL MEMORY INTERFACE 241 4.7. IMPLEMENTATION ISSUES 242 4.7.1.
OPERATING SYSTEM INVOLVEMENT WITH PAGING 242 4.7.2. PAGE FAULT HANDLING
243 4.7.3. INSTRUCTION BACKUP 244 4.7.4. LOCKING PAGES IN MEMORY 246
4.7.5. BACKING STORE 246 4.7.6. SEPARATION OF POLICY AND MECHANISM 247
4.8. SEGMENTATION 249 4.8.1. IMPLEMENTATION OF PURE SEGMENTATION 253
4.8.2. SEGMENTATION WITH PAGING: MULTICS 254 4.8.3. SEGMENTATION WITH
PAGING: THE INTEL PENTIUM 257 4.9. RESEARCH ON MEMORY MANAGEMENT 262
4.10. SUMMARY 262 5 INPUT/OUTPUT 269 5.1. PRINCIPLES OF I/O HARDWARE 269
5.1.1. I/O DEVICES 270 5.1.2. DEVICE CONTROLLERS 271 5.1.3.
MEMORY-MAPPED I/O 272 5.1.4. DIRECT MEMORY ACCESS 276 5.1.5. INTERRUPTS
REVISITED 279 5.2. PRINCIPLES OF I/O SOFTWARE 282 5.2.1. GOALS OF THE
I/O SOFTWARE 283 5.2.2. PROGRAMMED I/O 284 5.2.3. INTERRUPT-DRIVEN I/O
286 5.2.4. I/O USING DMA 287 5.3. I/O SOFTWARE LAYERS 287 5.3.1.
INTERRUPT HANDLERS 287 5.3.2. DEVICE DRIVERS 289 CONTENTS XIII 5.3.3.
DEVICE-INDEPENDENT I/O SOFTWARE 292 5.3.4. USER-SPACE I/O SOFTWARE 298
5.4. DISKS 300 5.4.1. DISK HARDWARE 300 5.4.2. DISK FORMATTING 315
5.4.3. DISK ARM SCHEDULING ALGORITHMS 318 5.4.4. ERROR HANDLING 322
5.4.5. STABLE STORAGE 324 5.5. CLOCKS 327 5.5.1. CLOCK HARDWARE 328
5.5.2. CLOCK SOFTWARE 329 5.5.3. SOFT TIMERS 332 5.6. CHARACTER-ORIENTED
TERMINALS 333 5.6.1. RS-232 TERMINAL HARDWARE 334 5.6.2. INPUT SOFTWARE
336 5.6.3. OUTPUT SOFTWARE 341 5.7. GRAPHICAL USER INTERFACES 342 5.7.1.
PERSONAL COMPUTER KEYBOARD, MOUSE, AND DISPLAY HARDWARE 343 5.7.2. INPUT
SOFTWARE 347 5.7.3. OUTPUT SOFTWARE FOR WINDOWS 347 5.8. NETWORK
TERMINALS 355 5.8.1. THE X WINDOW SYSTEM 356 5.8.2. THE SLIM NETWORK
TERMINAL 360 5.9. POWER MANAGEMENT 363 5.9.1. HARDWARE ISSUES 364 5.9.2.
OPERATING SYSTEM ISSUES 365 5.9.3. DEGRADED OPERATION 370 5.10. RESEARCH
ON INPUT/OUTPUT 371 5.11. SUMMARY 372 XIV CONTENTS 6 FILE SYSTEMS 379
6.1. FILES 380 6.1.1. FILE NAMING 380 6.1.2. FILE STRUCTURE 382 6.1.3.
FILE TYPES 383 6.1.4. FILE ACCESS 385 6.1.5. FILE ATTRIBUTES 386 6.1.6.
FILE OPERATIONS 387 6.1.7. AN EXAMPLE PROGRAM USING FILE SYSTEM CALLS
389 6.1.8. MEMORY-MAPPED FILES 391 6.2. DIRECTORIES 393 6.2.1.
SINGLE-LEVEL DIRECTORY SYSTEMS 393 6.2.2. TWO-LEVEL DIRECTORY SYSTEMS
394 6.2.3. HIERARCHICAL DIRECTORY SYSTEMS 395 6.2.4. PATH NAMES 395
6.2.5. DIRECTORY OPERATIONS 398 6.3. FILE SYSTEM IMPLEMENTATION 399
6.3.1. FILE SYSTEM LAYOUT 399 6.3.2. IMPLEMENTING FILES 400 6.3.3.
IMPLEMENTING DIRECTORIES 405 6.3.4. SHARED FILES 408 6.3.5. DISK SPACE
MANAGEMENT 410 6.3.6. FILE SYSTEM RELIABILITY 416 6.3.7. FILE SYSTEM
PERFORMANCE 424 6.3.8. LOG-STRUCTURED FILE SYSTEMS 428 6.4. EXAMPLE FILE
SYSTEMS 430 6.4.1. CD-ROM FILE SYSTEMS 430 6.4.2. THE CP/M FILE SYSTEM
435 6.4.3. THE MS-DOS FILE SYSTEM 438 6.4.4. THE WINDOWS 98 FILE SYSTEM
442 6.4.5. THE UNIX V7 FILE SYSTEM 445 6.5. RESEARCH ON FILE SYSTEMS 448
6.6. SUMMARY 448 CONTENTS XV 7 MULTIMEDIA OPERATING SYSTEMS 453 7.1.
INTRODUCTION TO MULTIMEDIA 454 7.2. MULTIMEDIA FILES 458 7.2.1. AUDIO
ENCODING 459 7.2.2. VIDEO ENCODING 461 7.3. VIDEO COMPRESSION 463 7.3.1.
THE JPEG STANDARD 464 7.3.2. THE MPEG STANDARD 467 7.4. MULTIMEDIA
PROCESS SCHEDULING 469 7.4.1. SCHEDULING HOMOGENEOUS PROCESSES 469
7.4.2. GENERAL REAL-TIME SCHEDULING 470 7.4.3. RATE MONOTONIE SCHEDULING
472 7.4.4. EARLIEST DEADLINE FIRST SCHEDULING 473 7.5. MULTIMEDIA FILE
SYSTEM PARADIGMS 475 7.5.1. VCR CONTROL FUNCTIONS 476 7.5.2. NEAR VIDEO
ON DEMAND 478 7.5.3. NEAR VIDEO ON DEMAND WITH VCR FUNCTIONS 479 7.6.
FILE PLACEMENT 481 7.6.1. PLACING A FILE ON A SINGLE DISK 481 7.6.2. TWO
ALTERNATIVE FILE ORGANIZATION STRATEGIES 482 7.6.3. PLACING FILES FOR
NEAR VIDEO ON DEMAND 486 7.6.4. PLACING MULTIPLE FILES ON A SINGLE DISK
487 7.6.5. PLACING FILES ON MULTIPLE DISKS 490 7.7. CACHING 492 7.7.1.
BLOCK CACHING 492 7.7.2. FILE CACHING 494 7.8. DISK SCHEDULING FOR
MULTIMEDIA 494 7.8.1. STATIC DISK SCHEDULING 495 7.8.2. DYNAMIC DISK
SCHEDULING 496 7.9. RESEARCH ON MULTIMEDIA 498 7.10. SUMMARY 499 XVI
CONTENTS 8 MULTIPLE PROCESSOR SYSTEMS 503 8.1. MULTIPROCESSORS 506
8.1.1. MULTIPROCESSOR HARDWARE 506 8.1.2. MULTIPROCESSOR OPERATING
SYSTEM TYPES 513 8.1.3. MULTIPROCESSOR SYNCHRONIZATION 516 8.1.4.
MULTIPROCESSOR SCHEDULING 521 8.2. MULTICOMPUTERS 526 8.2.1.
MULTICOMPUTER HARDWARE 527 8.2.2. LOW-LEVEL COMMUNICATION SOFTWARE 531
8.2.3. USER-LEVEL COMMUNICATION SOFTWARE 534 8.2.4. REMOTE PROCEDURE
CALL 537 8.2.5. DISTRIBUTED SHARED MEMORY 540 8.2.6. MULTICOMPUTER
SCHEDULING 544 8.2.7. LOAD BALANCING 545 8.3. DISTRIBUTED SYSTEMS 549
8.3.1. NETWORK HARDWARE 551 8.3.2. NETWORK SERVICES AND PROTOCOLS 553
8.3.3. DOCUMENT-BASED MIDDLEWARE 558 8.3.4. FILE SYSTEM-BASED MIDDLEWARE
559 8.3.5. SHARED OBJECT-BASED MIDDLEWARE 565 8.3.6. COORDINATION-BASED
MIDDLEWARE 572 8.4. RESEARCH ON MULTIPLE PROCESSOR SYSTEMS 577 8.5.
SUMMARY 577 9 SECURITY 583 9.1. THE SECURITY ENVIRONMENT 584 9.1.1.
THREATS 584 9.1.2. INTRUDERS 585 9.1.3. ACCIDENTAL DATA LOSS 586 9.2.
BASICS OF CRYPTOGRAPHY 587 9.2.1. SECRET-KEY CRYPTOGRAPHY 588 9.2.2.
PUBLIC-KEY CRYPTOGRAPHY 588 CONTENTS XVII 9.2.3. ONE-WAY FUNCTIONS 589
9.2.4. DIGITAL SIGNATURES 590 9.3. USER AUTHENTICATION 591 9.3.1.
AUTHENTICATION USING PASSWORDS 592 9.3.2. AUTHENTICATION USING A
PHYSICAL OBJECT 601 9.3.3. AUTHENTICATION USING BIOMETRICS 603 9.3.4.
COUNTERMEASURES 606 9.4. ATTACKS FROM INSIDE THE SYSTEM 606 9.4.1.
TROJAN HORSES 607 9.4.2. LOGIN SPOOFING 608 9.4.3. LOGIC BOMBS 609
9.4.4. TRAP DOORS 610 9.4.5. BUFFER OVERFLOW 610 9.4.6. GENERIC SECURITY
ATTACKS 613 9.4.7. FAMOUS SECURITY FLAWS 614 9.4.8. DESIGN PRINCIPLES
FOR SECURITY 616 9.5. ATTACKS FROM OUTSIDE THE SYSTEM 617 9.5.1. VIRUS
DAMAGE SCENARIOS 618 9.5.2. HOW VIRUSES WORK 619 9.5.3. HOW VIRUSES
SPREAD 626 9.5.4. ANTIVIRUS AND ANTI-ANTIVIRAS TECHNIQUES 628 9.5.5. THE
INTERNET WORM 635 9.5.6. MOBILE CODE 637 9.5.7. JAVA SECURITY 642 9.6.
PROTECTION MECHANISMS 645 9.6.1. PROTECTION DOMAINS 645 9.6.2. ACCESS
CONTROL LISTS 647 9.6.3. CAPABILITIES 650 9.7. TRUSTED SYSTEMS 653
9.7.1. TRUSTED COMPUTING BASE 654 9.7.2. FORMAL MODELS OF SECURE SYSTEMS
655 9.7.3. MULTILEVEL SECURITY 657 9.7.4. ORANGE BOOK SECURITY 659
9.7.5. COVERT CHANNELS 661 9.8. RESEARCH ON SECURITY 665 9.9. SUMMARY
666 XVUEI CONTENTS 10 CASE STUDY 1: UNIX AND LINUX 671 10.1. HISTORY OF
UNIX 672 10.1.1. UNICS 672 10.1.2. PDP-11 UNIX 673 10.1.3. PORTABLE UNIX
674 10.1.4. BERKELEY UNIX 675 10.1.5. STANDARD UNIX 676 10.1.6. MINIX
677 10.1.7. LINUX 678 10.2. OVERVIEW OF UNIX 681 10.2.1. UNIX GOALS 681
10.2.2. INTERFACES TO UNIX 682 10.2.3. THE UNIX SHELL 683 10.2.4. UNIX
UTILITY PROGRAMS 686 10.2.5. KERNEL STRUCTURE 687 10.3. PROCESSES IN
UNIX 690 10.3.1. FUNDAMENTAL CONCEPTS 690 10.3.2. PROCESS MANAGEMENT
SYSTEM CALLS IN UNIX 692 10.3.3. IMPLEMENTATION OF PROCESSES IN UNIX 699
10.3.4. BOOTING UNIX 708 10.4. MEMORY MANAGEMENT IN UNIX 710 10.4.1.
FUNDAMENTAL CONCEPTS 711 10.4.2. MEMORY MANAGEMENT SYSTEM CALLS IN UNIX
714 10.4.3. IMPLEMENTATION OF MEMORY MANAGEMENT IN UNIX 715 10.5.
INPUT/OUTPUT IN UNIX 723 10.5.1. FUNDAMENTAL CONCEPTS 724 10.5.2.
INPUT/OUTPUT SYSTEM CALLS IN UNIX 726 10.5.3. IMPLEMENTATION OF
INPUT/OUTPUT IN UNIX 727 10.5.4. STREAMS 730 10.6. THE UNIX FILE SYSTEM
732 10.6.1. FUNDAMENTAL CONCEPTS 732 10.6.2. FILE SYSTEM CALLS IN UNIX
736 10.6.3. IMPLEMENTATION OF THE UNIX FILE SYSTEM 740 10.6.4. NFS: THE
NETWORK FILE SYSTEM 747 CONTENTS XIX 10.7. SECURITY IN UNIX 753 10.7.1.
FUNDAMENTAL CONCEPTS 753 10.7.2. SECURITY SYSTEM CALLS IN UNIX 755
10.7.3. IMPLEMENTATION OF SECURITY IN UNIX 756 10.8. SUMMARY 757 11 CASE
STUDY 2: WINDOWS 2000 763 11.1. HISTORY OF WINDOWS 2000 763 11.1.1.
MS-DOS 763 11.1.2. WINDOWS 95/98/ME 764 11.1.3. WINDOWS NT 765 11.1.4.
WINDOWS 2000 767 11.2. PROGRAMMING WINDOWS 2000 771 11.2.1. THE WIN32
APPLICATION PROGRAMMING INTERFACE 772 11.2.2. THE REGISTRY 774 11.3.
SYSTEM STRUCTURE 778 11.3.1. OPERATING SYSTEM STRUCTURE 778 11.3.2.
IMPLEMENTATION OF OBJECTS 787 11.3.3. ENVIRONMENT SUBSYSTEMS 792 11.4.
PROCESSES AND THREADS IN WINDOWS 2000 796 11.4.1. FUNDAMENTAL CONCEPTS
796 11.4.2. JOB, PROCESS, THREAD AND FIBER MANAGEMENT API CALLS 799
11.4.3. IMPLEMENTATION OF PROCESSES AND THREADS 802 11.4.4. MS-DOS
EMULATION 809 11.4.5. BOOTING WINDOWS 2000 820 11.5. MEMORY MANAGEMENT
811 11.5.1. FUNDAMENTAL CONCEPTS 812 11.5.2. MEMORY MANAGEMENT SYSTEM
CALLS 816 11.5.3. IMPLEMENTATION OF MEMORY MANAGEMENT 817 11.6.
INPUT/OUTPUT IN WINDOWS 2000 824 11.6.1. FUNDAMENTAL CONCEPTS 824
11.6.2. INPUT/OUTPUT API CALLS 825 11.6.3. IMPLEMENTATION OF I/O 827
11.6.4. DEVICE DRIVERS 827 XX CONTENTS 11.7. THE WINDOWS 2000 FILE
SYSTEM 830 11.7.1. FUNDAMENTAL CONCEPTS 830 11.7.2. FILE SYSTEM API
CALLS IN WINDOWS 2000 831 11.7.3. IMPLEMENTATION OF THE WINDOWS 2000
FILE SYSTEM 833 11.8. SECURITY IN WINDOWS 2000 844 11.8.1. FUNDAMENTAL
CONCEPTS 845 11.8.2. SECURITY API CALLS 847 11.8.3. IMPLEMENTATION OF
SECURITY 848 11.9. CACHING IN WINDOWS 2000 849 11.10. SUMMARY 851 12
OPERATING SYSTEM DESIGN 855 12.1. THE NATURE OF THE DESIGN PROBLEM 856
12.1.1. GOALS 856 12.1.2. WHY IS IT HARD TO DESIGN AN OPERATING SYSTEMS?
857 12.2. INTERFACE DESIGN 859 12.2.1. GUIDING PRINCIPLES 859 12.2.2.
PARADIGMS 861 12.2.3. THE SYSTEM CALL INTERFACE 864 12.3 IMPLEMENTATION
867 12.3.1. SYSTEM STRUCTURE 867 12.3.2. MECHANISM VERSUS POLICY 870
12.3.3. ORTHOGONALITY 871 12.3.4. NAMING 872 12.3.5. BINDING TIME 874
12.3.6. STATIC VERSUS DYNAMIC STRUCTURES 875 12.3.7. ***-DOWN VERSUS
BOTTOM-UP IMPLEMENTATION 876 12.3.8. USEFUL TECHNIQUES 877 12.4.
PERFORMANCE 882 12.4.1. WHY ARE OPERATING SYSTEMS SLOW? 882 12.4.2. WHAT
SHOULD BE OPTIMIZED? 883 12.4.3. SPACE-TIME TRADE-OFFS 884 12.4.4.
CACHING 887 CONTENTS XXI 12.4.5. HINTS 888 12.4.6. EXPLOITING LOCALITY
888 12.4.7. OPTIMIZE THE COMMON CASE 889 12.5. PROJECT MANAGEMENT 889
12.5.1. THE MYTHICAL MAN MONTH 890 12.5.2. TEAM STRUCTURE 891 12.5.3.
THE ROLE OF EXPERIENCE 893 12.5.4. NO SILVER BULLET 894 12.6. TRENDS IN
OPERATING SYSTEM DESIGN 894 12.6.1. LARGE ADDRESS SPACE OPERATING
SYSTEMS 894 12.6.2. NETWORKING 895 12.6.3. PARALLEL AND DISTRIBUTED
SYSTEMS 896 12.6.4. MULTIMEDIA 896 12.6.5. BATTERY-POWERED COMPUTERS 896
12.6.6. EMBEDDED SYSTEMS 897 12.7. SUMMARY 897 13 READING LIST AND
BIBLIOGRAPHY 901 13.1. SUGGESTIONS FOR FURTHER READING 901 13.1.1.
INTRODUCTION AND GENERAL WORKS 902 13.1.2. PROCESSES AND THREADS 902
13.1.3. DEADLOCKS 903 13.1.4. MEMORY MANAGEMENT 903 13.1.5. INPUT/OUTPUT
903 13.1.6. FILE SYSTEMS 904 13.1.7. MULTIMEDIA OPERATING SYSTEMS 905
13.1.8. MULTIPLE PROCESSOR SYSTEMS 906 13.1.9. SECURITY 907 13.1.10.
UNIX AND LINUX 908 13.1.11. WINDOWS 2000 909 13.1.12. DESIGN PRINCIPLES
910 13.2 ALPHABETICAL BIBLIOGRAPHY 911 INDEX 935
|
| any_adam_object | 1 |
| author | Tanenbaum, Andrew S. 1944- |
| author_GND | (DE-588)120278979 |
| author_facet | Tanenbaum, Andrew S. 1944- |
| author_role | aut |
| author_sort | Tanenbaum, Andrew S. 1944- |
| author_variant | a s t as ast |
| building | Verbundindex |
| bvnumber | BV013737058 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.76.O63 |
| callnumber-search | QA76.76.O63 |
| callnumber-sort | QA 276.76 O63 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 260 |
| classification_tum | DAT 400f |
| ctrlnum | (OCoLC)45284637 (DE-599)BVBBV013737058 |
| dewey-full | 005.4/3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.4/3 |
| dewey-search | 005.4/3 |
| dewey-sort | 15.4 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01954nam a2200481 c 4500</leader><controlfield tag="001">BV013737058</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130321 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">010522s2001 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0130313580</subfield><subfield code="9">0-13-031358-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)45284637</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013737058</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-858</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-525</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.76.O63</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.4/3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 260</subfield><subfield code="0">(DE-625)143632:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 400f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tanenbaum, Andrew S.</subfield><subfield code="d">1944-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120278979</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modern operating systems</subfield><subfield code="c">Andrew S. Tanenbaum</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Upper Saddle River, NJ</subfield><subfield code="b">Prentice-Hall</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIV, 951 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Besturingssystemen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">İşletim sistemleri (Bilgisayarlar)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operating systems (Computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteiltes Betriebssystem</subfield><subfield code="0">(DE-588)4243910-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Betriebssystem</subfield><subfield code="0">(DE-588)4006216-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Verteiltes Betriebssystem</subfield><subfield code="0">(DE-588)4243910-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Betriebssystem</subfield><subfield code="0">(DE-588)4006216-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Verteiltes Betriebssystem</subfield><subfield code="0">(DE-588)4243910-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009389599&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009389599</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV013737058 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:51:06Z |
| institution | BVB |
| isbn | 0130313580 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009389599 |
| oclc_num | 45284637 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-29T DE-19 DE-BY-UBM DE-20 DE-703 DE-M347 DE-858 DE-706 DE-525 |
| owner_facet | DE-91G DE-BY-TUM DE-29T DE-19 DE-BY-UBM DE-20 DE-703 DE-M347 DE-858 DE-706 DE-525 |
| physical | XXIV, 951 S. graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Prentice-Hall |
| record_format | marc |
| spelling | Tanenbaum, Andrew S. 1944- Verfasser (DE-588)120278979 aut Modern operating systems Andrew S. Tanenbaum 2. ed. Upper Saddle River, NJ Prentice-Hall 2001 XXIV, 951 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Besturingssystemen gtt İşletim sistemleri (Bilgisayarlar) Operating systems (Computers) Verteiltes Betriebssystem (DE-588)4243910-3 gnd rswk-swf Betriebssystem (DE-588)4006216-8 gnd rswk-swf 1\p (DE-588)4123623-3 Lehrbuch gnd-content Verteiltes Betriebssystem (DE-588)4243910-3 s Betriebssystem (DE-588)4006216-8 s 2\p DE-604 DE-604 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009389599&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Tanenbaum, Andrew S. 1944- Modern operating systems Besturingssystemen gtt İşletim sistemleri (Bilgisayarlar) Operating systems (Computers) Verteiltes Betriebssystem (DE-588)4243910-3 gnd Betriebssystem (DE-588)4006216-8 gnd |
| subject_GND | (DE-588)4243910-3 (DE-588)4006216-8 (DE-588)4123623-3 |
| title | Modern operating systems |
| title_auth | Modern operating systems |
| title_exact_search | Modern operating systems |
| title_full | Modern operating systems Andrew S. Tanenbaum |
| title_fullStr | Modern operating systems Andrew S. Tanenbaum |
| title_full_unstemmed | Modern operating systems Andrew S. Tanenbaum |
| title_short | Modern operating systems |
| title_sort | modern operating systems |
| topic | Besturingssystemen gtt İşletim sistemleri (Bilgisayarlar) Operating systems (Computers) Verteiltes Betriebssystem (DE-588)4243910-3 gnd Betriebssystem (DE-588)4006216-8 gnd |
| topic_facet | Besturingssystemen İşletim sistemleri (Bilgisayarlar) Operating systems (Computers) Verteiltes Betriebssystem Betriebssystem Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009389599&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT tanenbaumandrews modernoperatingsystems |