Home > Store

Operating Systems: Internals and Design Principles, 7th Edition

Register your product to gain access to bonus material or receive a coupon.

Operating Systems: Internals and Design Principles, 7th Edition

Custom Published Book

  • Sorry, this book is no longer in print.
Not for Sale

About

Features

Makes extensive use of a number of tools to boost student understanding critical basic concepts. This includes describing algorithms using plain English and C++ language fragments, the liberal use of illustrations, and an effort to avoid formal proofs.

Running case studies focused on how specific operating systems implement specific concepts are embedded throughout the text instead of end of book case studies. This enhances the student understanding of relevant concepts at the point of study.

A copy of all algorithms in an easy-to-read Pascal pseudocode is available on the author’s Web site.

Several types of projects are supported by the text, including:

Simulations, which students access via the Web, with no programming or platform involved.

Small projects, designed to take a week or two to complete.

Two major programming projects, one to build a shell (or command line interpreter) and one to build a process dispatcher, are included. The text describes the projects, and step-by-step exercises are included at the Instructors Resource Center. The exercises can be uploaded to the instructor’s Web site.

—A more extensive set of seven programming projects provide for more substantial two-person assignments

Projects are evenly split between system-level projects and kernel-level projects.

Detailed treatment of threads — one of the most important developments in operating systems — is included. The text helps students to understand the relationship between process and thread and the way in which threads are managed and used.

A unique comprehensive treatment of scheduling covers key recent developments in scheduling theory and design in the areas of multiprocessor scheduling and real-time scheduling.

Comprehensive, unified treatment of I/O offers broad and thorough coverage of this critical part of any operating system.

Companion Website — Access textbook-related resources and support materials for students and instructors maintained by the author.

Student Resource Site — Access a wealth of computer science-related information including mathematics reviews, how-to documents, research resources, and career explorations maintained by the author.

Description

  • Copyright 2012
  • Dimensions: 7" x 9-1/8"
  • Pages: 816
  • Edition: 7th
  • Custom Published Book
  • ISBN-10: 0-13-230998-X
  • ISBN-13: 978-0-13-230998-1

Operating Systems: Internals and Design Principles, 7e is ideal for introductory courses on operating systems.

Operating Systems: Internals and Design Principles provides a comprehensive and unified introduction to operating systems topics. Stallings emphasizes both design issues and fundamental principles in contemporary systems and gives readers a solid understanding of the key structures and mechanisms of operating systems. He discusses design trade-offs and the practical decisions affecting design, performance and security. The book illustrates and reinforces design concepts and ties them to real-world design choices through the use of case studies in UNIX and Windows.

Operating Systems: Internals and Design Principles, 6e received the 2009 Textbook Excellence Award from the Text and Academic Authors Association (TAA)!

Sample Content

Table of Contents

Preface

About the Author Chapter 0   Reader's and Instructor's Guide

0.1          Outline of the Book

0.2          A Roadmap for Readers and Instructors

0.3          Internet and Web Resources

PART ONE: BACKGROUND Chapter 1: Computer System Overview

1.1          Basic Elements

1.2          Evolution of the Microprocessor

1.3          Instruction Execution

1.4          Interrupts

1.5          The Memory Hierarchy

1.6          Cache Memory

1.7          Direct Memory Access

1.8          Multiprocessor and Multicore Organization

1.9          Recommended Reading and Web Sites

1.10        Key Terms, Review Questions, and Problems

Appendix 1A       Performance Characteristics of Two-Level Memory

Appendix 1B       Procedure Control

Chapter 2: Operating System Overview

2.1          Operating System Objectives and Functions

2.2          The Evolution of Operating Systems

2.3          Major Achievements

2.4          Developments Leading to Modern Operating Systems

2.5          Virtual Machines

2.6          OS Design Considerations for Multiprocessor and Multicore

2.7          Microsoft Windows Overview

2.8          Traditional UNIX Systems

2.9          Modern UNIX Systems

2.10        Linux

2.11        Recommended Reading and Web Sites

2.12        Key Terms, Review Questions, and Problems

PART TWO: PROCESSES Chapter 3: Process Description and Control

3.1          What is a Process?

3.2          Process States

3.3          Process Description

3.4          Process Control

3.5          Execution of the Operating System

3.6          Security Issues

3.7          UNIX SVR4 Process Management

3.8          Summary

3.9          Recommended Reading

3.10        Key Terms, Review Questions, and Problems

Chapter 4: Threads

4.1          Processes and Threads

4.2          Types of Threads

4.3          Multicore and Multithreading

4.4          Windows 7 Thread and SMP Management

4.5          Solaris Thread and SMP Management

4.6          Linux Process and Thread Management

4.7          Mac OS X Grand Central Dispatch

4.8          Summary

4.9          Recommended Reading

4.10        Key Terms, Review Questions, and Problems

Chapter 5: Concurrency: Mutual Exclusion and Synchronization

5.1          Principles of Concurrency

5.2          Mutual Exclusion: Hardware Support

5.3          Semaphores

5.4          Monitors

5.5          Message Passing

5.6          Readers/Writers Problem

5.7          Summary

5.8          Recommended Reading

5.9          Key Terms, Review Questions, and Problems

Chapter 6: Concurrency: Deadlock and Starvation

6.1          Principles of Deadlock

6.2          Deadlock Prevention

6.3          Deadlock Avoidance

6.4          Deadlock Detection

6.5          An Integrated Deadlock Strategy

6.6          Dining Philosophers Problem

6.7          UNIX Concurrency Mechanisms

6.8          Linux Kernel Concurrency Mechanisms

6.9          Solaris Thread Synchronization Primitives

6.10        Windows 7 Concurrency Mechanisms

6.11        Summary

6.12        Recommended Reading

6.13        Key Terms, Review Questions, and Problems

PART THREE: MEMORY Chapter 7: Memory Management

7.1          Memory Management Requirements

7.2          Memory Partitioning

7.3          Paging

7.4          Segmentation

7.5          Security Issues

7.6          Summary

7.7          Recommended Reading

7.8          Key Terms, Review Questions, and Problems

Appendix 7A  Loading and Linking

Chapter 8: Virtual Memory

8.1          Hardware and Control Structures

8.2          Operating System Software

8.3          UNIX and Solaris Memory Management

8.4          Linux Memory Management

8.5          Windows 7 Memory Management

8.6          Summary

8.7          Recommended Reading and Web Sites

8.8          Key Terms, Review Questions, and Problems

PART FOUR: SCHEDULING Chapter 9: Uniprocessor Scheduling

9.1          Types of Scheduling

9.2          Scheduling Algorithms

9.3          Traditional UNIX Scheduling

9.4          Summary

9.5          Recommended Reading

9.6          Key Terms, Review Questions, and Problems

Appendix 9A       Response Time

Appendix 9B       Queuing Systems

Chapter 10: Multiprocessor and Real-Time Scheduling

10.1        Multiprocessor Scheduling

10.2        Real-Time Scheduling

10.3        Linux Scheduling

10.4        UNIX FreeBSD Scheduling

10.5        Windows 7 Scheduling

10.6        Summary

10.7        Recommended Reading

10.8        Key Terms, Review Questions, and Problems

PART FIVE: INPUT/OUTPUT AND FILES Chapter 11: I/O Management and Disk Scheduling

11.1        I/O Devices

11.2        Organization of the I/O Function

11.3        Operating System Design Issues

11.4        I/O Buffering

11.5        Disk Scheduling

11.6        RAID

11.7        Disk Cache

11.8        UNIX FreeBSD I/O

11.9        Linux I/O

11.10      Windows 7 I/O

11.11      Summary

11.12      Recommended Reading

11.13      Key Terms, Review Questions, and Problems

Appendix 11A Disk Storage Devices

Chapter 12: File Management

12.1        Overview

12.2        File Organization and Access

12.3        File Directories

12.4        File Sharing

12.5        Record Blocking

12.6        Secondary Storage Management

12.7        File System Security

12.8        UNIX File Management

12.9        Linux File Management

12.10      Windows 7 File System

12.11      Summary

12.12      Recommended Reading

12.13      Key Terms, Review Questions, and Problems

PART SIX: EMBEDDED SYSTEMS Chapter 13: Embedded Operating Systems

13.1        Embedded Systems

13.2        Characteristics of Embedded Operating Systems

13.3        eCOS

13.4        TinyOS

13.5        Recommended Reading and Web Sites

13.6        Key Terms, Review Questions, and Problems

PART SEVEN: SECURITY Chapter 14: Computer Security Threats

14.1        Computer Security Concepts

14.2        Threats, Attacks, and Assets

14.3        Intruders

14.4        Malicious Software Overview

14.5        Viruses, Worms, and Bots

14.6        Rootkits

14.7        Summary

14.8        Recommended Reading

14.9        Key Terms, Review Questions, and Problems

Chapter 15: Computer Security Techniques

15.1        Authentication

15.2        Access Control

15.3        Intrusion Detection

15.4        Malware Defense

15.5        Dealing with Buffer Overflow Attacks

15.6        Windows 7 Security

15.7        Summary

15.8        Recommended Reading

15.9        Key Terms, Review Questions, and Problems

PART EIGHT: DISTRIBUTED SYSTEMS

Chapter 16: Distributed Processing, Client/Server, and Clusters

16.1        Client/Server Computing

16.2        Distributed Message Passing

16.3        Remote Procedure Calls

16.4        Clusters

16.5        Windows 7 Cluster Server

16.6        Sun Cluster

16.7        Beowulf and Linux Clusters

16.8        Summary

16.9        Recommended Reading

16.10      Key Terms, Review Questions, and Problems

APPENDICES Appendix A: Topics in Concurrency

A.1         Mutual Exclusion: Software Approaches

A.2         Race Conditions and Semaphores

A.3         A Barbershop Problem

A.4         Problems

Appendix B: Programming and Operating System Projects

B.1          Animations and Animation Projects

B.2          Simulations

B.3          Programming Projects

B.4          Research Projects

B.5          Reading/Report Assignments

B.6          Writing Assignments

B.7          Documentation Projects

B.8          BACI and Nachos

References Index ONLINE CHAPTERS AND APPENDICES Chapter 17: Networking

17.1        The Need for a Protocol Architecture

17.2        The TCP/IP Protocol Architecture

17.3        Sockets

17.4        Linux Networking

17.5        Summary

17.6        Recommended Reading and Web Sites

17.7        Key Terms, Review Questions, and Problems

Appendix 17A  The Trivial File Transfer Protocol

Chapter 18: Distributed Process Management

18.1        Process Migration

18.2        Distributed Global States

18.3        Distributed Mutual Exclusion

18.4        Distributed Deadlock

18.5        Summary

18.6        Recommended Reading

18.7        Key Terms, Review Questions, and Problems

Chapter 19: Overview of Probability and Stochastic Processes

19.1        Probability

19.2        Random Variables

19.3        Elementary Concepts of Stochastic Processes

19.4        Recommended Reading and Web Sites

19.5        Key Terms, Review Questions, and Problems

Chapter 20: Queuing Analysis

20.1        How Queues Behave–A Simple Example

20.2        Why Queuing Analysis?

20.3        Queuing Models

20.4        Single-Server Queues

20.5        Multiserver Queues

20.6        Examples

20.7        Queues with Priorities

20.8      Networks of Queues

20.9        Other Queuing Models

20.10      Estimating Model Parameters

20.11      Recommended Reading and Web Sites

20.12      Key Terms, Review Questions, and Problems

Programming Project One: Developing a Shell Programming Project Two: The HOST Dispatcher Shell Appendix C: Topics in Computer Organization

C.1         Processor Registers
C.2         Instruction Execution
C.3         I/O Communication Techniques

C.4         Hardware Performance Issues and Multicore Organization

Appendix D: Object-Oriented Design

D.1         Motivation

D.2         Object-Oriented Concepts

D.3         Benefits of Object-Oriented Design

D.4         CORBA

D.5         Recommended Reading and Web Sites

Appendix E: Amdahl's Law

Appendix F: Hash Tables

Appendix G: Response Time

Appendix H: Queuing System Concepts

H.1         The Single-Server Queue

H.2         The Multiserver Queue

H.3         Poisson Arrival Rate

Appendix I: The Complexity of Algorithms

Appendix J: Standards Organizations

 J.1           The Importance of Standards

 J.2           Standards and Regulation

 J.3           Standards-Setting Organizations

Appendix K: Cryptographic Algorithms

 K.1         Symmetric Encryption

 K.2         Public-Key Cryptography

 K.3         Secure Hash Functions

Appendix L: The International Reference Alphabet

Appendix M: BACI: The Ben-Ari Concurrent Programming System

M.1         Introduction

M.2         BACI

M.3         Examples of BACI Programs

M.4         BACI Projects

M.5         Enhancements to the BACK System

Appendix N: Sockets: A Programmer's Introduction

N.1         Versions of Sockets

N.2         Sockets, Socket Descriptors, Ports, and Connections

N.3         The Client/Server Model of Communication

N.4         Sockets Elements

N.5         Stream and Datagram Sockets

N.6         Run-Time Program Control

N.7         Remote Execution of a Windows Console Application

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020