How to use this License for your documents
A.12. How to use this License for your documents
To use this License in a document you have written, include a copy of the License in the document and put the following copyright and license notices just after the title page:
Copyright © YEAR YOUR NAME. Permission is granted to copy, distribute and/ or modify this document under the terms of the GNU Free Documentation
License, Version 1.1 or any later version published by the Free Software Foundation; with the Invariant Sections being LIST THEIR TITLES, with the Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. A copy of the license is included in the section entitled "GNU Free Documentation License".
If you have no Invariant Sections, write "with no Invariant Sections" instead of saying which ones are invariant. If you have no Front-Cover Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being LIST"; likewise for Back-Cover Texts.
If your document contains nontrivial examples of program code, we recommend releasing these examples in parallel under your choice of free software license, such as the GNU General Public License, to permit their use in free software.
Indeks Berkesinambungan, 160
Fragmentasi, 160 Proteksi Memori, 160
Mutual Exclusion Tidak Berkesinambungan, 160 Arti Bebas, 92
Anomali
Race Condition
Anomali Belady, 184
Arsitektur Segmentasi
Logik, 34
Alamat Logis, 169
Nomor Segmen, 169
Algoritma Bankir, 128
Panjang Segmen, 169
Alokasi Fixed Alocation
Aspek Permintaan Halaman
Equal Allocation, 189
Memori Virtual, 179
Proportional Allocation, 189
Pembuatan Proses, 179
Anomali Belady, 185 Sistem Permintaan Halaman, 179 Antrian, 184
Atmel ARM, 98
Bit Modifikasi, 187
Backup
Circular Queue, 187
Kesalahan Halaman, 184
Jenis, 202, 203
Pemindahan Halaman, 184
Operasi, 203
Least Recently Used, 186
Page Buffering
Variable, 223
Frame, 189
Binary Semaphore, 102
Perkiraan LRU, 187
Alokasi Frame
Bounded Buffer, 61
Kesalahan Halaman, 189
Unbounded Buffer, 61
Penghalamanan, 189
Buffering, 53, 253
Pergantian Halaman, 189
Bounded Buffer, 53
Permintaan Halaman, 189
Buffer, 53
Alokasi Global Lawan Lokal
Unbounded Buffer , 53
Alokasi Global, 189
Cache, 254
Alokasi Lokal, 189 Perbedaan Dengan Buffer, 254 Pergantian Global, 189
Cancellation
Pergantian Lokal, 189 Asynchronous Cancellation, 71 Throughput, 189
Defered Cancellation, 71
Alokasi Memori
Client, 64
Command Interpreter, 29
DMA
Shell, 26
Cara Implementasi, 250
Context Switch, 51
Handshaking, 249
Copy Semantics, 254
Halaman Copy-On-Write, 179
Effective Access Time, 178
Halaman Zero-Fill-On, 179
Eksekusi, 27
Proses Anak, 179
Error, 27
Proses Induk, 179
Error Handling, 255
Sistem Pemanggilan Exec(), 179
File, 202
Sistem Pemanggilan Fork(), 179
Flag pada Thread di Linux
Zero-Fill-On-Demand, 179
Tabel Fungsi Flag, 74
Counting Semaphore, 102
FTP
Critical Section
Syarat Solusi Masalah, 92 Garbage-Collection Scheme, 207 Solusi
Graf
Algoritma Solusi Masalah, 93 Graf Alokasi Sumber Daya Data, 25, 26
Graf Tunggu, 129
Demand Paging
/var, 229
Paging
I/O, 25, 27
Halaman (Page), 176
Aplikasi Antarmuka, 250
I/O Blok, 251
Direct Virtual-Memory Access, 250
I/O Jaringan, 251
Direktori, 25
Jam Dan Timer, 252
CP/M, 221
Subsistem Kernel, 252
Asiklik, 207
I/O Stream
Dua Tingkat, 206
Definisi, 257
Satu Tingkat, 206
Identifier
Single Level, 206
Two Level, 206
Sistem Berkas, 217
Instruksi Atomik, 100
Raw, 268 Interrupt Vector Dan Interrupt Chaining, 248 Struktur, 260
Mekanisme Dasar, 248
Rutin Penanganan, 37
IPC Konsep Dasar Pemindahan Halaman Send/Recives, 58
Kesalahan Halaman, 181
IRQ, 313 Pemindahan Halaman, 181 Jaringan, 26
Permintaan Halaman, 181
Utilisasi CPU, 181
Java RMI, 66
Kontrol proses, 30
Kernel Linux
I/O, 37
Deskriptor Proses, 296
Managemen Memori, 37
Komponen Modul, 292
Penjadual CPU, 37
Managemen Modul, 293
Pemanggilan Modul, 293
Linear List
Kesalahan Halaman
Hash Table, 220
Ambil (Fetch), 177
Linking Dinamis, 304
Bit Validasi, 177
Linking Statis, 304
Illegal Address Trap, 177
Load Device Drivers, 256
Interrupt Handler, 164
Loading, 31
Page-Fault Trap, 164
Tidak Valid, 177
Langsung, 58 Penyimpanan Sekunder, 26 Konsep Dasar
Proses, 24
Algoritma Pemindahan Halaman, 182
Sistem
Bit Tambahan, 182
I/O, 25
Disk, 182
Managemen Memori, 173
Frame, 182
Masalah dalam Segmentasi
Frame Yang Kosong, 182
Fragmentasi, 170
Kesalahan Halaman, 182 Masalah Dining Philosophers, 117 Memori, 182
Masalah Readers/Writers, 109 Memori Fisik, 182
Solusi: Prioritas bergantian, 117 Memori Logis, 182
Solusi: Prioritas Pembaca, 110 Memori Virtual, 182
Solusi: Prioritas Penulis, 114 Overhead, 182
Mekanisme, 39
Pemindahan Halaman, 182
Memori, 25, 26
Perangkat Keras, 182
Gambaran Memori, 158
Permintaan Halaman, 182
Proses Pengguna, 182
Managemen Memori, 154
Ruang Pertukaran, 182
Pengguna, 158
Rutinitas, 182
Program Counter, 154
String Acuan, 182
Ready Queue, 158
Tabel, 182
Share, 27
Waktu Akses Efektif, 182
Shared, 30
Memori Virtual
Memory Synchronous, 99
Mutlak, 207
Memory-Mapped Files
Relatif, 207
Akses Memori Rutin, 180
Pemanggilan Dinamis
Berkas I/O, 180
Disk, 155
Disk, 180
Linkage Loader, 155
Memori Virtual, 180
Routine, 155
Pemetaan Memori, 180
Pemberian Alamat, 158
Sistem Pemanggilan Read(), 180
Antrian Masukan, 154
Sistem Pemanggilan Write, 180
Pengikatan Alamat
Mesin Virtual
Waktu Eksekusi, 154
Mesin Virtual Java, 38 Waktu Pemanggilan, 154 Perangkat Lunak, 38
Waktu Pembuatan, 154
Message Passing, 27, 30, 37
Waktu Eksekusi, 158
Message-Passing, 255
Waktu Pemanggilan, 158
Metode
Waktu Pembuatan, 158
Akses, 204
Pemberian Halaman
Nomor Halaman, 162
Mount Dukungan Perangkat Keras, 162 Umount
Keuntungan dan Kerugian, 162 Mount Point, 208
Metode Dasar, 162
Mount Point, 209 Penerjemahan Halaman, 162 Multi-tasking, 30
Penanganan Sinyal
Swap-Out, 175
Penerima Sinyal, 72
Multiprosesor, 82 Pola Penanganan Sinyal, 72 Mutual Eksklusif, 125
Pengecekan Rutin
Nama Berkas
On Disk
Perangkat, 246
In Memory, 217
Penghubungan Dinamis
Overlays Perpustakaan Bersama, 156 Assembler, 156
Penjadualan
Two-pass Assembler, 156
Group, 210 First-Come-First-Serve, 261 Universe, 212
SCAN, 263
Page Cache Shortest-Seek-Time-First, 262 Disk Cache
Penjadualan Disk, 261
Buffer Cache, 239
Disk Bandwith, 261
Page Fault
System Call, 261
Tidak Valid, 176
Penjadualan LOOK, 265
Valid, 176
Penjadualan proses, 47
Paralelisme, 271
Penukaran
Paritas, 270 Penyimpanan Sementara, 158 Blok Interleaved, 271
Roll Out, Roll In, 158
Partisi
Penyimpanan
Implementasi Stabil, 275
Procedural Programming, 65
Penyimpanan Sekunder, 26, 37
Process Control Block, 44
Perangkat
Processor Synchronous, 98
Keras, 37
Produsen Konsumen, 56
Perangkat I/O
Proses, 24
Jenis-Jenis, 246
Client/Server, 56
Klasifikasi Umum, 246
Perangkat Keras Kecepatan Komputasi, 53 Memori Sekunder, 179
Kenyamanan, 53
Tabel Halaman, 179
Modularitas, 53
Perangkat Komputer Pembagian Informasi, 53 Konsep Dasar, 1
Sinkronisasi, 37
Perangkat Aplikasi, 1
Proteksi, 27
Perangkat Keras, 1
Proteksi Hardware
Perangkat Lunak Bebas, 283
Dual Mode Operation
Perangkat Penyimpanan Tersier Monitor/Kernel/System Mode, 17 Kerr Effect, 276
User Mode, 17
Magneto-Optic Disk, 276
IO Protection, 18
MEMS, 278
Proteksi Perangkat Keras
Optical Disk, 277
Proteksi CPU, 19
Penyimpanan Holographic, 278
Proteksi Memori, 18
Phase-Change Disk, 277
Queue Scheduling
WORM, 277
Device Queue, 47
Peranti, 27, 30
Job Queue, 47
Persyaratan /usr
Ready Queue, 47
Direktori, 226
RAID
Persyaratan /var
Pertimbangan Lain
Redundansi, 270
Contoh Dalam Sistem Operasi
Remote Registry, 66
Linux, 194
Restart Instruction
Solaris 2, 194
Microcode, 178
Windows NT, 194 Ragam Pengalamatan Spesial, 178 I/O Interlock, 194
Status Register Spesial, 178 Jangkauan TLB
Temporary Register, 178
Hit Ratio, 194
RPC, 65
Prepaging, 194
Ruang Alamat
Struktur Program
Alamat Fisik, 154
Jumlah Referensi, 194
Alamat Logika, 154
Kecepatan Pencarian, 194 Memory Management Unit, 154 Lokalitas, 194
Register, 154
Tabel Halaman Yang Dibalik, 194
Saling Berbagi dan Proteksi
Ukuran Halaman, 194
Bit-proteksi, 170
waktu latensi, 194
Scheduler
Waktu Pencarian, 194
CPU Scheduler, 49
Waktu Transfer, 194
Job Scheduler, 49
Working Set, 194
Long-term Scheduler, 49
Politisi Busuk, 1 Medium-term Scheduler, 49 Polling, 247
Short-term Scheduler, 49
PPP, 313
Segmentasi
Prioritas, 82
Offset, 169
Segmen, 169
Tujuan, 246
Unit Logis, 169
Kenyamanan, 2
Segmentasi dengan Pemberian Halaman
Windows, 1
Pemberian Halaman, 171
Sistem Waktu Nyata
Semafor, 100
Hard Real-Time, 82
Server, 64
Soft Real-Time, 82
Sleep On, 296
Cara Kerja, 254
NonBlocking, 60
Spooling Directory, 254
Sisi
Status, 31
Sisi Permintaan, 129
Status Proses
Sistem Berkas, 27
Stream
Alokasi Blok, 232
Hard Disk, 15
Linked, 233
Optical Disc, 15
Bit Map, 237
Sistem Komputer, 10
Bit Vector, 237
Hirarki Storage, 16
Blk_dev, 311
Input/Output (I/O), 13
Blk_dev_struct, 311 Operasi Sistem Komputer, 10 chrdevs, 309, 310
Storage, 14
Grouping
Struktur Berkas
Counting, 237
Layered File System, 214
IDE, 311
Struktur Disk
Inode VFS, 310 Constant Angular Velocity, 260 Khusus Device, 309
Constant Linear Velocity, 260 Nomor Device, 309
Waktu Akses, 260
Sumber Daya, 27
Lokasi Ruang, 269
System Call, 310
Managemen Ruang, 269
Virtual, 309
Penggunaan Ruang, 269
Sistem Operasi, 27
GNU/Linux, 1
Program, 31
Komponen
System CallLinux
Control Program, 2
Clone
Internet Explorer, 1 Perbedaan Fork dan Clone, 74 Resource Allocator, 2
Fork, 74
Layanan, 27
System Generation, 39
Tradisional, 3
Tabel Halaman
Masukan, 166 Nomor Halaman, 166 Tabel Halaman Secara Inverted, 166 Tabel Halaman Secara Multilevel, 166
Tabel Registrasi, 293 Task Interruptible, 296 Thrashing
Halaman, 191 Kesalahan Halaman, 191 Multiprogamming, 191 Swap-In, 191 Swap-Out, 191 Utilitasi CPU, 191
Thread, 46 Definisi, 67 Kernel Thread, 68 Keuntungan
Berbagi Sumber Daya, 68 Ekonomi, 68 Responsi, 68 Utilisasi Arsitektur, 68
Multithreading, 67 Multithreading Models
Many-to-Many Model, 69 Many-to-One Model, 69 One-to-One Model, 69
Pembuatan, 75 Pthreads, 73 Specific Data, 73 Thread Pools, 73 User Thread, 68
Vertex Proses, 129 Wait, 101 Working Set
Bit Referensi, 191 Delta, 191 Fixed Internal Timer Interrupt, 191 Interupsi, 191 Lokalitas, 191 Overlap, 191