Normal view MARC view ISBD view

Operating systems / (Record no. 1748)

MARC details
000 -LEADER
fixed length control field	26191nam a2200157 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number	9788131723593 (pb)
040 ## - CATALOGING SOURCE
Transcribing agency	CUS
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number	005.43
Item number	NUT/O
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name	Nutt, Gary
245 ## - TITLE STATEMENT
Title	Operating systems /
Statement of responsibility, etc.	Gary Nutt, Nabendu Chaki and Saarmistha Neogy
250 ## - EDITION STATEMENT
Edition statement	3rd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc.	Delhi :
Name of publisher, distributor, etc.	Pearson ,
Date of publication, distribution, etc.	2004.
300 ## - PHYSICAL DESCRIPTION
Extent	806 p.
Other physical details	ill.;
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note	Chapter 1 Introduction<br/>1. 1 Computers and Software<br/>General System Software<br/>Resource Abstraction<br/>Example: An Abstraction of a Disk Drive<br/>Resource Sharing<br/>Abstract Machines and Transparent Resomce Sharing<br/>Explicit Resource Sharing<br/>1.2 Operating System Strategies<br/>Batch Systems<br/>The User's Perspective<br/>Batch Processing Technology<br/>Example: Batch Files<br/>Timesharing Systems<br/>The User's Perspective<br/>Timesharing Technology<br/>Example: The UNDC Timesharing System<br/>Personal Computers and Workstations<br/>The User's Perspective<br/>OS Technology<br/>Contributions to Modem OS Technology<br/>Example: The Microsoft Windows OS Family<br/>Embedded Systems<br/>The User's Perspective<br/>OS Technology<br/>Contributions to Modem OS Technology<br/>Example: VxWorks<br/>Small, Communicating Computers<br/>The User's Persepective<br/>OS Technology<br/>Example: Windows CE (Pocket PC)<br/>Networks<br/>The Genesis of Modem Operating Systems<br/>1.3 SUMMARY<br/>1.4 Exercises<br/>Operating System<br/>Architecture<br/>2.1 Basic Functions<br/>Device Management<br/>Process, Thread, and Resource Management<br/>Memory Management<br/>File Management<br/>2.2 GENERAL IMPi-EMENTATlON<br/>CONSIDERATIONS<br/>Performance<br/>Exclusive Use of Resources<br/>Processor Modes<br/>Kernels<br/>Requesting Services from the Operating System<br/>Software Modularization<br/>2.3 Contemporary OS Kernels<br/>UNDC Kernels<br/>Btampte: Linux<br/>The Windows NT Executive and Kernel<br/>2.4 SUMMARY<br/>2.5 EXERCISES<br/>Lab Exercise 2.1 Observing OS Behavior<br/>Background<br/>Attacking the Problem<br/>Processes and Threads,<br/>The Task at hand<br/>The Abstract Machine for Classic Processes<br/>Supporting Modem Processes and Threads<br/>Resources<br/>The Process Address Space<br/>OS Families<br/>Process Manager Responsibilities<br/>3.2 The Hardware Process<br/>3. 3 The Abstract machine interface<br/>3.4 The Thread Management<br/>Advantages of Using Threads<br/>Thread Control Block (TCB)<br/>Thread State Diagram<br/>Operations on Therads<br/>Thread Synchronization<br/>Thread Levels<br/>3. 5 The Process Abstraction<br/>Bffampte: Linux Process Descriptor<br/>Example: Windows NT/2000/XP Process<br/>Descriptors<br/>3.6 THE Thread Abstraction<br/>Example: Linux Thread Descriptor<br/>Example: Windows NT/2000/XP Thread Descriptors<br/>3.7 STATE Diagrams<br/>Example: UNDC State Diagram<br/>3.7 Resource managers<br/>3. 8 Generalizing Process Wanagewent policies<br/>Refming the Process Manager<br/>Specializing Resource Allocation Strategies<br/>3.9 SUMMARY<br/>3.10 Exercises<br/>Lab Btercise 3.1 Kernel Timers<br/>Background<br/>Attacking the Problem<br/>Lab Exercise 3.2 Manipulating Kernel<br/>Objects 115<br/>Part A<br/>PartB<br/>Part C<br/>Background<br/>Attacking the Problem<br/>Scheduling<br/>Overview<br/>4.2 SCHEDULING MECHANISMS<br/>The Process Scheduler Organiaation<br/>Saving the Context<br/>Voluntary CPU Sharing<br/>Involuntary CPU Sharing<br/>Performance<br/>4.3 STRATEGY SELECTION<br/>Scheduler Characteristics<br/>A Model to Study Scheduling<br/>Emmpte: Partitioning a Process into<br/>Small Processes<br/>Example: Approximating System Load<br/>4.4 Nonpreemptive Strategies<br/>First-come-first-served<br/>Example: Predicting Wait Times for FCFS<br/>Shortest Job Next<br/>Priority Scheduling<br/>Deadline Scheduling<br/>4.5 PREEMPTIVE STRATEGIES<br/>Round Robin<br/>Multiple-Level Queues<br/>4.6 IMPLEMENTING THE SCHEDULER<br/>Example: The Linux Scheduling Mechanism<br/>Example: BSD UNIX Scheduling Policy<br/>Example: Windows NT/2000/XP Thread<br/>Scheduling<br/>4'7 Summary<br/>4.8 Exercises<br/>Lah Exercise Analyzing the Round Robin<br/>SCHEDULING<br/>Background<br/>Attacking the Problem<br/>Chapter 5 Basic Synchronization Principles<br/>5. 1 COOPERATING PROCESSES<br/>Critical Sections _ .<br/>Deadlock<br/>Resource Sharing<br/>5.2 EVOl-VING FROM THE CLASSIC SOLUTION<br/>5.3 Semaphores; The Basis of modern Solutions<br/>Principles of Operation<br/>Example: Using Semaphores<br/>Practical Considerations<br/>5.4 Synchronization in Shared Memory<br/>Multiprocessors<br/>5.5 Summary<br/>5.6 Exercises<br/>Lab Exercise 5,1 Bounded Buffer Problem<br/>Background<br/>Attacking the Problem<br/>Chafer 6 High-level Synchronization and<br/>Interprocess Communication<br/>6.1 ALTERNATIVE SYNCHRONIZATION PRIMITIVES<br/>AND Synchronization<br/>Example: Using and Synchronization to Solve the Dining<br/>Philosophers Problem<br/>Events<br/>Example: Using Generic Events<br/>Example: Windows NT/2000/XP Dispatcher Objects<br/>6.2 Monitors<br/>Principles of Operation<br/>Condition Variable's<br/>Example: Using^Monitors<br/>Some Practical Aspects of Using Monitors<br/>6.3 INTERPROCESS COMMUNICATION<br/>The Pipe Model<br/>Message Passing Mechanisms<br/>Mailboxes<br/>Message Protocols<br/>Using the send() and receive () Operations<br/>Example: Synchronized IPG<br/>Deferred Message Copying<br/>6.4. SUMMARY<br/>6.5 EXERCISES<br/>Lab Beercise 6.1 Using Pipes<br/>Background<br/>Attacking the Problem<br/>Lab Beercise 6.2 Refining the Shell<br/>Part A<br/>PartB<br/>PartC<br/>PartD<br/>Background<br/>Attacking the Problem<br/>DEADLOCK<br/>BACKOROUNP<br/>Prevention<br/>Avoidance<br/>Detection and Recovery<br/>Manual Deadlock Management<br/>7.2 A System Deadlock Model<br/>Example: Single Resource Type<br/>7.3 PREVENTION<br/>Hold and Wait<br/>Circular Wait<br/>Allowing Preemption<br/>7.4 Avoidance<br/>The Banker's Algorithm<br/>Exahple: Using the Banker's Algorithm<br/>7.5 Detection and Recovery<br/>Serially Reusable Resources<br/>Example: Serially Reusable Resource Graphs<br/>' Consumable Resources<br/>General Resource Systems<br/>Recovery<br/>7.6 SUMMARY<br/>7.7 EXERCISES<br/>BASIC MEMORY MANAGEMENT<br/>The basics<br/>8. 2 The Address Space Abstraction<br/>Managing the Address Space<br/>Example: Static Address Binding<br/>Dynamic Memory for Data Structures<br/>Modem Memory Binding<br/>8.3 MEivioRY Allocation<br/>Fixed-Partition Memory Strategies<br/>Variable-Partition Memory Strategies<br/>Example: The Cost of Moving Programs<br/>Contemporary Allocation Strategies<br/>8.4. DYNAMIC ADDRESS SPACE BINDING<br/>Runtime Boimd Checking: The Isolation Mechanism<br/>8.5 MODERN MEMORY MANAGER STRATEGIES<br/>Swapping<br/>Virtual Memory<br/>Example: Using Cache Memory<br/>Shared-Memory Multiprocessors<br/>8.6 SUMMARY<br/>8.7 EXERCISES<br/>Uh Exercise 8.1 Using Shared memory<br/>Backgroimd<br/>Attacking the Problem<br/>Chapter 9 Basic Virtual Memory<br/>9.1 THE Task AT Hand<br/>9.2 ADDRESS Translation<br/>Address Space Mapping<br/>Segmentation and Paging<br/>10.1<br/>9. 3 Paging<br/>Paging Virtual Address Translation<br/>Example: Contemporary Page Table Implementations<br/>9.4 STATIC PAGING Ai-GORITHMS<br/>The Fetch Policy<br/>Demand Paging Algorithms<br/>Stack Algorithms<br/>Implementing LRU<br/>Paging Performance<br/>9.5 DYNAMIC PAGING ALGORITHMS<br/>The Working Set Algorithm<br/>Example: Working Set Algorithm<br/>Implementing the Working Set Algorithm<br/>Example: Taking Advantage of Paging with IPG<br/>Example: Windows NT/2000/XP Virtual Memory<br/>Example: Linux Virtual Memory<br/>9.6 SEGMENTATION<br/>Address Translation<br/>Implementation<br/>Example: The Multics Segmentation System<br/>9.7 Memory-Mapped Files<br/>9.8 SUMMARY<br/>9.9 exercises<br/>UB Exercise 9.1 Memory-Mapped Files<br/>Backgroimd<br/>Attacking the Problem<br/>DEVICE MANAGEMENT<br/>THE I/O SYSTEM<br/>Device Manager Abstraction<br/>I/O-Processor Overlap within an Application<br/>I/O-Processor Overlap across Threads<br/>10.2 I/O STRATEGIES<br/>Direct I/O with Polling<br/>Interrupt-Driven I/O<br/>Polling Versus Interrupt-Driven I/O Performance<br/>10.3 DEVICE MANAGER DESIGN<br/>Device-dependent Driver Infrastructure Framework<br/>Servicing Interrupts<br/>Example: Linux Device I/O<br/>10.4 BUFFERING<br/>10.5 DEVICE CLASS CHARACTERISTICS<br/>Communication Devices<br/>Example: Asynchronous Serial Devices<br/>Sequentially Accessed Storage Devices<br/>Example: Traditional Magnetic Tape<br/>Randomly Accessed Storage Devices<br/>Example: Magnetic Disk<br/>Example: Optimizing Access on Magnetic Disks<br/>Example: CD-ROM and DVD<br/>10.6 SUMMARY<br/>10.7 EXERCISES<br/>Lab Exercise 10.1 A Floppy Disk Driver<br/>Part A<br/>PartB<br/>Part C<br/>Backgroimd<br/>Attacking the Problem<br/>Chapter 11 File Management<br/>11.1 THE Task at Hand<br/>11.2 Files<br/>Low-level Files<br/>Structured Files<br/>Database Management Systems<br/>Multimedia Storage<br/>11.3 L.OW-LEVEL FILE IMPLEMENTATIONS<br/>„ The 0PEN() and close () Operations<br/>Example: UNIX Open and Close<br/>Block Management<br/>Example: UNIX File Structure<br/>Grampte: The DOS FAT File System<br/>Reading and Writing the Byte Stream<br/>1 1.4 SUPPORTING HiGH-LEVEL Fii-E<br/>ABSTRACTIONS<br/>Structured Sequential Files<br/>Indexed Sequential Files<br/>Database Management Systems<br/>Multimedia Documents<br/>11.5 DIRECTORIES<br/>Directory Stinctures<br/>Example: Some Directory Approaches<br/>11.6 Implementing Directories<br/>Directory Entries<br/>Opening a File<br/>11.7 File Systems<br/>Example: The ISO 9660 File System<br/>Mounting File Systems<br/>Heterogeneous File Systems<br/>11.8 SUMMARY<br/>1 1 .9 EXERCISES<br/>Lab Bcercise 11.1 A Simple File Manager<br/>Part A<br/>PartB<br/>PartC<br/>Backgroimd<br/>Attacking the Problem<br/>PROTECTION AND SECURITY<br/>12.1 The Problem<br/>The Goal-<br/>Policy and Mechanism<br/>Context for Protection and Security<br/>The Cost of Protection Mechanisms<br/>12.2 Authentication<br/>External User Authentication<br/>Example: Windows NT/2000/XP User Authentication<br/>Internal Thread/Process Authentication<br/>Authentication in the Network<br/>Software Authentication<br/>12.3 AUTHORIZATION U\J y<br/>Ad Hoc Authorization Mechanisms<br/>A General Model for Authorization<br/>Implementing Security Policies<br/>Implementing General Authorization Mechanisms<br/>Protection Domains<br/>Implementing the Access Matrix<br/>12.4 CRYPTOGRAPHY<br/>The Big Picture<br/>Private Key Encryption<br/>Public Key Encryption<br/>Example: PGP Encryption<br/>Internet Content Delivery<br/>12.5 SUMMARY<br/>12.6 Exercises<br/>Networks<br/>From Computer Cowiviunications<br/>TO NETWORKS<br/>Switched Networks<br/>Network Hardware Requirements<br/>Network Software Requirements<br/>13.2 THE ISO OSI NETWORK ARCHITECTURE<br/>MODEL<br/>The Evolution of Network Protocols<br/>The ISO OSI Model<br/>13.3 media access Control (MAC)<br/>PROTOCOLS<br/>The Physical Layer<br/>Example: Fast Physical Layers<br/>The Data Link Layer<br/>Contemporary Networks<br/>13.4 THE Network layer :<br/>Internet Addresses<br/>Routing<br/>Using the Network Layer<br/>Example: Latency in the Internet<br/>13.5 The Transport L.AYER<br/>Communication Ports<br/>Data Types<br/>Reliable Communication<br/>Example: Datagrams and Virtual Circuits Performance<br/>13.6 USING THE TRANSPORT LAYER<br/>Naming and Addresses<br/>Example: The Domain Name Service<br/>The Client-Server Model<br/>13.7 NETWORK SECURITY<br/>Transport Layer Security: Firewalls<br/>Network Layer Security: IPSEC<br/>13.8 SUMMARY<br/>13.9 Exercises :<br/>ImB Exercise 13.1 Using TCP/IP<br/>Background<br/>Example: The WinSock Package<br/>Attacking the Problem<br/>H Distributed System Overview<br/>14.1 DISTRIBUTED OS MECHANISMS<br/>14.2 DISTRIBUTED PRIMARY MEMORY<br/>Remote Memory<br/>Example: The Linda Programming Language<br/>Distributed Shared Memory<br/>14.3 remote.Procedure call<br/>How Does RPC Work?<br/>Implementing RPC<br/>14.4 REMOTE OBJECTS<br/>The Emerald System<br/>CORBA<br/>Java Remote Objects<br/>14.5 Distributing Process Management<br/>General Process Management<br/>Process and Thread Creation<br/>Scheduling<br/>Migration and Load Balancing<br/>Distributed Synchronization<br/>14.6 SUMMARY<br/>14.7 EXERCISES<br/>LaB Exercise 74.1 Using Remote Procedure<br/>CALL<br/>Background<br/>Attacking the Problem<br/>15 DISTRIBUTED FILE SYSTEMS<br/>15.1 SHARING INFORMATION ACROSS<br/>THE NETWORK<br/>Explicit File Copying Systems<br/>, A Seamless File System Interface<br/>Distributing the Work<br/>15.2 REMOTE File Systems<br/>The General Architecture<br/>Block Caching<br/>Crash Recovery<br/>15.3 file-level CACHING<br/>The Andrew File System<br/>The LOCUS File System<br/>15.4 directory Systems AND<br/>THEIR IMPLEWENTATIONS<br/>Filenames<br/>Opening a File<br/>15.5 SUMMARY<br/>15.6 EXERCISES<br/>DISTRIBUTED PROGRAMMING<br/>RUNTIME SYSTEMS<br/>16.1 supporting Distributed Software<br/>WITH middleware<br/>16.2 CUASSIC DISTRIBUTED APPLICATION<br/>PROGRAMS<br/>16.3 MIDDLEWARE SUPPORT FOR CLASSIC<br/>DISTRIBUTED PROGRAMMING<br/>PVM<br/>The Beowulf Cluster Environment<br/>The OSF Distributed Computing Environment<br/>16.4 DISTRIBUTED PROGRAMMING<br/>ON THE WEB<br/>16.5 MlDDl-EWARE SUPPORT FOR MOBII-E CODE<br/>Java and the Java Virtual Machine<br/>The ECMA-33S Common Language Infrastructure<br/>16.6 Summary<br/>16.7 Exercises<br/>DESIGN Strategies<br/>17.1 DESIGN CONSIDERATIONS<br/>Performance, Performance, Performance<br/>Trusted Software<br/>Modularization<br/>Portability<br/>17.2 MONOLITHIC KERNELS<br/>Example: MS-DOS<br/>Example: The UNIX Kernel<br/>17.3 Modular Organization .<br/>£)Mi»p/e; Choices: An Object-Oriented OS<br/>17.4 EXTENSIBLE NUCLEUS, OR MICROKERNEL.<br/>Organization<br/>EMmple: The MACH Operating System<br/>17.B Layered Organizations<br/>17.6 Operating Systems for Distributed<br/>Systems<br/>Network Operating Systems<br/>Example: BSD UNIX<br/>Distributed Operating Systems<br/>Example: The CHORUS Operating System<br/>17.7 Summary<br/>17.8 Exercises<br/>18 The Linux Kernel<br/>18.1 The Linux kernei.<br/>18.2 Kernel Organization<br/>Using Kernel Services<br/>Daemons<br/>Starting the Kernel<br/>Control In the Machine '<br/>18.3 MODUi-ES AND DEVICE MANAGEMENT '<br/>Module Organization<br/>Module Installation and Removal<br/>18.4 PROCESS AND RESOURCE MANAGEMENT<br/>Running the Process Manager<br/>Creating a New Task<br/>IPC and Synchronization<br/>The Scheduler<br/>18.5 MEMORY Manager<br/>THe Virtual Address Space<br/>The Page Fault Handler<br/>18.6 File Management<br/>18.7 SUMMARY<br/>THE WINDOWS NT/2000/XP KERNEL<br/>19.1 INTRODUCTION<br/>19.2 The NT KERNEU<br/>Objects<br/>Threads<br/>Multifirocess Synchronization<br/>Traps, Interrupts, and Exceptions<br/>19.3 the NT EXECUTIVE<br/>Object Manager<br/>Process and Thread Manager<br/>Virtual Memory Manager<br/>I/O Manager<br/>The Cache ManagerChapter 1 Introduction<br/>1. 1 Computers and Software<br/>General System Software<br/>Resource Abstraction<br/>Example: An Abstraction of a Disk Drive<br/>Resource Sharing<br/>Abstract Machines and Transparent Resomce Sharing<br/>Explicit Resource Sharing<br/>1.2 Operating System Strategies<br/>Batch Systems<br/>The User's Perspective<br/>Batch Processing Technology<br/>Example: Batch Files<br/>Timesharing Systems<br/>The User's Perspective<br/>Timesharing Technology<br/>Example: The UNDC Timesharing System<br/>Personal Computers and Workstations<br/>The User's Perspective<br/>OS Technology<br/>Contributions to Modem OS Technology<br/>Example: The Microsoft Windows OS Family<br/>Embedded Systems<br/>The User's Perspective<br/>OS Technology<br/>Contributions to Modem OS Technology<br/>Example: VxWorks<br/>Small, Communicating Computers<br/>The User's Persepective<br/>OS Technology<br/>Example: Windows CE (Pocket PC)<br/>Networks<br/>The Genesis of Modem Operating Systems<br/>1.3 SUMMARY<br/>1.4 Exercises<br/>Operating System<br/>Architecture<br/>2.1 Basic Functions<br/>Device Management<br/>Process, Thread, and Resource Management<br/>Memory Management<br/>File Management<br/>2.2 GENERAL IMPi-EMENTATlON<br/>CONSIDERATIONS<br/>Performance<br/>Exclusive Use of Resources<br/>Processor Modes<br/>Kernels<br/>Requesting Services from the Operating System<br/>Software Modularization<br/>2.3 Contemporary OS Kernels<br/>UNDC Kernels<br/>Btampte: Linux<br/>The Windows NT Executive and Kernel<br/>2.4 SUMMARY<br/>2.5 EXERCISES<br/>Lab Exercise 2.1 Observing OS Behavior<br/>Background<br/>Attacking the Problem<br/>Processes and Threads,<br/>The Task at hand<br/>The Abstract Machine for Classic Processes<br/>Supporting Modem Processes and Threads<br/>Resources<br/>The Process Address Space<br/>OS Families<br/>Process Manager Responsibilities<br/>3.2 The Hardware Process<br/>3. 3 The Abstract machine interface<br/>3.4 The Thread Management<br/>Advantages of Using Threads<br/>Thread Control Block (TCB)<br/>Thread State Diagram<br/>Operations on Therads<br/>Thread Synchronization<br/>Thread Levels<br/>3. 5 The Process Abstraction<br/>Bffampte: Linux Process Descriptor<br/>Example: Windows NT/2000/XP Process<br/>Descriptors<br/>3.6 THE Thread Abstraction<br/>Example: Linux Thread Descriptor<br/>Example: Windows NT/2000/XP Thread Descriptors<br/>3.7 STATE Diagrams<br/>Example: UNDC State Diagram<br/>3.7 Resource managers<br/>3. 8 Generalizing Process Wanagewent policies<br/>Refming the Process Manager<br/>Specializing Resource Allocation Strategies<br/>3.9 SUMMARY<br/>3.10 Exercises<br/>Lab Btercise 3.1 Kernel Timers<br/>Background<br/>Attacking the Problem<br/>Lab Exercise 3.2 Manipulating Kernel<br/>Objects 115<br/>Part A<br/>PartB<br/>Part C<br/>Background<br/>Attacking the Problem<br/>Scheduling<br/>Overview<br/>4.2 SCHEDULING MECHANISMS<br/>The Process Scheduler Organiaation<br/>Saving the Context<br/>Voluntary CPU Sharing<br/>Involuntary CPU Sharing<br/>Performance<br/>4.3 STRATEGY SELECTION<br/>Scheduler Characteristics<br/>A Model to Study Scheduling<br/>Emmpte: Partitioning a Process into<br/>Small Processes<br/>Example: Approximating System Load<br/>4.4 Nonpreemptive Strategies<br/>First-come-first-served<br/>Example: Predicting Wait Times for FCFS<br/>Shortest Job Next<br/>Priority Scheduling<br/>Deadline Scheduling<br/>4.5 PREEMPTIVE STRATEGIES<br/>Round Robin<br/>Multiple-Level Queues<br/>4.6 IMPLEMENTING THE SCHEDULER<br/>Example: The Linux Scheduling Mechanism<br/>Example: BSD UNIX Scheduling Policy<br/>Example: Windows NT/2000/XP Thread<br/>Scheduling<br/>4'7 Summary<br/>4.8 Exercises<br/>Lah Exercise Analyzing the Round Robin<br/>SCHEDULING<br/>Background<br/>Attacking the Problem<br/>Chapter 5 Basic Synchronization Principles<br/>5. 1 COOPERATING PROCESSES<br/>Critical Sections _ .<br/>Deadlock<br/>Resource Sharing<br/>5.2 EVOl-VING FROM THE CLASSIC SOLUTION<br/>5.3 Semaphores; The Basis of modern Solutions<br/>Principles of Operation<br/>Example: Using Semaphores<br/>Practical Considerations<br/>5.4 Synchronization in Shared Memory<br/>Multiprocessors<br/>5.5 Summary<br/>5.6 Exercises<br/>Lab Exercise 5,1 Bounded Buffer Problem<br/>Background<br/>Attacking the Problem<br/>Chafer 6 High-level Synchronization and<br/>Interprocess Communication<br/>6.1 ALTERNATIVE SYNCHRONIZATION PRIMITIVES<br/>AND Synchronization<br/>Example: Using and Synchronization to Solve the Dining<br/>Philosophers Problem<br/>Events<br/>Example: Using Generic Events<br/>Example: Windows NT/2000/XP Dispatcher Objects<br/>6.2 Monitors<br/>Principles of Operation<br/>Condition Variable's<br/>Example: Using^Monitors<br/>Some Practical Aspects of Using Monitors<br/>6.3 INTERPROCESS COMMUNICATION<br/>The Pipe Model<br/>Message Passing Mechanisms<br/>Mailboxes<br/>Message Protocols<br/>Using the send() and receive () Operations<br/>Example: Synchronized IPG<br/>Deferred Message Copying<br/>6.4. SUMMARY<br/>6.5 EXERCISES<br/>Lab Beercise 6.1 Using Pipes<br/>Background<br/>Attacking the Problem<br/>Lab Beercise 6.2 Refining the Shell<br/>Part A<br/>PartB<br/>PartC<br/>PartD<br/>Background<br/>Attacking the Problem<br/>DEADLOCK<br/>BACKOROUNP<br/>Prevention<br/>Avoidance<br/>Detection and Recovery<br/>Manual Deadlock Management<br/>7.2 A System Deadlock Model<br/>Example: Single Resource Type<br/>7.3 PREVENTION<br/>Hold and Wait<br/>Circular Wait<br/>Allowing Preemption<br/>7.4 Avoidance<br/>The Banker's Algorithm<br/>Exahple: Using the Banker's Algorithm<br/>7.5 Detection and Recovery<br/>Serially Reusable Resources<br/>Example: Serially Reusable Resource Graphs<br/>' Consumable Resources<br/>General Resource Systems<br/>Recovery<br/>7.6 SUMMARY<br/>7.7 EXERCISES<br/>BASIC MEMORY MANAGEMENT<br/>The basics<br/>8. 2 The Address Space Abstraction<br/>Managing the Address Space<br/>Example: Static Address Binding<br/>Dynamic Memory for Data Structures<br/>Modem Memory Binding<br/>8.3 MEivioRY Allocation<br/>Fixed-Partition Memory Strategies<br/>Variable-Partition Memory Strategies<br/>Example: The Cost of Moving Programs<br/>Contemporary Allocation Strategies<br/>8.4. DYNAMIC ADDRESS SPACE BINDING<br/>Runtime Boimd Checking: The Isolation Mechanism<br/>8.5 MODERN MEMORY MANAGER STRATEGIES<br/>Swapping<br/>Virtual Memory<br/>Example: Using Cache Memory<br/>Shared-Memory Multiprocessors<br/>8.6 SUMMARY<br/>8.7 EXERCISES<br/>Uh Exercise 8.1 Using Shared memory<br/>Backgroimd<br/>Attacking the Problem<br/>Chapter 9 Basic Virtual Memory<br/>9.1 THE Task AT Hand<br/>9.2 ADDRESS Translation<br/>Address Space Mapping<br/>Segmentation and Paging<br/>10.1<br/>9. 3 Paging<br/>Paging Virtual Address Translation<br/>Example: Contemporary Page Table Implementations<br/>9.4 STATIC PAGING Ai-GORITHMS<br/>The Fetch Policy<br/>Demand Paging Algorithms<br/>Stack Algorithms<br/>Implementing LRU<br/>Paging Performance<br/>9.5 DYNAMIC PAGING ALGORITHMS<br/>The Working Set Algorithm<br/>Example: Working Set Algorithm<br/>Implementing the Working Set Algorithm<br/>Example: Taking Advantage of Paging with IPG<br/>Example: Windows NT/2000/XP Virtual Memory<br/>Example: Linux Virtual Memory<br/>9.6 SEGMENTATION<br/>Address Translation<br/>Implementation<br/>Example: The Multics Segmentation System<br/>9.7 Memory-Mapped Files<br/>9.8 SUMMARY<br/>9.9 exercises<br/>UB Exercise 9.1 Memory-Mapped Files<br/>Backgroimd<br/>Attacking the Problem<br/>DEVICE MANAGEMENT<br/>THE I/O SYSTEM<br/>Device Manager Abstraction<br/>I/O-Processor Overlap within an Application<br/>I/O-Processor Overlap across Threads<br/>10.2 I/O STRATEGIES<br/>Direct I/O with Polling<br/>Interrupt-Driven I/O<br/>Polling Versus Interrupt-Driven I/O Performance<br/>10.3 DEVICE MANAGER DESIGN<br/>Device-dependent Driver Infrastructure Framework<br/>Servicing Interrupts<br/>Example: Linux Device I/O<br/>10.4 BUFFERING<br/>10.5 DEVICE CLASS CHARACTERISTICS<br/>Communication Devices<br/>Example: Asynchronous Serial Devices<br/>Sequentially Accessed Storage Devices<br/>Example: Traditional Magnetic Tape<br/>Randomly Accessed Storage Devices<br/>Example: Magnetic Disk<br/>Example: Optimizing Access on Magnetic Disks<br/>Example: CD-ROM and DVD<br/>10.6 SUMMARY<br/>10.7 EXERCISES<br/>Lab Exercise 10.1 A Floppy Disk Driver<br/>Part A<br/>PartB<br/>Part C<br/>Backgroimd<br/>Attacking the Problem<br/>Chapter 11 File Management<br/>11.1 THE Task at Hand<br/>11.2 Files<br/>Low-level Files<br/>Structured Files<br/>Database Management Systems<br/>Multimedia Storage<br/>11.3 L.OW-LEVEL FILE IMPLEMENTATIONS<br/>„ The 0PEN() and close () Operations<br/>Example: UNIX Open and Close<br/>Block Management<br/>Example: UNIX File Structure<br/>Grampte: The DOS FAT File System<br/>Reading and Writing the Byte Stream<br/>1 1.4 SUPPORTING HiGH-LEVEL Fii-E<br/>ABSTRACTIONS<br/>Structured Sequential Files<br/>Indexed Sequential Files<br/>Database Management Systems<br/>Multimedia Documents<br/>11.5 DIRECTORIES<br/>Directory Stinctures<br/>Example: Some Directory Approaches<br/>11.6 Implementing Directories<br/>Directory Entries<br/>Opening a File<br/>11.7 File Systems<br/>Example: The ISO 9660 File System<br/>Mounting File Systems<br/>Heterogeneous File Systems<br/>11.8 SUMMARY<br/>1 1 .9 EXERCISES<br/>Lab Bcercise 11.1 A Simple File Manager<br/>Part A<br/>PartB<br/>PartC<br/>Backgroimd<br/>Attacking the Problem<br/>PROTECTION AND SECURITY<br/>12.1 The Problem<br/>The Goal-<br/>Policy and Mechanism<br/>Context for Protection and Security<br/>The Cost of Protection Mechanisms<br/>12.2 Authentication<br/>External User Authentication<br/>Example: Windows NT/2000/XP User Authentication<br/>Internal Thread/Process Authentication<br/>Authentication in the Network<br/>Software Authentication<br/>12.3 AUTHORIZATION U\J y<br/>Ad Hoc Authorization Mechanisms<br/>A General Model for Authorization<br/>Implementing Security Policies<br/>Implementing General Authorization Mechanisms<br/>Protection Domains<br/>Implementing the Access Matrix<br/>12.4 CRYPTOGRAPHY<br/>The Big Picture<br/>Private Key Encryption<br/>Public Key Encryption<br/>Example: PGP Encryption<br/>Internet Content Delivery<br/>12.5 SUMMARY<br/>12.6 Exercises<br/>Networks<br/>From Computer Cowiviunications<br/>TO NETWORKS<br/>Switched Networks<br/>Network Hardware Requirements<br/>Network Software Requirements<br/>13.2 THE ISO OSI NETWORK ARCHITECTURE<br/>MODEL<br/>The Evolution of Network Protocols<br/>The ISO OSI Model<br/>13.3 media access Control (MAC)<br/>PROTOCOLS<br/>The Physical Layer<br/>Example: Fast Physical Layers<br/>The Data Link Layer<br/>Contemporary Networks<br/>13.4 THE Network layer :<br/>Internet Addresses<br/>Routing<br/>Using the Network Layer<br/>Example: Latency in the Internet<br/>13.5 The Transport L.AYER<br/>Communication Ports<br/>Data Types<br/>Reliable Communication<br/>Example: Datagrams and Virtual Circuits Performance<br/>13.6 USING THE TRANSPORT LAYER<br/>Naming and Addresses<br/>Example: The Domain Name Service<br/>The Client-Server Model<br/>13.7 NETWORK SECURITY<br/>Transport Layer Security: Firewalls<br/>Network Layer Security: IPSEC<br/>13.8 SUMMARY<br/>13.9 Exercises :<br/>ImB Exercise 13.1 Using TCP/IP<br/>Background<br/>Example: The WinSock Package<br/>Attacking the Problem<br/>H Distributed System Overview<br/>14.1 DISTRIBUTED OS MECHANISMS<br/>14.2 DISTRIBUTED PRIMARY MEMORY<br/>Remote Memory<br/>Example: The Linda Programming Language<br/>Distributed Shared Memory<br/>14.3 remote.Procedure call<br/>How Does RPC Work?<br/>Implementing RPC<br/>14.4 REMOTE OBJECTS<br/>The Emerald System<br/>CORBA<br/>Java Remote Objects<br/>14.5 Distributing Process Management<br/>General Process Management<br/>Process and Thread Creation<br/>Scheduling<br/>Migration and Load Balancing<br/>Distributed Synchronization<br/>14.6 SUMMARY<br/>14.7 EXERCISES<br/>LaB Exercise 74.1 Using Remote Procedure<br/>CALL<br/>Background<br/>Attacking the Problem<br/>15 DISTRIBUTED FILE SYSTEMS<br/>15.1 SHARING INFORMATION ACROSS<br/>THE NETWORK<br/>Explicit File Copying Systems<br/>, A Seamless File System Interface<br/>Distributing the Work<br/>15.2 REMOTE File Systems<br/>The General Architecture<br/>Block Caching<br/>Crash Recovery<br/>15.3 file-level CACHING<br/>The Andrew File System<br/>The LOCUS File System<br/>15.4 directory Systems AND<br/>THEIR IMPLEWENTATIONS<br/>Filenames<br/>Opening a File<br/>15.5 SUMMARY<br/>15.6 EXERCISES<br/>DISTRIBUTED PROGRAMMING<br/>RUNTIME SYSTEMS<br/>16.1 supporting Distributed Software<br/>WITH middleware<br/>16.2 CUASSIC DISTRIBUTED APPLICATION<br/>PROGRAMS<br/>16.3 MIDDLEWARE SUPPORT FOR CLASSIC<br/>DISTRIBUTED PROGRAMMING<br/>PVM<br/>The Beowulf Cluster Environment<br/>The OSF Distributed Computing Environment<br/>16.4 DISTRIBUTED PROGRAMMING<br/>ON THE WEB<br/>16.5 MlDDl-EWARE SUPPORT FOR MOBII-E CODE<br/>Java and the Java Virtual Machine<br/>The ECMA-33S Common Language Infrastructure<br/>16.6 Summary<br/>16.7 Exercises<br/>DESIGN Strategies<br/>17.1 DESIGN CONSIDERATIONS<br/>Performance, Performance, Performance<br/>Trusted Software<br/>Modularization<br/>Portability<br/>17.2 MONOLITHIC KERNELS<br/>Example: MS-DOS<br/>Example: The UNIX Kernel<br/>17.3 Modular Organization .<br/>£)Mi»p/e; Choices: An Object-Oriented OS<br/>17.4 EXTENSIBLE NUCLEUS, OR MICROKERNEL.<br/>Organization<br/>EMmple: The MACH Operating System<br/>17.B Layered Organizations<br/>17.6 Operating Systems for Distributed<br/>Systems<br/>Network Operating Systems<br/>Example: BSD UNIX<br/>Distributed Operating Systems<br/>Example: The CHORUS Operating System<br/>17.7 Summary<br/>17.8 Exercises<br/>18 The Linux Kernel<br/>18.1 The Linux kernei.<br/>18.2 Kernel Organization<br/>Using Kernel Services<br/>Daemons<br/>Starting the Kernel<br/>Control In the Machine '<br/>18.3 MODUi-ES AND DEVICE MANAGEMENT '<br/>Module Organization<br/>Module Installation and Removal<br/>18.4 PROCESS AND RESOURCE MANAGEMENT<br/>Running the Process Manager<br/>Creating a New Task<br/>IPC and Synchronization<br/>The Scheduler<br/>18.5 MEMORY Manager<br/>THe Virtual Address Space<br/>The Page Fault Handler<br/>18.6 File Management<br/>18.7 SUMMARY<br/>THE WINDOWS NT/2000/XP KERNEL<br/>19.1 INTRODUCTION<br/>19.2 The NT KERNEU<br/>Objects<br/>Threads<br/>Multifirocess Synchronization<br/>Traps, Interrupts, and Exceptions<br/>19.3 the NT EXECUTIVE<br/>Object Manager<br/>Process and Thread Manager<br/>Virtual Memory Manager<br/>I/O Manager<br/>The Cache Manager
650 ## - SUBJECT
Keyword	System Programme
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type	General Books

Holdings
Withdrawn status	Lost status	Damaged status	Not for loan	Home library	Current library	Shelving location	Date acquired	Full call number	Accession number	Date last seen	Date last checked out	Koha item type
				Central Library, Sikkim University	Central Library, Sikkim University	General Book Section	31/05/2016	005.43 NUT/O	P20689	07/06/2019	07/06/2019	General Books