ADDENDUM: How to use this License for your

A.12. ADDENDUM: 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.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License".

Lampiran A. GNU Free Documentation License If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, replace the "with...Texts." line

with this:

with the Invariant Sections being LIST THEIR TITLES, with the Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST.

If you have Invariant Sections without Cover Texts, or some other combination of the three, merge those two alternatives to suit the situation.

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 Pergantian Global, 341

Pergantian Lokal, 341 Throughput, 341

Mutual Exclusion

Alokasi Memori

Arti Bebas, 171 Berkesinambungan, 299 Race Condition

Fragmentasi, 299 Solusi, 171

Proteksi Memori, 299 Alamat

Tidak Berkesinambungan, 299 Fisik, 306

Anomali

Frame, 306 Anomali Belady, 334 Logik, 64

Algoritma Arsitektur Segmentasi Algoritma Bankir, 208

Alamat Logis, 316 Alokasi Fixed Alocation

Base, 316

Equal Allocation, 341

Limit, 316

Proportional Allocation, 341 Nomor Segmen, 316 Anomali Belady, 335

Panjang Segmen, 316 Antrian, 334

Aspek Permintaan Halaman Bit Modifikasi, 337

Memori Virtual, 329 Circular Queue, 337

Pembuatan Proses, 329 Counting, 338

Sistem Permintaan Halaman, 329 Elevator, 442

Atmel ARM, 184

Kesalahan Halaman, 334

Assembly, 55

Pemindahan Halaman, 334 Pemrograman, 55 Least Recently Used, 336

Berkas, 51, 56, 60, 359 NFU, 337

Page Buffering

Pool, 339 Unshareable, 388 Penjadualan, 296, 446

Variable, 388

Perkiraan LRU, 337 Binary Semaphore, 189 Second-Chance, 337

Block

Alokasi Frame

Bad, 449

Kesalahan Halaman, 341

Pergantian Halaman, 341

Buffer, 160

Permintaan Halaman, 341 Bounded Buffer, 164 Alokasi Global Lawan Lokal

Unbounded Buffer, 164 Alokasi Global, 341

Buffering, 240, 428 Alokasi Lokal, 341

Bounded Buffer, 240

Buffer, 240 Two Level, 365 Unbounded Buffer, 240

Perbedaan Dengan Buffer, 429

Asynchronous Cancellation, 110

Format, 449

Defered Cancellation, 110 Managemen, 439, 449 Client, 165

Raw, 449

Command Interpreter, 57

Context Switch, 125 Cara Implementasi, 423 Copy Semantics, 429

Halaman Copy-On-Write, 329 Handshaking, 423 Halaman Zero-Fill-On, 329

Transfer, 422

Proses Anak, 329

Drum, 67

Proses Induk, 329 Effective Access Time, 326 Sistem Pemanggilan Exec(), 329

Eksekusi, 55

Sistem Pemanggilan Fork(), 329

Error, 55

Zero-Fill-On-Demand, 329 Error Handling, 430 Counting Semaphore, 189

File, 359

Critical Section Flag pada Thread di Linux Problema

Tabel Fungsi Flag, 152 Syarat Solusi Masalah, 171

Algoritma Solusi Masalah, 175

WWW, 369

Data, 51, 52 Garbage-Collection Scheme, 366 Deadlock, 201

Graf

Debug, 67 Graf Alokasi Sumber Daya Demand Paging

Graf Tunggu, 212 Paging

Hirarki

Halaman (Page), 324

Direct Virtual-Memory Access, 423

CP/M, 384

Direktori, 383

MS-DOS, 385 Sistem Berkas, 380 Operasi, 364

Informasi, 60

Struktur, 365 Instruksi Atomik, 186 Asiklik, 366

Interface

Dua Tingkat, 365

Pengguna, 67

Satu Tingkat, 365

Interupsi, 421

Single Level, 365 Interrupt Vector Dan Interrupt Chaining, Tree, 365

Mekanisme Dasar, 421 Permintaan Halaman, 332 Penyebab, 422

Proses, 332

Rutin Penanganan, 67 Proses Pengguna, 332 IPC

Ruang Pertukaran, 332 Send/Recives, 160

Rutinitas, 332

IRQ, 472 String Acuan, 332 Jaringan, 52

Tabel, 332

Ethernet, 472 Waktu Akses Efektif, 332 Struktur, 42

Konsep Dasar Pemindahan Halaman Java RMI, 167

Kesalahan Halaman, 332 Kernel, 62, 67

Pemindahan Halaman, 332 Kernel Linux

Permintaan Halaman, 332 Deskriptor Proses, 150

Throughput, 332 Komponen Modul, 92

Utilisasi CPU, 332 Managemen Modul, 93

Kontrol proses, 60

Modul, 92

Kooperatif, 159

Pemanggilan Modul, 93

Lapisan, 62

Kernel-mikro, 67

M/K, 67

Kernelmikro, 62 Managemen Memori, 67 Kesalahan Halaman

Penjadual CPU, 67 Ambil (Fetch), 325

Layanan, 67

Bit Validasi, 325

Level, 67

Dekode, 325

Linear List

Free-Frame, 325 Hash Table, 383 Illegal Address Trap, 325

Linking Dinamis, 356 Interrupt Handler, 306

Linking Statis, 356 Page-Fault Trap, 306

Tidak Valid, 325 Load Device Drivers, 432 Kinerja

M/K, 2

Komunikasi, 52, 55, 56, 60, 67, 67 Aplikasi Antarmuka, 425 Langsung, 161

Blocking, 427

Konsep Dasar

Efisiensi, 435

Algoritma Pemindahan Halaman, 332 Jam Dan Timer, 427 Bit Tambahan, 332

Kinerja, 434

Disk, 332

M/K Blok, 426

Frame, 332 M/K Jaringan, 426 Frame Yang Kosong, 332

Nonblocking, 427 Kesalahan Halaman, 332

Penjadualan, 427 Memori, 332

Subsistem Kernel, 427 Memori Fisik, 332

M/K Stream

Memori Logis, 332

Definisi, 433

Memori Virtual, 332

Pemindahan Halaman, 332

Managemen

Perangkat Keras, 332

Berkas, 51

Memori

Mount Point, 374

Utama, 51

Multi-tasking, 60

Penyimpanan Sekunder, 52 Multiprogramming Proses, 51

Masukan/Keluaran, 52 Mutual Eksklusif, 205 Managemen Memori, 322

Nama Berkas

Masalah dalam Segmentasi Komponen, 388 Fragmentasi, 317

NFS, 375

Masalah Dining Philosophers, 274

On Disk

Masalah Readers/Writers, 251 In Memory, 380 Solusi: Prioritas bergantian, 269

Overlays

Solusi: Prioritas Pembaca, 261

Assembler, 293

Solusi: Prioritas Penulis, 266 Two-pass Assembler, 293 Masukan/Keluaran, 52, 55

Gambaran Memori, 296 Universe, 371 M/K

Page Cache

Buffer, 296

Disk Cache

Managemen Memori, 290 Buffer Cache, 405 Pengguna, 296

Page Fault

Program Counter, 290 Tidak Valid, 324 Ready Queue, 296

Memori Virtual Blok Interleaved, 452 Byte, 322

Partisi

Memory Synchronous, 185

Mounting, 381

Memory-Mapped Files

Path

Akses Memori Rutin, 329

Mutlak, 365

Berkas M/K, 329

Relatif, 365

Disk, 329 Pemanggilan Dinamis Memori Virtual, 329

Disk, 291

Pemetaan Memori, 329 Linkage Loader, 291 Sistem Pemanggilan Read(), 329

Routine, 291

Sistem Pemanggilan Write, 329 Pemberian Alamat, 296 Mesin Virtual

Antrian Masukan, 510 Mesin Virtual Java, 84

Pengikatan Alamat Perangkat Lunak, 84

Waktu Eksekusi, 510 Message Passing, 55, 60, 67

Waktu Pemanggilan, 510 Message-Passing, 431

Waktu Pembuatan, 510 Metode

Waktu Eksekusi, 296 Akses, 362

Waktu Pemanggilan, 296 Mirroring, 452

Waktu Pembuatan, 296 Motherboard, 420

Pemberian Halaman Mount

Mount Point, 373 Nomor Halaman, 304

Dukungan Perangkat Keras, 304 Kerr Effect, 462 Keuntungan dan Kerugian, 304

Magneto-Optic Disk, 462 Metode Dasar, 304

MEMS, 464

Penerjemahan Halaman, 304 Optical Disk, 462 Proteksi, 304

Penyimpanan Holographic, 464 Penamaan, 161

Phase-Change Disk, 463 Penanganan Sinyal

WORM, 463

Penerima Sinyal, 111

Peranti, 55, 60

Pola Penanganan Sinyal, 111

Persyaratan /usr

Pengecekan Rutin

Direktori, 391

Restore

Persyaratan /var

Politisi Busuk, 1

Perangkat, 420

Polling, 420

Penghubungan Dinamis

PPP, 472

Perpustakaan Bersama, 292

Prioritas, 140

Penjadualan Procedural Programming, 166 C-LOOK, 445

Process Control Block, 101 C-SCAN, 443

Processor Synchronous, 184 First-Come-First-Serve, 440

Produsen Konsumen, 159 SCAN, 442

Penjadualan Disk, 439

Kooperatif

Disk Bandwith, 439 Kecepatan Komputasi, 158 System Call, 439

Kenyamanan, 158 Penjadualan LOOK, 444

Modularitas, 158 Penjadualan proses, 121

Pembagian Informasi, 158 Penukaran

Sinkronisasi, 67 Penyimpanan Sementara, 296

Prosesor Jamak, 140 Roll Out, Roll In, 296

Proteksi, 55

Penyimpanan Proteksi Perangkat Keras Implementasi Stabil, 456

Dual Mode Operation Penyimpanan Sekunder, 52, 67

Monitor/Kernel/System Mode, 46 Perangkat

User Mode, 46 Keras, 67

Masukan/Keluaran, 46 Perangkat Keras

Proteksi CPU, 47 Memori Sekunder, 327

Proteksi Memori, 47 Tabel Halaman, 327

Queue Scheduling

Perangkat Komputer Device Queue, 121 Konsep Dasar, 1

Job Queue, 121

Perangkat Aplikasi, 1 Ready Queue, 121 Perangkat Keras, 1

RAID

Perangkat Lunak Bebas, 14

Level, 452

Perangkat M/K

Klasifikasi Umum, 419 Remote Registry, 167 Prinsip-Prinsip, 419

Restart Instruction

Perangkat Penyimpanan Tersier Microcode, 327

Ragam Pengalamatan Spesial, 327

Grouping

Status Register Spesial, 327 Counting, 403 Temporary Register, 327

IDE, 470

RPC, 166 Inode VFS, 469 Ruang Alamat

Khusus Device, 468 Alamat Fisik, 290

Nomor Device, 468 Alamat Logika, 290

Persyaratan

Memory Management Unit, 290 Direktori, 389 Register, 290

Root

Saling Berbagi dan Proteksi

Scheduler System Call, 469 CPU Scheduler, 124

Virtual, 468

Job Scheduler, 124 Sistem Operasi, 55 Long-term Scheduler, 124

Definisi, 1, 1

Medium-term Scheduler, 124

GNU/Linux, 1

Short-term Scheduler, 124

Komponen

Segmentasi Control Program, 2 Offset, 316

Internet Explorer, 2 Segmen, 316

Resource Allocator, 2 Unit Logis, 316

Layanan, 55

Segmentasi dengan Pemberian Halaman

Tradisional, 2

Pemberian Halaman, 317

Tujuan, 419

Semafor, 187 Kenyamanan, 2 Server, 165

Windows, 1

Klien, 370 Sistem Waktu Nyata Shadowing, 452

Hard Real-Time, 140 Signal, 187

Soft Real-Time, 140 Single-tasking, 60

Skleton, 167

Sinkronisasi

Sleep On, 150

Sisi Permintaan, 212 Cara Kerja, 429 Sistem

Spooling Directory, 429 Desain, 509

Status, 56

Proteksi, 52

Status Proses

Terdistribusi, 52

New, 99

Sistem Berkas, 55

Ready, 99

Alokasi Blok, 398

Bit Map, 403 Pembagian, 433 Bit Vector, 403

Struktur

Blk_dev, 470

Hard Disk, 37

Blk_dev_struct, 470 Optical Disc, 37 chrdevs, 468, 469

Organisasi Komputer, 34

Sistem Komputer Many-to-One Model, 107 Keluaran/Masukan (M/K), 40

One-to-One Model, 107 Operasi Sistem Komputer, 36

Pembuatan, 116 Struktur Berkas

Pthreads, 113

Layered File System, 377 Specific Data, 113 Struktur Disk

Thread Pools, 112 Constant Angular Velocity, 439

User Thread, 107 Constant Linear Velocity, 439

Vertex

Waktu Akses, 439

Sumber Daya, 55

Working Set

Swap Bit Referensi, 343 Lokasi Ruang, 450

Delta, 343

Managemen Ruang, 450 Fixed Internal Timer Interrupt, 343 Penggunaan Ruang, 450

Program, 56 System CallLinux Clone Perbedaan Fork dan Clone, 152 Fork, 152 System Generation, 68 Tabel Halaman

Masukan, 308 Nomor Halaman, 308 Tabel Halaman Secara Inverted, 308 Tabel Halaman Secara Multilevel, 308

Tabel Registrasi, 93 Task Interruptible, 150 Thrashing

Halaman, 343 Kesalahan Halaman, 343 Multiprogamming, 343 Swap-In, 343 Swap-Out, 343 Utilitasi CPU, 343

Thread Definisi, 105 Kernel Thread, 107 Keuntungan

Berbagi Sumber Daya, 106 Ekonomi, 106 Responsi, 106 Utilisasi Arsitektur, 106

Multithreading, 105 Multithreading Models

Many-to-Many Model, 107