1 2 3 <== Hierarchie Ort Seite # 127.0.0.1 --> loopback 1-to-1 relation (relational database) C7 - Databases 63 1-to-n relation (relational database) C7 - Databases 62 255.255.255.255 --> broadcast address: IPv4, DHCPv4 ff02::1:2 --> broadcast address: DHCPv6 ff:ff:ff:ff:ff:ff --> broadcast address: MAC A abortable locks C4 - Locks 65-67 abortable MCS lock C4 - Locks 67 absorbing states (Markov chains) C11 - Markov Chains & PageRank 97 abstraction (device driver) C9 - I/O Devices / File Systems 7 access method (file system) C9 - I/O Devices / File Systems 62 ACK (acknowledgement) packet C2 - Transport Layer (L3) 23 acknowledgement packet --> ACK additive increase / multiplicative decrease --> AIMD address --> broadcast address --> IPv4 / IPv6 --> MAC address block --> IPv4 address prefix --> IPv4 address resolution protocol --> ARP adjacency list --> graphs AIMD (additive increase / multiplicative decrease) C2 - Transport Layer (L3) 21 allocation structure (vsfs) C9 - I/O Devices / File Systems 63 ALock (Anderson queue lock) --> locks AM (amplitude modulation) --> modulation amplitude modulation (AM) --> modulation anchor text C11 - Markov Chains & PageRank 102 Anderson queue lock (ALock) --> locks anonymous pipe --> (ordinary) pipe aperiodic (Markov chains) C11 - Markov Chains & PageRank 99 distinguish aperiodic states and an aperiodic Markov chain! ARP (address resolution protocol) C10 - Link Layer (L1) 79 arrival probability (Markov chains) C11 - Markov Chains & PageRank 95 AS (autonomous system) C1 - Network Layer (L2) 8 ASN (autonomous system number) C1 - Network Layer (L2) 8 associative array --> dictionary atomic instruction (read-modify-write (RMW) instruction) C4 - Locks 12-13 C5 - Process Synchr. & Deadlocks 24 --> CAS (compare-and-swap) DCAS (double compare-and-swap) (not part of lecture) FAA (fetch-and-add) (not part of lecture) MCAS (multiple compare-and-swap) (not part of lecture) --> TAS (test-and-set) atomic statement (database) --> transaction atomic write (HDD) C9 - I/O Devices / File Systems 12 AtomicBoolean (Java class) C4 - Locks 19 1 2 3 <== Hierarchie Ort Seite attribute (relational database) C7 - Databases 62 augmenting paths C2 - Transport Layer (L3) 16 authoritative nameserver C3 - Application Layer (L4) 33 autonomous system --> AS autonomous system number --> ASN average seek C9 - I/O Devices / File Systems 20 B B* tree C7 - Databases 70 B+ tree C7 - Databases 67-70 backoff strategy C10 - Link Layer (L1) 84 random exponential backoff C10 - Link Layer (L1) 85 slotted aloha C10 - Link Layer (L1) 84 backoff time C10 - Link Layer (L1) 84 balanced search tree C6 - Dictionaries (& Hashing) 44 balanced tree --> B+ tree bank (SSD) C9 - I/O Devices / File Systems 27 BGP (border gateway protocol) C1 - Network Layer (L2) (8), 10 binary search tree C6 - Dictionaries (& Hashing) 43 birthday problem C6 - Dictionaries (& Hashing) 45 Bit / Byte stuffing C10 - Link Layer (L1) 87 --> consistent overhead byte stuffing bitmap (vsfs) C9 - I/O Devices / File Systems 63 block (adresses) --> IPv4 block (file system) C9 - I/O Devices / File Systems 62 block (SSD) C9 - I/O Devices / File Systems 27 logical / physical block --> FTL blocking lock --> locks block-level FTL --> FTL Bluetooth packet --> packet types boolean operator --> SQL statements: SELECT border gateway protocol --> BGP bounded-buffer problem C5 - Process Synchr. & Deadlocks 33 branching factor b (B+ tree) C7 - Databases 67 broadcast address DHCPv6 - ff02::1:2 C10 - Link Layer (L1) 80 global (IPv4, DHCPv4) - 255.255.255.255 C10 - Link Layer (L1) 79 MAC - ff:ff:ff:ff:ff:ff C10 - Link Layer (L1) 78 buckets M[0]...M[m-1] (hashing) C6 - Dictionaries (& Hashing) 44 bulk encryption algorithm C12 - Security 116 C c(h,N) (number of collisions) C6 - Dictionaries (& Hashing) 47 CA --> certificate authority cache (HDD) C9 - I/O Devices / File Systems 16 cache coherence C4 - Locks 32 cache hit C4 - Locks 28 cache miss C4 - Locks 28 cache write method C9 - I/O Devices / File Systems 16 --> write-back --> write-through 1 2 3 <== Hierarchie Ort Seite canonical (not real) device C9 - I/O Devices / File Systems 2 consist of: internal structure, interface canonical form (linear program) C2 - Transport Layer (L3) 18 canonical protocol C9 - I/O Devices / File Systems 3 capacity --> flows carrier sensing --> CCA carrier signal C10 - Link Layer (L1) 90 CAS (compare-and-swap) C4 - Locks 13 cascading style sheet --> CSS CBC --> cipher block chaining CCA (clear channel assessment) C10 - Link Layer (L1) 83 certificate authority C12 - Security 114 checksum C10 - Link Layer (L1) 89 cipher block chaining C12 - Security 116 circuit (telephone network) C1 - Network Layer (L2) 7 clear channel assessment --> CCA CLH (Craig, Landin, and Hagersten) lock --> locks client = consumer = sender close() --> system calls closedir() --> system calls clustering (hashing) C6 - Dictionaries (& Hashing) 51 coalescing (interrupt delaying?) C9 - I/O Devices / File Systems 5 coarse-grained synchronization --> synchronization code division --> medium division collision (hashing) C6 - Dictionaries (& Hashing) 45 collision avoidance --> medium division collision resistant hash function C12 - Security 117 collision response C10 - Link Layer (L1) 84 commute time (Markov chains) C11 - Markov Chains & PageRank 95 Comparable (Java Class) C6 - Dictionaries (& Hashing) 50 compare-and-swap --> CAS composite locks C4 - Locks 68-70 congestion control C2 - Transport Layer (L3) 24 connected graph --> graphs connection (definition) C2 - Transport Layer (L3) 23 consistent overhead byte stuffing C10 - Link Layer (L1) 88 CONSTRAINT --> SQL statements: ALTER TABLE cooperating process C5 - Process Synchr. & Deadlocks 2 cost (SSD) C9 - I/O Devices / File Systems 42 count-to-infinity problem C1 - Network Layer (L2) 10 cover time cov(v) C11 - Markov Chains & PageRank 103 creat() --> system calls CREATE DATABASE --> SQL Statements critical-section problem C5 - Process Synchr. & Deadlocks 19 entry section, critical section, exit section, remainder sect. Peterson's solution C5 - Process Synchr. & Deadlocks 21-22 C-SCAN (elevator unidirectional) --> disk scheduler CSS (cascaded style sheet) C3 - Application Layer (L4) 32 rules, selectors, declaration cuckoo hashing --> hashing current offset (file access) C9 - I/O Devices / File Systems 50 cycle --> graphs 1 2 3 <== Hierarchie Ort Seite D dangling reference (symbolic link) C9 - I/O Devices / File Systems 58 data bitmap --> bitmap data structure (file system) C9 - I/O Devices / File Systems 61 database: collection of tables C7 - Databases 57 datagram --> packet dead block (SSD) --> garbage collection deadlock C5 - Process Synchr. & Deadlocks (31), 44-51 delete file / directory --> system calls destination (target) t --> flows device driver C9 - I/O Devices / File Systems 7-10 IDE device driver C9 - I/O Devices / File Systems 8-10 DHCP (dynamic host configuration protocol) C10 - Link Layer (L1) 79 dictionary definition C6 - Dictionaries (& Hashing) 43 operations: search, insert, delete C6 - Dictionaries (& Hashing) 43 Diffie-Hellman Key Exchange C12 - Security 107 with forward secrecy C12 - Security 110 dimensional analysis C9 - I/O Devices / File Systems 17 dining-philosophers problem C5 - Process Synchr. & Deadlocks 35-37 direct mapped flash transaction layer --> FTL direct memory access --> DMA direct pointer (file system) C9 - I/O Devices / File Systems 66 directed graphs --> graphs --> Markov Chains directory C9 - I/O Devices / File Systems 45 discrete logarithm problem C12 - Security 108 disk arm (HDD) C9 - I/O Devices / File Systems 13 disk head (HDD) C9 - I/O Devices / File Systems 13 disk scheduler C9 - I/O Devices / File Systems 21 NBF (nearest-block-first) C9 - I/O Devices / File Systems 21 SCAN (elevator) C9 - I/O Devices / File Systems 22 C-SCAN (elevator unidirectional) C9 - I/O Devices / File Systems 22 F-SCAN (elevator with freeze) C9 - I/O Devices / File Systems 22 SATF (shortest-access-time-first) C9 - I/O Devices / File Systems 23 SJF (shortest-job-first) C9 - I/O Devices / File Systems 21 SPTF (shortest-positioning-time-first) C9 - I/O Devices / File Systems 23 SSF (shortest-seek-first) C9 - I/O Devices / File Systems 21 SSTF (shortest-seek-time-first) C9 - I/O Devices / File Systems 21 disk scheduling work-conserving C9 - I/O Devices / File Systems 24 non-work-conserving C9 - I/O Devices / File Systems 24 distance in a graph C1 - Network Layer (L2) 4 distance-vector --> DV distance-vector routing --> routing DISTINCT --> SQL statements: SELECT aggregate disturbance (SSD) C9 - I/O Devices / File Systems 30 sequential-programming approach C9 - I/O Devices / File Systems 32 DMA (direct memory access) C9 - I/O Devices / File Systems 5-6 1 2 3 <== Hierarchie Ort Seite DNS (domain name system) C3 - Application Layer (L4) 33 RR (ressource record): A: IPv4 domain name mapping AAAA: IPv6 domain name mapping CNAME: canonical name NS: name server MX: mailserver double hashing --> hashing with probing double indirect pointer (file system) --> indirect pointer duplex (half / full) C10 - Link Layer (L1) 80 duty cycling C10 - Link Layer (L1) 86 DV (distance-vector) routing --> routing dynamic hashing --> hashing dynamic host configuration protocol --> DHCP dynamic partitioning --> memory management C9 - I/O Devices / File Systems dynamic perfect hashing --> hashing E ECB --> electronic block code eigenvectors (Markov chains) C11 - Markov Chains & PageRank 97 electronic block code C12 - Security 116 elevator algorithm (SCAN) --> disk scheduler Elgamal authentication C12 - Security