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

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

blank
blank
blank
Красота
blank
Attiya H., Welch J. — Distributed computing
Attiya H., Welch J. — Distributed computing



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



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


Название: Distributed computing

Авторы: Attiya H., Welch J.

Аннотация:

Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Provides a solid introduction to the mathematical foundations and theory of distributed computing. It introduces the reader to the fundamental issues underlying the design of distributed systems i.e. communication, coordination, synchronization and uncertainty. By adopting a unifying approach to cover key elements of the theory of distributed computing, the book emphasizes the similarities between different models and explains inherent discrepancies. It is unique in presenting up-to-date results in a precise, and detailed, yet accessible manner. The emphasis is on fundamental ideas rather than optimizations and it exposes the similarities solutions to seemingly diverse problems.


Язык: en

Рубрика: Computer science/Алгоритмы/

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

ed2k: ed2k stats

Издание: 2nd edition

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Patt - Shamir, B.      152
Paxos      379
Paxos, Disk      379
Pease      123
Peek      204
Peleg, D.      5 249 367 368
Pending operation      322
Permutation, legal      192
Perry, K.      275
Peterson, G.      29 57 88 89 236 368
Petrank, E.      319
Phase bit      306
Phase king      107
Pinter, S.      367
Plotkin, S.      340
plus      204
Point, linearization      209 228
Point, read      116
Point, write      116
Port      340
Poulakidas, A.      205
Prakash, S.      340
Precision of clock      144
preference      107
Primary destination      181
probability      300
Probability, given an adversary      302
Probability, given an adversary and initial configuration      304
Problem specification      157
Process      161 162
Processor      10 161
Processor, critical      110
Processor, faulty      92
Projection      77
Protic, J.      204 205
Przytycka      57
Pseudo-identifier      299
Pseudocode conventions      14
Pseudocode conventions, for asynchronous message-passing algorithms      14
Pseudocode conventions, for layered model      165 254
Pseudocode conventions, for shared memory algorithms      62
Pseudocode conventions, for synchronous message-passing algorithms      15
Psync      186
Quality of Service      168
QUEUE      203 322 338
Queue lock      88
Queue, augmented      204 338
Queue, FIFO      66
Quiescent, $P$      80
Quiescent, configuration, for leader election      41
Quiescent, configuration, for mutual exclusion      69
Quiescent, state      41
Quorum system      236
Rabin      318 319
Rachman, O.      236 340
Raghavan, P.      318
Rajsbaum, S.      124 152 367
Rampart      187
Ramsey's theorem      54 55
Randomization      57 88 269 290
Randomized, algorithm      297 318
Randomized, consensus      308 318
Randomized, leader election      298 318
Randomized, mutual exclusion problem      305 318
Randomized, wait-free simulation      338
RANGE      352
Ravishankar      204
Raynal, M.      5 88 186
Reachable      61
Read point      116
Read-modify-write      59 66 306 321
Read/write      59 321
Read/write register      60
Real Time      140
Receive omission failure      275
Register, binary      209
Register, compare&swap      59
Register, multi-valued      209
Register, read-modify-write      59 66 306
Register, read/write      59 60 321
Register, regular      235
Register, safe      235
Register, test&set      59 65
Register, type of      60
Reischuk, R.      367 368
Reiter      187
relay      44
Relay property, for asynchronous identical Byzantine      270
Relay property, for synchronous identical Byzantine      256
Reliability, of broadcast      167 169
Reliability, of multicast      167
Remainder section      63
renaming      343 356
Renaming, $f$-resilient      359
Renaming, long-lived      360
Renaming, wait-free      357
Reset operation      65
Resilient, message passing      92
Resilient, renaming      359
Resilient, shared memory      208
Resolve      104
Restricted degree      349-351
Ring      31
Ring, anonymous      32 298
Ring, oriented      32
Ring, spaced      51
Roberts, R.      57
Robust      340
Rodeh, M.      57 318
Rotating coordinator      373
Rotem, D.      58
Roth, D.      205
round      13
Round tag      255
Round, active      50
Round, in layered model      240
Round-robin property      240
Sabel, L.      379
SAFE      244
safety      11 319
Safety property, for randomized leader election      298
Saias, I.      318
Saks, M.      367
Sandberg, J.      205
Sandoz, A.      186
Scaled execution      279
Scan operation      223
Scan operation, direct      226
Scan operation, indirect      226
Schedule, $P$-only      61
Schedule, for layered model      163
Schedule, in message passing      12
Schedule, in shared memory      61
Schedule, open      38
Scheduling      152
Scheurich, C.      205
Schieber, B.      318
Schiper, A.      186
Schlichting,R.      186
Schneider, F.      186 187 293
Schwarz, R.      152 186
Scott      89
Seen in a block execution      347
Segall, A.      29
Semaphore      63
Send omission failure      274 275
Sequence number      217 223
Sequential consistency      192
Sequential consistency property, for shared memory      192 199
Sequential specification      208
session      138
Session problem      138
Set consensus      120 343
Shared memory      59 208
Shared memory, distributed      189
Shared memory, linearizable      190
Shared memory, operations      190
Shared variable, type of      59
SHARED variables      59
Shasha, D.      340
Shavit, N.      236 340 367 368
Shifting of clock      142 146 148 198 200 201 279
Shostak, R.      123
Sift      186
Similar, behaviors      49
Similar, block executions      346 347
Similar, configurations      62 80 110 324
Similar, executions      95 128 139
Simons, B.      293
Simulation      112 119 207
Simulation of shared memory using message passing      189 229 343
Simulation, global      164 171 189 208 256
Simulation, local      165 202 240 241 248
Simulation, nonblocking      321 328 338 341
Simulation, wait-free      209 222
Simulation, wait-free, randomized      338
Simulation, when environment algorithm is known      260 264
Simulation, with respect to nonfaulty      260 264 266
Sinclair, J.      57
Singh, A.      205 236
Single-source consensus      123
Single-source FIFO property, for broadcast      169 172 173
Single-source FIFO property, for reliable broadcast      179
Sistla, A.      152
Skew of clock      143
Slot      362
Smolka, S.      318
Snapshot, atomic      116 152 222 234 344 352 357
Snapshot, distributed      135 152 236
Snir      58 318
Solves wait-free $n$-processor consensus      326
Space complexity      62
Spanning tree      15
Spanning tree, minimum-weight      29
Spauster, A.      186
Sperner's Lemma      367
spinning      68
Spira, P.      29
SPREAD      352
Srikanth      274 293
Stable properties, detection of      152
Stable request      184 185
STACK      203 326 338
Stack, augmented      204
Stark, E.      367
State machine approach      183
State, accessible      10
State, initial      10
State, quiescent      41
State, terminated, in message passing      13
State, terminated, in shared memory      61
Sticky bits      340
Stockmeyer, L.      28 124 249
Store-conditional      339 340
Strom, R.      152
Strong adversary      319
Strong consistency      192 204
Strong, H.R.      123 186 187 293
Stumm      237
Super-step      113
Support      259
Swallowing      34 36 44
Swap      326
Symmetry      33 298
SynchP      241
Synchronization epoch      284
Synchronizer      240 243
Synchronous message passing      12 240
Synchronous message passing, in layered model      240 254
Synchronous processor in layered model      253
system      10
System, in layered model      161
System, topology of      10
Tanenbaum, A.      5 166
Tbcast order      195
Tel, G.      5
Terminated algorithm      13 61
Termination detection      152
Termination property, for $k$-set consensus      344
Termination property, for approximate agreement      352
Termination property, for consensus      93
Termination property, for long-lived renaming      360
Termination property, for randomized consensus      309
Termination property, for renaming      356
Test&set      59 65 122 124 321 326 338
Thakkar, S.      89
Ticket for bakery mutual exclusion algorithm      71
Ticket for read-modify-write mutual exclusion algorithm      67
Time      13
Time complexity      13 14
Time complexity, in shared memory      62 87
Time, for an operation      198
Time-bounded      54
Timed execution      13 140 198
Timed view, with clock values      141 198
timestamp      173 217 220
Timestamp order, for broadcast messages      174 175
Timestamp system, bounded      236 368
Timestamp, bounded      236
Timestamp, candidate      185
Timestamp, final      185
Timestamp, logical      128
Timestamp, vector      130 135
Timing failure      284 290
Toggle bit      226 228
Token      173
Token Ring      57
Tomasevic      205
Tompkins, Ñ. B.      367
Topology, of a system      10 159 166 239 253 318
Totally ordered property, for broadcast      169 193
Totally ordered property, for reliable broadcast      179
Totem      186 187
Toueg, S.      123 186 187 249 274 379
Touitou, D.      340
Tournament tree      77
Transaction commit      121
Transis      186 187
Transition function      10-13 32 50 61- 63 113 141 260 298
TreadMarks      204
Tree, for information gathering      103
Tromp, J.      236
Trying section      63
Turek, J.      340
Turpin, R.      124
Tuttle      166 367
Ullman, J.      249
Unbounded values      71 73
Uncertainty of message delay      144 281
Uniform broadcast      187
unique identifier      25 34
Uniqueness property, for $k$-assignment      362
Uniqueness property, for asynchronous identical Byzantine      270
Uniqueness property, for long-lived renaming      360
Uniqueness property, for renaming      356
Univalent configuration      96 109
Universal object      327 335
Unobstructed exit      64 81-83
Unseen in a block execution      347
Update operation      223
1 2 3 4
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте