高级操作系统讲义英文CH 03 -OS8e
合集下载
operating system操作系统-ch04-threads-31
To discuss the APls for Phtreads, Win32, and Java thread libraries.
4.2
Content Overview
Overview Multithreading Models Threading Issues Pthreads Windows XP Threads Linux Threads Java Threads
API specifies behavior of the thread library, implementation is up to development of the library
Common in UNIX operating systems (Solaris, Linux, Mac OS X)
4.20
Java Thread States
4.21
4.4 Threading Issues
Semantics of fork() and exec() system calls Thread cancellation Signal handling Thread pools Thread specific data Scheduler activations
4.24
Signal Handling
Signals are used in UNIX systems to notify a process that a particular event has occurred
A signal handler is used to process signals 1. Signal is generated by particular event 2. Signal is delivered to a process 3. Signal is handled
4.2
Content Overview
Overview Multithreading Models Threading Issues Pthreads Windows XP Threads Linux Threads Java Threads
API specifies behavior of the thread library, implementation is up to development of the library
Common in UNIX operating systems (Solaris, Linux, Mac OS X)
4.20
Java Thread States
4.21
4.4 Threading Issues
Semantics of fork() and exec() system calls Thread cancellation Signal handling Thread pools Thread specific data Scheduler activations
4.24
Signal Handling
Signals are used in UNIX systems to notify a process that a particular event has occurred
A signal handler is used to process signals 1. Signal is generated by particular event 2. Signal is delivered to a process 3. Signal is handled
operating system操作系统-ch06-process synchronization-
6.4
Producer
while (true) { /* produce an item and put in nextProduced */ while (count == BUFFER_SIZE)
; // do nothing
buffer [in] = nextProduced; in = (in + 1) % BUFFER_SIZE; count++; }
6.8
requirement to the solutions
1. Mutual Exclusion - If process Pi is executing in its critical section, then no other processes can be executing in their critical sections (waiting while busy)
6.10
Algorithm for Process Pi Pj
while (true) { flag[i] = TRUE; turn = j;
while (true) { flag[j] = TRUE; turn = i;
while ( flag[j] && turn == j) ; CRITICAL SECTION flag[i] = FALSE; REMAINDER SECTION }
operating system操作系统-ch06-process synchronization-63
6.2
Content Overview
Background The Critical-Section Problem Peterson’s Solution Synchronization Hardware Semaphores Classic Problems of Synchronization Monitors Synchronization Examples Atomic Transactions
Producer
while (true) { /* produce an item and put in nextProduced */ while (count == BUFFER_SIZE)
; // do nothing
buffer [in] = nextProduced; in = (in + 1) % BUFFER_SIZE; count++; }
6.8
requirement to the solutions
1. Mutual Exclusion - If process Pi is executing in its critical section, then no other processes can be executing in their critical sections (waiting while busy)
6.10
Algorithm for Process Pi Pj
while (true) { flag[i] = TRUE; turn = j;
while (true) { flag[j] = TRUE; turn = i;
while ( flag[j] && turn == j) ; CRITICAL SECTION flag[i] = FALSE; REMAINDER SECTION }
operating system操作系统-ch06-process synchronization-63
6.2
Content Overview
Background The Critical-Section Problem Peterson’s Solution Synchronization Hardware Semaphores Classic Problems of Synchronization Monitors Synchronization Examples Atomic Transactions
[课件] 大学操作系统课件ch12-massaive-storage
![[课件] 大学操作系统课件ch12-massaive-storage](https://img.taocdn.com/s3/m/383a71b30b4c2e3f572763ae.png)
P (d) RAID 3: bit-interleaved parity.
(c) RAID 2: memory-style error-correcting codes.
RAID的级别P
(d) RAID 3: bit-interleaved parity.
P (e) RAID 4: block-interleaved parity.
! 有一些改进磁盘使用技术的方法包括了同时使用 多个磁盘协同工作。
!
! 磁盘带使用一组磁盘作为一个存储单元。
RAID (cont)
! RAID机制通过存储冗余数据提高了存储系统 的性能和可靠性。
!
• 镜像（或影子）技术采用了复制每个磁盘的方法。 • 块交织奇偶结构在较低的代价下提供冗余。
ed RAID levels. We describe the various levels here; Fig m pictorially (in the figure, P indicates error-correcting b
head starts at 53
0 14 37 53 65 67 98 122124
183 199
98, 183, 37, 122, 14, 124, 65, 67
C-LOOK
! C-SCAN的一种形式。 ! 磁头只移动到一个方向上最远的请求为止。接着，
它⻢上回头，而不是继续到磁盘的尽头。
ase, the disk head has to move the entire width of the disk. If the dir
• Solaris 2只有在一⻚被强制换出物理内存时，而不是 在首次创建虚拟内存也时，才分配交换空间。
4.3 BSD系统的代码段交换表
(c) RAID 2: memory-style error-correcting codes.
RAID的级别P
(d) RAID 3: bit-interleaved parity.
P (e) RAID 4: block-interleaved parity.
! 有一些改进磁盘使用技术的方法包括了同时使用 多个磁盘协同工作。
!
! 磁盘带使用一组磁盘作为一个存储单元。
RAID (cont)
! RAID机制通过存储冗余数据提高了存储系统 的性能和可靠性。
!
• 镜像（或影子）技术采用了复制每个磁盘的方法。 • 块交织奇偶结构在较低的代价下提供冗余。
ed RAID levels. We describe the various levels here; Fig m pictorially (in the figure, P indicates error-correcting b
head starts at 53
0 14 37 53 65 67 98 122124
183 199
98, 183, 37, 122, 14, 124, 65, 67
C-LOOK
! C-SCAN的一种形式。 ! 磁头只移动到一个方向上最远的请求为止。接着，
它⻢上回头，而不是继续到磁盘的尽头。
ase, the disk head has to move the entire width of the disk. If the dir
• Solaris 2只有在一⻚被强制换出物理内存时，而不是 在首次创建虚拟内存也时，才分配交换空间。
4.3 BSD系统的代码段交换表
operating system操作系统-ch11-file system implementation-50
11.3
11.1 File-System Structure
File structure
Logical storage unit Collection of related information
File system resides on secondary storage (disks) File system organized into layers File control block – storage structure consisting of information
11.5 Free-Space Management
Bit vector (n blocks)
01 2
n-1
…
bit[i] =
1 block[i] free 0 block[i] occupied
Block number calculation
(number of bits per word) * (number of 0-value words) + offset of first 1 bit
Brings all pointers together into the index block. Logical view.
index table
11.20
Example of Indexed Allocation
11.21
Indexed Allocation (Cont.)
Need index table Random access Dynamic access without external fragmentation, but
free-behind and read-ahead – techniques to optimize sequential access
11.1 File-System Structure
File structure
Logical storage unit Collection of related information
File system resides on secondary storage (disks) File system organized into layers File control block – storage structure consisting of information
11.5 Free-Space Management
Bit vector (n blocks)
01 2
n-1
…
bit[i] =
1 block[i] free 0 block[i] occupied
Block number calculation
(number of bits per word) * (number of 0-value words) + offset of first 1 bit
Brings all pointers together into the index block. Logical view.
index table
11.20
Example of Indexed Allocation
11.21
Indexed Allocation (Cont.)
Need index table Random access Dynamic access without external fragmentation, but
free-behind and read-ahead – techniques to optimize sequential access
operating system《操作系统》ch12-mass-storage systems-49
12.4
Moving-head Disk Machanism
12.5
Overview of Mass Storage Structure (Cont.)
Magnetic tape
Was early secondary-storage medium Relatively permanent and holds large quantities of data Access time slow Random access ~1000 times slower than disk Mainly used for backup, storage of infrequently-used data, transfer medium between systems Kept in spool and wound or rewound past read-write head Once data under head, transfer rates comparable to disk
12.2
Objectives
Describe the physical structure of secondary and tertiary storage
devices and the resulting effects on the uses of the devices
Explain the performance characteristics of mass-storage devices
Chapter 12: Mass-Storage Systems
Chapter 12: Mass-Storage Systems
Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management
operating system《操作系统》ch11-file system implementation-50
11.31
I/O Using a Unified Buffer Cache
11.32
11.7 Recovery
Consistency checking – compares data in directory structure with data blocks on disk, and tries to fix inconsistencies
Brings all pointers together into the index block. Logical view.
index table
11.20
Example of Indexed Allocation
11.21
Indexed Allocation (Cont.)
Need index table Random access Dynamic access without external fragmentation, but
Efficiency dependent on:
disk allocation and directory algorithms types of data kept in file’s directory entry
Performance
disk cache – separate section of main memory for frequently used blocks
File-allocation table (FAT) – disk-space allocation used by MS-DOS and OS/2.
11.17
Linked Allocation
11.18
File-Allocation Table
I/O Using a Unified Buffer Cache
11.32
11.7 Recovery
Consistency checking – compares data in directory structure with data blocks on disk, and tries to fix inconsistencies
Brings all pointers together into the index block. Logical view.
index table
11.20
Example of Indexed Allocation
11.21
Indexed Allocation (Cont.)
Need index table Random access Dynamic access without external fragmentation, but
Efficiency dependent on:
disk allocation and directory algorithms types of data kept in file’s directory entry
Performance
disk cache – separate section of main memory for frequently used blocks
File-allocation table (FAT) – disk-space allocation used by MS-DOS and OS/2.
11.17
Linked Allocation
11.18
File-Allocation Table
operating system《操作系统》ch12-mass-storage system
12.2
Objectives
Describe the physical structure of secondary and tertiary storage devices and the resulting effects on the uses of the devices Explain the performance characteristics of mass-storage devices Discuss operating-system services provided for mass storage, including RAID and HSM
12.7
Disk Attachment
Host-attached storage accessed through I/O ports talking to I/O busses SCSI itself is a bus, up to 16 devices on one cable, SCSI initiator requests operation and SCSI targets perform tasks
Chapter 12: Mass-Storage Systems
.
Chapter 12: Mass-Storage Systems
Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management Swap-Space Management RAID Structure Disk Attachment Stable-Storage Implementation Tertiary Storage Devices Operating System Issues Performance Issues
Objectives
Describe the physical structure of secondary and tertiary storage devices and the resulting effects on the uses of the devices Explain the performance characteristics of mass-storage devices Discuss operating-system services provided for mass storage, including RAID and HSM
12.7
Disk Attachment
Host-attached storage accessed through I/O ports talking to I/O busses SCSI itself is a bus, up to 16 devices on one cable, SCSI initiator requests operation and SCSI targets perform tasks
Chapter 12: Mass-Storage Systems
.
Chapter 12: Mass-Storage Systems
Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management Swap-Space Management RAID Structure Disk Attachment Stable-Storage Implementation Tertiary Storage Devices Operating System Issues Performance Issues
中国科学技术大学本科教育培养方案
热能与动力工程专业一、培养目标培养适应我国社会主义建设实际需要，德智体全面发展，具有热能与动力工程等方面坚实的理论基础知识，掌握实验、运算和分析的方法，有一定创新意识和初步的从事科学研究和解决实际问题能力的高级专门人才。
学生毕业后能在热能和动力工程、能源利用、材料或生物热物理、制冷与空调、建筑环境等相关领域的科研机构、企业、公司和管理部门从事研究、设计、制造、运行、开发和管理等方面的高级技术工作。
二、学制、授予学位及毕业基本要求；学制： 4年毕业要求：修满165.5学分（必修143.5学分，选修22学分）；通过毕业论文答辩 授予学位： 工学学士学位课程设置的分类及学分比例如下表：类 别 学 分 比 例（%）通 修 课 88.5 53.4学科群基础课 ≥22+4 ≥15.71专 业 课 ≥42 ≥25.38集中实践环节 9（8+1） 5.44合 计 ≥165.5三、修读课程的要求：要求修读的课程分为四个层次，每个层次的课程设置及结构如下：1、通修课：（88.5学分）参照学校关于通修课的课程要求。
并要求修读以下课程：电子线路基础（4学分）、电子线路基础实验（1学分）、微机原理与接口（3.5学分）、信息系统基础（2学分）；2、学科群基础课：（≥22+4学分）MA02*(数学类课程)：（9学分）298复变函数（B）（2学分）、数理方程（B）（2学分）、概率论与数理统计（3学分）、计算方法(B)(2学分)；PI02*（仪器与机械类课程）：（3学分）机械制图（1）（3学分）；ME02*（力学类课程）：（8学分）理论力学（1）（4学分）、材料力学（1）（4学分）；TS02*（动力工程类课程）：（2学分）电工基础（2学分）；学科群基础选修课：（≥4学分）AUTOCAD（2学分）、理论力学2（2学分）、Fortran语言（2学分）、随机过程（2学分）；3、专业课：TS03*（动力工程类课程）：（≥42学分）专业必修课：（24学分）传热的基本原理（4学分）、流体力学基础（4学分）、工程热力学（4学分）、热物理基础实验（1）（2学分）、计算热物理(4学分)、热物理基础实验（2）（2学分）、燃烧学（4学分）；专业选修课程：（≥18学分）热工自动化控制原理（3学分）、空气调节系统（4学分）、叶轮机械原理（2学分）、热力设备原理（3学分）、流动显示技术（2学分）、燃烧污染与控制技术（2学分）、生命材料的低温保存技术（2学分）、制冷原理和热泵技术（3学分）、机械设计基础（3学分）、物理化学A（下）（3学分）、热力学和统计物理（3学分）、粘性流体力学（3学分）、气体动力学基础（3学分）、现代热工测量技术（3学分）、传热与传质（3学分）、生物质热解转化原理与应用（3学分）、热能工程概论（1学分）；4、实践环节（9学分）：金工实习（1学分）、毕业论文（8学分）。