book

Principles of Modern Operating Systems, 2nd Edition

by Jose M Garrido, Richard Schlesinger, Kenneth Hoganson

October 2011

Intermediate to advanced

544 pages

16h 48m

English

Jones & Bartlett Learning

Read now

Unlock full access

Cover
Title
Copyright
Contents (1/3)
Contents (2/3)
Contents (3/3)
Preface
1 Basic Concepts of Operating Systems
1.1 Introduction1.1.1 Software Components
1.2 Operating Systems
1.2.1 Operating System Interfaces

1.2.2 Multi-Level Views of an Operating System
1.3 Categories of Operating Systems
1.4 Small and Specialized Operating Systems
1.5 Brief History of Operating Systems
1.6 Contemporary Operating Systems
1.6.1 Unix
1.6.2 Microsoft Windows
1.6.3 Mac OS1.7 64-bit Operating Systems
1.7.1 Microsoft 64-bit Windows 7
1.7.2 Mac OS X1.8 Summary
Exercises and Questions
2 Processes and Threads
2.1 Introduction2.2 Processes
2.2.1 Process States
2.2.2 Process Descriptor
2.3 Threads
2.3.1 Multithreading
2.3.2 User-Level Threads
2.3.3 Kernel-Level Threads
2.3.4 Java Threads
2.4 POSIX Threads
2.4.1 Creating POSIX Threads
2.4.2 Basic Synchronization of Pthreads
2.4.3 Scheduling and Priorities of POSIX Threads
2.5 Multiprogramming
2.5.1 CPU and I/O Requests
2.5.2 Interrupting Processes
2.5.3 Context Switch
2.6 Summary
Exercises and Questions
3 System Performance and Models
3.1 Introduction3.2 General Concepts of Modeling
3.3 Simple Models of Computer Systems
3.4 Performance of Computer Systems
3.4.1 Performance Metrics
3.4.2 Workload and System Parameters
3.5 Simulation Models
3.5.1 Types of Simulation Models
3.5.2 Discrete-Event Models
3.5.3 Stochastic Models
3.6 A Model of the Simple Batch System
3.6.1 Description of the Model
3.6.2 Implementations of the Model
3.6.3 Simulation Output of the Console Implementation (1/2)
3.6.3 Simulation Output of the Console Implementation (2/2)
3.6.4 Output of the GUI Implementation
3.7 System Capacity and Bottleneck
3.8 Summary
Exercises and Questions
4 Systems with Multiprogramming
4.1 Introduction4.2 Systems with Multiple Stations
4.2.1 CPU and I/O Bursts
4.2.2 Overlapping of CPU and I/O Processing
4.2.3 Context Switches
4.3 Studying Systems with Multiprogramming4.3.1 Model of a System with Multiprogramming
4.3.2 Model of a System Without Multiprogramming
4.3.3 Comparison of the Two Models
4.3.4 Models with GUI and Graphical Animation
4.4 Summary
Exercises and Questions
5 Processor Scheduling
5.1 Introduction
5.2 General Types of Scheduling
5.3 Processor Scheduling Concepts
5.3.1 The CPU Scheduler
5.3.2 Scheduling Multiple Classes of Processes
5.4 CPU Scheduling Policies
5.4.1 First-Come-First-Served (1/2)
5.4.1 First-Come-First-Served (2/2)
5.4.2 Shortest Process Next (1/2)
5.4.2 Shortest Process Next (2/2)
5.4.3 Round Robin Scheduling (1/2)
5.4.3 Round Robin Scheduling (2/2)
5.4.4 Shortest Remaining Time (1/2)
5.4.4 Shortest Remaining Time (2/2)
5.4.5 Brief Comparison of the Four Scheduling Policies
5.4.6 Dynamic Priority Scheduling
5.4.7 Other Scheduling Policies
5.5 Multiprocessor Systems
5.6 Summary
Exercises and Questions
6 Synchronization Principles
6.1 Introduction6.2 Basic Synchronization Principles
6.2.1 No Synchronization
6.2.2 Mutual Exclusion6.2.3 Critical Sections
6.3 Approaches for Implementing Synchronization
6.4 Semaphores
6.5 Synchronization with Semaphores
6.5.1 Critical Section Problem
6.5.2 Event Ordering
6.6 Synchronization Case Studies
6.6.1 The Bounded-Buffer Problem
6.6.2 Synchronization with Semaphores in Java
6.6.3 Simulation Models of the Bounded-Buffer Problem
6.6.4 The Readers-Writers Problem
6.6.5 Simulation Models of the Readers-Writers Problem
6.7 POSIX Threads
6.7.1 Creating POSIX Threads
6.7.2 Basic Synchronization of Pthreads
6.7.3 Mutual Exclusion
6.7.4 Semaphores
6.8 Monitors
6.8.1 Synchronization with Monitors
6.8.2 The Producer-Consumer Problem with a Monitor
6.8.3 Monitor Synchronization with Java
6.8.4 Simulation Models Using Monitors
6.9 Interprocess Communication
6.9.1 Asynchronous Communication
6.9.2 Simulation Model for Asynchronous Communication
6.9.3 Synchronous Communication
6.9.4 Simulation Model for Synchronous Communication
6.10 Atomic Transactions
6.11 Summary
Exercises and Questions
7 Deadlocks
7.1 Introduction7.2 Basic Principles of Deadlock
7.2.1 Resource Allocation Graph
7.2.2 Conditions for the Existence of Deadlock
7.3 The Dining Philosophers
7.3.1 Modeling Deadlock
7.3.2 Informal Solution to Deadlock
7.4 Methods for Handling Deadlock
7.5 Deadlock Prevention
7.5.1 Disallowing Hold and Wait
7.5.2 Disallowing Circular Wait
7.5.3 Model with Graphical Animation
7.6 Deadlock Avoidance
7.6.1 Banker’s Algorithm7.6.2 Applying the Banker’s Algorithm
7.7 Deadlock Detection and Recovery
7.7.1 Deadlock Detection
7.7.2 Recovery
7.8 Summary
Exercises and Questions
8 File Management
8.1 Introduction8.2 Files
8.2.1 File Attributes
8.2.2 Folders
8.2.3 Pathnames
8.3 Access Methods
8.3.1 Open
8.3.2 Close
8.3.3 Read
8.3.4 Write
8.3.5 Sequential Access
8.3.6 Streams, Pipes, and I/O Redirection
8.3.7 Other I/O System Calls
8.4 Directory Functions8.5 File Space Allocation
8.5.1 Cluster Allocation
8.5.2 Calculating Read/Write Addresses
8.5.3 Free Space Management
8.5.4 Disk Fragmentation
8.5.5 Reliability of Disk Space Management
8.6 Real-World Systems
8.6.1 Microsoft FAT System
8.6.2 Microsoft NTFS System
8.6.3 Linux Ext2 and Ext3 Systems
8.6.4 Mac OS X HFS+ Systems
8.6.5 Other File Systems
8.7 Virtual File System
8.8 Removable Media
8.9 Seeing the Future Now
8.10 Summary
Exercises and Questions
9 The I/O System
9.1 Introduction9.2 I/O Hardware
9.2.1 Direct Memory Access
9.2.2 Hard Disk Drives
9.2.3 Solid State Disks
9.3 Device I/O Structure
9.3.1 Intelligent Buses
9.3.2 Handling Multiple Devices Simultaneously
9.4 I/O Performance Optimization
9.4.1 Reducing the Number of I/O Requests
9.4.2 Buffering and Caching
9.4.3 I/O Scheduling
9.5 Hard Disk I/O Scheduling
9.5.1 First-Come First-Served Algorithm
9.5.2 Shortest Seek Time First Algorithm
9.5.3 Elevator (SCAN) Algorithm
9.5.4 Circular Scan Algorithm
9.5.5 Optimizing Rotational Latency
9.5.6 Interaction of Disk Scheduling and Other System Functions
9.6 System Configuration
9.7 Hard Disk Scheduling Simulation Model
9.8 Summary
Exercises and Questions
10 Memory Management
10.1 Introduction
10.2 Process Address Space
10.2.1 Binding
10.2.2 Static and Dynamic Loading
10.2.3 Static and Dynamic Linking10.3 Contiguous Memory Allocation
10.3.1 Fixed Partitions
10.3.2 Dynamic Partitions
10.3.3 Swapping
10.4 Noncontiguous Memory Allocation
10.4.1 Paging
10.4.2 Segmentation
10.5 Virtual Memory
10.5.1 Basic Concepts
10.5.2 Process Locality
10.5.3 Using Segments
10.5.4 Memory Protection
10.5.5 Shared Memory
10.5.6 Address Translation
10.5.7 Page Size Considerations
10.6 Paging with Virtual Memory
10.6.1 Paging Policies
10.6.2 Frame Allocation
10.6.3 Page Faults and Performance Issues
10.7 Paging Algorithms
10.7.1 Static Paging Algorithms
10.7.2 Dynamic Paging Algorithms
10.8 Thrashing
10.8.1 Combining Paging with Segmentation
10.9 Summary
Exercises and Questions
11 Security and Protection
11.1 Introduction
11.2 Problems of Security
11.3 Security and Protection Components
11.3.1 Physical Security11.3.2 User Authentication
11.3.3 Protection (1/2)
11.3.3 Protection (2/2)
11.3.4 Secure Communications
11.3.5 Digital Certificates
11.3.6 People
11.4 System Vulnerabilities11.4.1 Social Engineering11.4.2 Trojan Horse Programs
11.4.3 Spyware
11.4.4 Trap Doors11.4.5 Database Access Vulnerabilities11.4.6 Buffer and Stack Overflow
11.5 Invasive and Malicious Software
11.6 Defending the System and the User
11.7 Intrusion Detection Management
11.8 Security and Privacy
11.9 Secure Systems Versus Systems Security
11.10 Summary
Exercises and Questions
12 Networking and Distributed Systems
12.1 Introduction
12.2 Ethernet
12.3 Internetworking and TCP/IP
12.3.1 Connection Oriented Versus Connectionless
12.3.2 Streaming Data
12.4 World Wide Web
12.5 DNS and DHCP
12.5.1 DNS Caching
12.5.2 DHCP
12.6 Parallel Computing
12.6.1 Simple Model of Parallel Speedup
12.6.2 Limitations of Parallel Speedup
12.6.3 Multiple Levels of Parallelism
12.7 Cluster and Grid Computing (1/2)
12.7 Cluster and Grid Computing (2/2)
12.8 Distributed Application Technologies
12.8.1 Distributed Software Architectures
12.8.2 Software Interface: ODBC
Exercises and Questions
13 Virtual Machines
13.1 Introduction
13.2 Overall Virtual Machine Structure
13.3 Hardware Interface
13.3.1 Instruction Execution
13.3.2 Software Trap Handling
13.3.3 Device Input/Output
13.3.4 Memory Management
13.4 Hardware Enhancements
13.4.1 Additional Execution Modes
13.4.2 Memory Mapping Enhancements
13.5 Mapping Devices to Host OS Structures
13.6 Unmapped Devices
13.7 Virtual Machine Integration
13.8 Summary
Exercises and Questions
Appendix A Introduction to Using Linux
A.1 Introduction
A.2 Command-Line Interface
A.3 Files and Directories
A.3.1 Specifying Paths
A.3.2 Wildcards
A.4 Basic CommandsA.4.1 The passwd Command
A.4.2 The man Command
A.4.3 The ls Command
A.4.4 The cp Command
A.4.5 The mv Command
A.4.6 The rm Command
A.4.7 The cd Command
A.4.8 The mkdir Command
A.4.9 The rmdir Command
A.4.10 I/O Redirection and Pipe Operators
A.5 Shell Variables
A.5.1 The pwd Command
A.5.2 The more Command
A.5.3 The exit CommandA.6 Text Editing
A.7 File Access Permissions
A.8 The cat Command
A.9 Commands for Process Control
A.10 Foreground and Background Processes
A.11 Script Files
A.11.1 Comments in ScriptsA.11.2 Positional Parameters
A.11.3 Command Substitution
A.11.4 The test Command
A.11.5 The if and the test Commands
A.11.6 The set Command
A.11.7 Mutibranch with the if Command
A.11.8 Repetition with the for Command
A.11.9 Repetition with the while Command
A.12 Searching Data in Files
A.13 Evaluating Expressions
A.14 Connecting to a Remote Linux Server
A.14.1 The Putty Program
A.14.2 SSH Client
A.14.3 X-Window and Graphical Desktops
A.14.4 Using the K Desktop Environment
Appendix B Java and POSIX Threads
B.1 IntroductionB.2 Threads
B.3 Object-Oriented Concepts and Threads in Java
B.3.1 Inheritance
B.3.2 Abstract Classes
B.3.3 Polymorphism
B.3.4 Classes and Interfaces
B.3.5 Exceptions
B.3.6 Java Threads (1/2)
B.3.6 Java Threads (2/2)
B.4 POSIX Threads
B.4.1 Creating POSIX Threads
B.4.2 Basic Synchronization of Pthreads
B.4.3 Mutual Exclusion
B.4.4 Semaphores
B.4.5 Condition Variables
B.4.6 Scheduling and Priorities of POSIX Threads
Appendix C The Java Modeling Framework
C.1 Introduction
C.2 Basic Structure of a Model
C.2.1 Simulation ModelC.2.2 Input Parameters
C.2.3 Class Input
C.2.4 Class UI
C.2.5 ProcessesC.2.6 The RequestProcessorC.2.7 Request
C.2.8 Schedular
C.2.9 The IncomingRequestGenerator Class
C.2.10 ResourceManager
C.2.11 The Output ClassC.2.12 Simulation DisplayC.2.13 The Plotter Class
C.2.14 The QPlotter Subclass
C.2.15 AnimationC.2.16 The QGraphic Abstract Class
C.2.17 The SchedularGraphic Concrete Subclass
C.2.18 Random Number Generator Classes
C.2.19 The Statistic Class
C.3 Java Coding Recommendations
C.4 The Simulation Package on CD-ROMC.4.1 Files on the CD-ROMC.4.2 Compiling with Java and the PsimJ Library
C.4.3 Example Program (1/5)
C.4.3 Example Program (2/5)
C.4.3 Example Program (3/5)
C.4.3 Example Program (4/5)
C.4.3 Example Program (5/5)
Appendix D Psim3
D.1 The Psim3 LibraryD.1.1 The Time Dimension
D.1.2 Defining Active Objects
D.1.3 Running a Simulation
D.1.4 Features in Class process
D.1.5 Scheduling a Process
D.1.6 Suspending a ProcessD.1.7 Interrupting a Process
D.1.8 Terminating a Process
D.2 The Queue Library
D.2.1 General DescriptionD.2.2 Features of Class squeue
D.2.3 Features of Class pqueue
D.3 The Resource Library
D.3.1 General Description
D.3.2 Relevant Features of the res Class
D.3.3 Features in Class bin
D.4 The waitq Class
D.5 The condq Class
D.6 Random Numbers
D.6.1 Class randint
D.6.2 Class erand
D.6.3 Class normal
D.6.4 Class poisson
D.6.5 Class urand
D.7 The Simulation Package on CD-ROM
D.7.1 Files on the CD-ROM
D.7.2 Brief Instructions for Compiling and Linking
Appendix E Overview of Probability Theory
E.1 IntroductionE.2 Basic Concepts
E.3 Probability of an Event
E.4 Random Numbers
E.5 Probability Distribution Functions
E.5.1 The Geometric Distribution
E.5.2 The Binomial Distribution
E.5.3 The Exponential Distribution
E.5.4 The Poisson Distribution
E.5.5 The Uniform Distribution
E.5.6 The Normal Distribution
E.6 Statistics
E.7 Analyzing Sample Data
E.8 State-Dependent Models
E.8.1 State DependenceE.8.2 Stochastic Matrices
Appendix F Using the C++ Models
F.1 Using Linux
F.2 Using Unix (Sun Solaris)
F.3 Using Microsoft Windows
Appendix G The Computer System: An Overview
G.1 Computer System Components
G.2 The Central Processing Unit (CPU)
G.3 Computer Instructions
G.4 Fetch/Decode/Execute/Interrupt Cycle
G.5 Simple Computer Instructions
G.6 Computer Architecture Layers
G.7 Operating Systems
G.7.1 Manage the Resources of the Computer System
G.7.2 Provide a User Interface
G.7.3 Provide a Programming Interface
G.7.4 Process Execution Mode
G.7.5 Provide a Networking Interface
G.8 Language Translation
G.8.1 Assembly Language
G.8.2 High-Level Languages
G.8.3 Byte Code and the Virtual Machine
G.9 CPU Internal Structure
G.9.1 Adding the System Bus Interface
G.9.2 Supporting the Instruction Fetch
G.9.3 Detailed Program Execution
G.10 CPU Performance Enhancement: Pipeline
G.11 System Performance Enhancement: Cache
G.11.1 The Need for Cache
G.11.2 Cache Performance
G.11.3 Fully Associative Cache
Exercises and Questions
Bibliography
Index (1/2)
Index (2/2)

Content preview from Principles of Modern Operating Systems, 2nd Edition

12.6 Parallel Computing 349

Efficiency

0.8

0.6

0.4

0.2

Diminishing Returns of

Parallel Speedup

Number of Processors

(

)

24 81632

0.99

0.95

0.9

0.8

Figure 12.5 Diminishing returns of parallel speedup.

Figure 12.5 illustrates the problem with diminishing returns from parallel process-

ing. The ﬁgure charts the eﬃciency (the parallel speedup divided by the number of

processors used) that results with four applications that have diﬀerent parallel frac-

tions of work. As increasing numbers of processors are allocated to the task, the overall

eﬃciency declines dramatically. Parallel fractions from 99% to 80% are illustrated. Ap-

plications with parallel fractions ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781449626341

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Principles of Modern Operating Systems, 2nd Edition

by Jose M Garrido, Richard Schlesinger, Kenneth Hoganson

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

More than 5,000 organizations count on O’Reilly

Julian F.

Addison B.

Amir M.

Mark W.

You might also like

Operating System Design, 2nd Edition

Operating Systems in Depth

Storage Systems

Modern C

Publisher Resources