Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Flynn I.M., McIver-McHoes A. — Understanding Operating Systems
Flynn I.M., McIver-McHoes A. — Understanding Operating Systems

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Understanding Operating Systems

Авторы: Flynn I.M., McIver-McHoes A.

Аннотация:

The second edition of Understanding Operating Systems provides a basic understanding of operating systems theory, a comparison of the major operating systems in use, and a description of the technical and operational tradeoffs among them. The highly effective, two-part organization covers the theory of operating systems, their historical roots, and their conceptual basis (which does not change substantially); and how these theories are applied in the specifics of five operating systems (which evolve constantly). The authors explain a technical subject in a not-so-technical manner, with enough detail to allow the reader to understand the complexities of both stand-alone and networked operating systems. Understanding Operating Systems features a clear, converstional style, verbal explanation supported by concrete examples, and graphic illustrations that readers can easily grasp.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1991

Количество страниц: 349

Добавлена в каталог: 02.12.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Access control, list      172 192-194
Access control, matrix      172 192-194
Access control, system      208-212
Access control, verification module      191-195
Access restrictions, to devices      162
Access restrictions, to files      5 62 172-173 178 192-195 208-212 274-275
Access restrictions, to memory      17
Access restrictions, to segments      58-59 62
Access restrictions, user/group/world      5 62 208-211
Access time, I/O      12 148 152-155 168
accounting      198 206-207 253
Ada programming language      139-140
Address relocation      29-34
address resolution      47
Address, in memory of a job      15 17 21-28 42 77
Address, in memory of a page      45-47
Address, in memory of a segment      58-63
Address, job space      45-47
Address, on disk of job      77
Aging      84 89 90 92 118
Algorithm, best-fit      23
Algorithm, deallocate memory blocks      25
Algorithm, first-fit      22
Algorithm, fixed partition scheme      16
Algorithm, page interrupt handler      51
Algorithm, producer/consumer      134
Algorithm, single user memory allocation      15
Algorithms, process scheduling      71 80-90 92
Assembler      4 5 9-10
Associative memory      63-64 290
Avoidance of deadlocks      96 108 110-112 118
Backup, file      148 210-211
Banker's Algorithm      110-112
Batch processing, and memory allocation      34
Batch processing, and processor management      79-80 82-84 89 92 108 125
Batch processing, and processor management, overview      3 7 8 10-11
Belady's anomaly      18-24; see FIFO anomaly Best-fit memory allocation
Bits, I/O      158-159 164 168
Bits, modified      50 55-56 60-62
Bits, parity      146
Bits, referenced      50 55-56 60-62
Bits, status      50 55-56 59-62
block of memory      16 21-24 28 29 32 34 40
Blocking      10 146-148 153-155 160 180 183 200
Bootstrapping      224 219
Bounds register      32
Buffer      10 104 133-134 147-148 158-160
Buffer, double      10 160
Busy list, memory allocation      18 20 27-28 31
busy waiting      130
C programming language      221 235-238 246
C — LOOK device allocation      162 165-166 168
C — SCAN device allocation      162 165-166 168
Capability list      172 192 194
Channel status word (CSW)      158-159
Channel, I/O      5 144 156-161 168
Chip, memory      5-6
Cigarette smokers problem      142
Circular wait      96 104-106 109 112-114 118
COBEGIN      134 136-137
Coend      134 136-137
Compaction of file space      184-185 201 229 248
Compaction of memory      29-34 41 60-61 66
Compiler      4 5 9-10 136-138 140 179
Compression of data      187-188
Concurrent programming      123 125 136-140
context switch      72 80-81 84 88 92 86 269-270
Control unit, I/O      5 10 103 144 156-161 168
CPU allocation      109 125
CPU allocation and I/O      156-160 (see also Processor Manager)
CPU allocation and Memory Manager      66 (see also Processor Manager)
CPU allocation, cooperation      11 133-136 140-141
CPU allocation, cycle      74-75 81-88
CPU allocation, multiple      12 123-141
CPU allocation, role      4-6 10-12 71-73 123-125
CPU allocation, scheduling      73-80 91
CPU allocation, scheduling algorithms      80-90 (see also Processor Manager)
CPU-bound      11 74 79 82 89-90 92 240-241 266-268
Critical region      129-132 134
Current byte address (CBA)      188-191
Cylinder      103 151 168 175 181 226
Database, compression      187-188
Database, compression, deadlocks      99-101 110 115
Database, compression, overview      12 174
Database, compression, synchronization      115 135 138
Deadlock      96-115 118 141
Deadlock strategies      108-115 118
Deadlock, modeling      105-108
Deadly embrace of devices      109; see Deadlock Deallocation
Deadly embrace of files      173-174; see Deadlock Deallocation
Deadly embrace of memory      4-5 24-28;
Deadly embrace of processor      71; see Deadlock Deallocation
Demand paging memory allocation scheme      41 47-51 66
Detection of deadlocks      96 108 112-114 118
Device allocation policies      162 164-166 168
Device allocation policies, deadlock      101-103 106
Device allocation policies, dedicated      144-145 (see also I/O)
Device allocation policies, driver      9 167 224-225 246-248 270-272
Device allocation policies, handler      162 192
Device allocation policies, overview      4 6 10 144-152 161-168
Device allocation policies, shared      144-145 (see also I/O)
Device allocation policies, virtual      144-145 (see also I/O)
Device manager      3-5 144-145 158 160-161 168-169 172 184 190-192 200-201 223-225 245-248 270-272 295-298
Dijkstra, E. W      110 116 130 142
Dining philosophers problem      116-118
Direct access files      10 145 172 181-183 189
Direct Access Storage Device (DASD)      48 144-145 148-155 181
Direct Memory Access (DMA)      159
Directed graphs      99 105-108 112-114
Directory      174 176-180 184-186 226-229 248-251 273-274
Directory, working      180 225-226 254 273-274
Disk, deadlock      102
Disk, deadlock, fixed-head      148-150 152-154
Disk, deadlock, movable-head      150-151 154-155 175
Disk, deadlock, pack      150-151 168 175
Displacement      43-46 60 63
Drums      6 148-150 152-155 166-168 175
Dynamic partition memory allocation      14 17-18 34 66
Encryption of data      211
Error management      76 91 162 175
Explicit parallelism      137
Extents, file      185
external fragmentation      18 41 60-61 65-66
FCFS device allocation      162-163 165 168 223
FCFS memory allocation      18 19 71 76 80-82 87 89 92
Feedback loops      202 204-205
FIFO anomaly      53-54 265-266
FIFO page replacement      40 52-53 56 265
File Manager      3-5 172-176 190-192 195 225-229 248-253 272-275 298-304
File, access methods      188-190
File, deadlock      98-99
File, name      178-180 225-226 249-250 272-274
File, organization      172 178 180-187 190
File, storage      172 183-187 228-229 251-253
Filter output      232 257-258
Firmware      12
First generation computing      8-9
First-fit memory allocation      18-24 218
Fixed partition memory allocation      14 16-18 34 66
Fragmentation, external, memory      18 41 60-61 65-66
Fragmentation, file      184-185
Fragmentation, internal, memory      17 21-22 41 47 65 66
Fragmentation, memory      17-18 21-22 29 41 47 60-61 65-66
Frame, page      41-46 49-55 62
Free list, memory      18-28 31
Garbage collection      see Compaction
Hardware components of system      3 5-7
Hashing      181-182
History of operating systems      8-12 216 236-237
History of operating systems,      263 283-284
Hybrid systems      3 7-8 89 92
I/O, interrupt      11 159-162
I/O, scheduler      161-162
I/O, subsystem      144 155-158 161-162 168 296-298
I/O-bound      74 79 82 89-90 241 266-268
Implicit parallelism      137-138
indefinite postponement      90 92 97 112 135 164-165
Index sequential file organization      172 181-183 188-190
infinite loop      10 80
Interactive processing      3 7 8 11-12 172
Interactive processor management      74 79-80 86-90 92 125
Interactive system deadlock      97
Interblock gap (IBG)      147
internal fragmentation      17 21-22 41 47 60-61
Internal fragmentation,      66
Interrecord gap (IRG)      146-147
interrupt handler      51 75-76 91 159 222-223
Interrupt, external      80
Interrupt, I/O      11 159-162
Interrupt, internal      90-91
Interrupt, overview      71 72 80 90-91
Interrupt, page      49-54 90
Interrupt, processor      90 126-127
Interrupt, synchronous      75 89;
Job Control Language (JCL)      9 285 293 299 303-307
Job Scheduler      5 9 71 73 75-76 78-79 84 127
Job state      77
Job status      75-76
Job Table (JT)      42 48 60 62
K      32-33
Key field      181-182
LFU page replacement      54 68
locality of reference      54 57
Lockword      172-173 192 195
LOOK device allocation      162 164-166 168
Loosely coupled multiprocessing      123 126-127 140
LRU page replacement      40 53-56 63 265
Magnetic tape      6 145-148
Main memory      see Memory
Master file directory (MFD)      176-179
Master/slave multiprocessing      123 125-126 140
Memory address      see Address
Memory allocation schemes, best-fit      18-24
Memory allocation schemes, first-fit      18-24
Memory allocation schemes, next-fit      36
Memory allocation schemes, worst-fit      36
Memory chip, described      5-6
Memory management, demand paging      41 47-51 66
Memory management, dynamic partitions      14 17-18 34 66
Memory management, early systems      14-34 66
Memory management, fixed partitions      14 16-18 34 66
Memory management, paged      40-47 66
Memory management, recent systems      40-66
Memory management, relocatable dynamic partitions      14 29-34 66
Memory management, segmented      40 58-61 66
Memory management, segmented/demand paged      40 61-64 66
Memory management, single-user      14-15 34 66
memory manager      3-5 14 40 66 199 218-222 238-240 264-266 285-292
Memory Map Table (MMT)      42-43 48 50-51 60 62 65
Missed waiting customer problem      128-129 141
Modified bit      50 55-56 60-62
MRU page replacement      54 68
MS — DOS operating system      179 215-234 309-310
MTTR/MBTF      203
Multiprocessing      12 123-128 136-141
Multiprocessing configurations      125-128
Multiprogramming      1 1-12 15-16 65-66 71 79-80
Multitasking      222 240
Mutex      132 134 141
Mutual exclusion      96 104-105 108-109 118 132-135 141
MVS operating system      282-307 311-312
Natural wait      80-81 83
Network deadlock      103-104
No preemption      96 104-105 109 118
Offset      43 191
Operating system, history of      8-12 216 236-238 261-263 283-284
Operating system, overview      1 3-5 7-12 198-201 213-214
Operating system, performance      198 202-206
Operating system, software components      3-5
Optical discs/storage      151-152
Overhead processing      29 33-34 41 47 58 63 65
Overhead processing,      84 87-88 92 112 118 148 168 199-201
P V semaphores      130-132 134-135 141
Page      49-51 (see also Page interrupt fault handler)
Page Map Table (PMT)      42 45-48 50-51 54-55 62-64 66
Page, fault      49-51 57 63 75
Page, frame      41-46 49-55 62
Page, interrupt      49 52-54 58 63 90
Page, interrupt handler      51 75-76
Page, overview      40-58 63 66
Page, replacement policy      40 50 52-58
Page, swap      48-57
Paged memory allocation      40-47 66
Paging mechanics of      55-64(see also Swapping)
Paging mechanics of, versus segmentation      60-61 66(see
Parallel processing      5 12 123-128 132 136-141
Parity bit      146
Partitions in memory      see Memory management
Password      173 195 210-211
Pipes      232-233 256-257
Prevention of deadlocks      96 105 108-110 118
primary memory      see Memory
Priority scheduling      11 72-73 83-84 89 92 135 267-269;
Process Control Block (PCB)      76-78 80 86 130 161 267-269
Process Scheduler      5 71 73-90 130 161
Process, cooperation      133-136 140
Process, scheduling algorithms      71 80-90 92 127
Process, scheduling policies      71 79-80 92
process, state      5 75-79
process, status      75-77
Process, status word (PSW)      77
Process, synchronization      96-97 118 124 128-132 139-141 243-245
Processor      see CPU
Processor Manager      3-5 71-73 91-92 96 123-125 140-141 199-200 222-223 240-245 267-270 292-295
Producers and consumers      123 133-134 141
Protection, system      see Security
Queue, background      89
Queue, background, overview      78 88-90 92 161
Queue, background, page frame request      53-54
Race      100-101 243
Random access      see Direct access
Read/write head      146 149-155 162 166-168 175
Readers and writers      123 134-136 141 275
Real-time system      3 7-8 139
Record format      145-148 172 178 180 183-190
Recovery from deadlocks      96 108 114-115 118
redirect output      231-2332 255-256 277-278
Reentrant code      65 222 239
Referenced bit      50 55-56 60-62
Register, and FCBs      86
Register, associative      63-64
Register, base address      15
Register, bounds      32
Register, computation      32
Register, overview      5-6
Register, relocation      30-33
Relocatable dynamic partitions      14 29-34 66
Relocation      29-34
Resolving the address      47
Resource holding      96 104-105 109 118
Response time      8 79-80 88 162 168 181 202-203
Rotational delay      152-154 166-168 175
Round robin scheduling      71 76 86-88 92
Safe state      110-112 118
SCAN device allocation      162 164-166 168
Scheduler, high-level      see Job scheduler
Scheduler, I/O      see I/O scheduler
Scheduler, job      see Job scheduler
Scheduler, low-level      see Process scheduler
Scheduler, middle-level      74
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте