操作系統(tǒng)概念：英文本

定　價(jià)：￥55.00

作　者：	（美）Abraham Silberschatz等著
出版社：	高等教育出版社
叢編項(xiàng)：	國外優(yōu)秀信息科學(xué)與技術(shù)系列教學(xué)用書
標(biāo)　簽：	操作系統(tǒng)理論

購買這本書可以去

ISBN：	9787040110487	出版時(shí)間：	2002-05-01	包裝：	平裝
開本：	24cm	頁數(shù)：	886	字?jǐn)?shù)：

內(nèi)容簡(jiǎn)介

　　本書是計(jì)算機(jī)類專業(yè)操作系統(tǒng)課程的一本經(jīng)典教材，自第一版問世以來，經(jīng)歷了近20年的錘煉，被認(rèn)為是該課程教材的一本圣經(jīng)。它對(duì)操作系統(tǒng)的概念和基本原理給出了清晰的闡述。本書所涉及的基本概念和算法均基于當(dāng)前商用操作系統(tǒng)，并在非特定操作系統(tǒng)的通用環(huán)境中展開講解。書中介紹了大量與流行操作系統(tǒng)相關(guān)的實(shí)現(xiàn)技術(shù)，包括Solaris2、Linux、WindowsNT、Windows2000、OS/2和AppleMacintosh操作系統(tǒng)。此版包括了線程、Windows2000的新章節(jié)，并新增了客戶/服務(wù)器模型和網(wǎng)絡(luò)文件系統(tǒng)、嵌入式操作系統(tǒng)、實(shí)時(shí)操作系統(tǒng)、分布式操作系統(tǒng)等。作者AbrahamSilerschatz是貝爾實(shí)驗(yàn)室信息科學(xué)研究中心的副主任，GregGagne是威斯敏斯特學(xué)院計(jì)算機(jī)學(xué)系主任，PeterBaerGalvin曾在布朗大學(xué)計(jì)算機(jī)科學(xué)系執(zhí)教，現(xiàn)為CorporateTechnologies公司的首席技術(shù)專家。本書前言本書討論了操作系統(tǒng)中的基本概念與算法，提供了大量的實(shí)例研究，如Solaris2，Linux，MS-DOS，WindowsNT，Windows2000，IBMOS/2等。全書內(nèi)容共分七部分，第一部分概述（第1～3章），解釋了操作系統(tǒng)是什么、做什么、怎樣設(shè)計(jì)與構(gòu)造的。第二部分進(jìn)程管理（第4～8章），描述了進(jìn)程概念及作為現(xiàn)代操作系統(tǒng)核心的并發(fā)性。第三部分存儲(chǔ)器管理（第9～12章），描述了存儲(chǔ)器管理中經(jīng)典的結(jié)構(gòu)與算法，以及不同的存儲(chǔ)器管理方案。第四部分I/O系統(tǒng)（第13～14章），對(duì)I/O進(jìn)行了深入的討論，包括I/O系統(tǒng)設(shè)計(jì)、接口、內(nèi)部結(jié)構(gòu)與功能等。第五部分分布式系統(tǒng)（第15～17章），介紹分布存取策略、分布式文件系統(tǒng)及分布式系統(tǒng)中同步、通信等機(jī)制。第六部分保護(hù)與安全（第18～19章），介紹了操作系統(tǒng)中對(duì)文件、內(nèi)存、CPU及其他資源進(jìn)行操作的安全與保護(hù)機(jī)制。第七部分實(shí)例學(xué)習(xí)（第19～22章），引入Linux、Windows2000、FreeBSD、Mach及Nachos等實(shí)例進(jìn)行了分析與討論。

作者簡(jiǎn)介

暫缺《操作系統(tǒng)概念：英文本》作者簡(jiǎn)介

圖書目錄

PART ONE OVERVIEW
Chapter I Introduction
l.l What Is an Operating System?
I.2 Mainframe Systems
l.3 Desktop Systems
l.4 Multiprocessor Systems
I.5 Distributed Systems
l.6 Clustered Systems
I.7 Real-Time Systems
l.8 Handheld Systems
l.9 Feature Migration
l.10 Computing Environments
I.1l Summary
Exercises
Bibliographical Notes
Chapter 2 Computer-System Structures
2.l Computer-System Operation
2.2 I/O Structure
2.3 Storage Structure
2.4 Storage Hierarchy
2.5 Hardware Protection
2.6 Network Structure
2.7 Summary
Exercises
Bibliographical Notes
Chapter 3 Operating-System Structures
3.l System Components
3.2 Operating-System Services
3.3 System Calk
3.4 System Programs
3.5 System Structure
3.6 Virtual Machines
3.7 System Design and
Implementation
3.8 System Generation
3.9 Summary
Exercises
Bibliographical Notes
PART TWO PROCESS MANAGEMENT
Chapter 4 Processes
4.l Process Concept
4.2 Process Scheduling
4.3 Operations on Processes
4.4 Cooperating Processes
4.5 Interprocess Communication
4.6 Communication in Client -
Server Systems
4.7 Summary
Exercises
Bibliographical Notes
Chapter 5 Threads
5.I Overview
5.2 Multialreading Models
5.3 Threading Issues
5.4 Pthreads
5.5 Solaris 2 Threads
5.6 Window 2000 Threads
5.7 Linux Threads
5.8 Java Threads
5.9 Summary
Exercises
Bibliographical Notes
Chapter 6 CPU Scheduling
6.l Basic Concepts
6.2 Scheduling Criteria
6.3 Scheduling Algorithms
6.4 Multiple-Processor Scheduling
6.5 Real-Time Scheduling
6.6 Algorithm Evaluation
6.7 Process Scheduling Models
6.8 Summary
Exercises
Bibliographical Notes
Chapter 7 Process Synchronization
7.1 Background
7.2 The Critical-Section Problem
7.3 Synchronization Hardware
7.4 Semaphores
7.5 Classic Problems of
Synchronization
7.6 Critical Regions
7.7 Monitors
7.8 OS Synchronization
7.9 Atomic Transactions
7.IO Summary
Exercises
Bibliographical Notes
Chapter 8 Deadlocks
8.l System Model
8.2 Deadlock Characterization
8.3 Methods for Handling
Deadlocks
8.4 Deadlock Prevention
8.5 Deadlock Avoidance
8.6 Deadlock Detection
8.7 Recovery from Deadlock
8.8 Summary
Exercises
Bibliographical Notes
PART THREE STORAGE MANAGEMENT
Chapter 9 Memory Management
9.l Background
9.2 Swapping
9.3 Contiguous Memory Allocation
9.4 Paging
9.5 Segmentation
9.6 Segmentation with Paging
9.7 Summary
Exercises
Bibliographical Notes
Chapter IO Virtual Memory
l0.l Background
l0.2 Demand Paging
l0.3 Process Creation
l0.4 Page Replacement
l0.5 Allocation of Frames
l0.6 Thrashing
l0.7 Operating-System Examples
l0.8 Other Considerations
l0.9 Summary
Exercises
Bibliographical Notes
Chapter 1l File-System Interface
11.l File Concept
11.2 Access Methods
11.3 Directory Structure
1l.4 File-System Mounting
11.5 File Sharing
11.6 Protection
11.7 Summary
Exercises
Bibliographical Notes
Chapter 12 File-Syskem Implementation
12.l File-System Structure
12.2 File-System Implementation
12.3 Directory Implementation
12.4 Allocation Methods
12.5 Free-Space Management
12.6 Efficiency and Performance
12.7 Recovery
12.8 Log-Structured File System
12.9 NFS
12.IO Summary
Exercises
Bibliographical Notes
PART FOUR I/O SYSTEMS
Chapter 13 I/O Systems
13.l Overview
13.2 I/0 Hardware
13.3 Application I/0 Interface
13.4 Kernel I/O Subsystem
13.5 Transforming I/0 to Hardware
Operations
13.6 STREAMS
13.7 Performance
13.8 Summary
Exercises
Bibliographical Notes
Chapter 14 Mass-Storage Structure
14.I Disk Structure
14.2 Disk Scheduling
14.3 Disk Management
14.4 Swap-Space Management
14.5 RAID Structure
14.6 Disk Attachment
14.7 Stable-Storage Implementation
14.8 Tertiary-Storage Structure
14.9 Summary
Exercises
Bibliographical Notes
PART FIVE DISTRIBUTED SYSTEMS
Chapter 15 Distributed System Structures
I5.I Background
15.2 Topology
15.3 Network Types
15.4 Communication
15.5 Communication Protocols
15.6 Robustness
15.7 Design Issues
15.8 An Example: Networking
15.9 Summary
Exercises
Bibliographical Notes
Chapter 16 Distributed File Systems
16.1Background
16.2 Naming and Transparency
16.3 Remote File Access
16.4 Stateful Versus Stateless Service
16.5 File Replication
16.6 An Example: AFS
16.7 Summary
Exercises
Bibliographical Notes
Chapter 17 Distributed Coordination
17.I Event Ordering
17.2 Mutual Exclusion
17.3 Atomicity
17.4 Concurrency Control
17.5 Deadlock Handling
17.6 Election Algorithms
17.7 Reaching Agreement
17.8 Summary
Exercises
Bibliographical Notes
Chapter 19 Security
19.l The Security Problem
19.2 User Authentication
19.3 Program Threats
19.4 System Threats
19.5 Securing Systems and Facilities
19.6 Intrusion Detection
19.7 Cryptography
19.8 Computer-Security Classifications
19.9 An Example: Windows NT
19.IO Summary
Exercises
Bibliographical Notes
PART SEVEN CASE STUDIES
Chapter 20 The Linux System
20.l History
20.2 Design Principles
20.3 Kernel Modules
20.4 Process Management
20.5 Scheduling
20.6 Memory Management
20.7 File Systems
20.8 Input and Output
20.9 Interprocess Communication
20.IO Network Structure
20.II Security
20.12 Summary
Exercises
Bibliographical Notes
Chapter 21 Windows 2000
2l.l History
21.2 Desigrt Principles
21.3 System Components
21.4 Environmental Subsystems
21.5 File System
21.6 Networking
21.7 Programmer Interface
21.8 Summary
Exercises
Bibliographical Notes
Chapter 22 Historical Perspective
22.l Early Systems
22.2 Atlas
22.3 XDS-940
22.4 THE
22.5 RC 4000
22.6 CTSS
22.7 MULTICS
22.8 OS/360
22.9 Mach
22.IO Other Systems
Appendix A The FreeBSD System (contents online)
A.l History
A.2 Design Principles
A.3 Programmer Interface
A.4 User Interface
A.5 Process Management
A.6 Memory Management
A.7 File System
A.8 I/0 5ystem
A.9 Interprocess Communication
A.IO Summary
Exercises
Bibliographical Notes
Appendix B The Mach System (contents online)
B.l History
B.2 Design Principles
B.3 System Components
B.4 Process Management
B.5 Interprocess Communication
B.6 Memory Management
B.7 Programmer Interface
B.8 Summary
Exercises
Bibliographical Notes
Credits
Appendix C The Nachos System (contents online)
C.l Overview
C.2 Nachos Software Structure
C.3 Sample Assignments
C.4 Obtaining a Copy of Nachos
C.5 Conclusions
Bibliographical Notes
Credits
Bibliography
Credits
Index