√лавна€    Ex Libris     ниги    ∆урналы    —татьи    —ерии     аталог    Wanted    «агрузка    ’удЋит    —правка    ѕоиск по индексам    ѕоиск    ‘орум   
blank
јвторизаци€

       
blank
ѕоиск по указател€м

blank
blank
blank
 расота
blank
Peleg D. Ч Distributed Computing: A Locality-Sensitive Approach (Monographs on Discrete Mathematics and Applications)
Peleg D. Ч Distributed Computing: A Locality-Sensitive Approach (Monographs on Discrete Mathematics and Applications)

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

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

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



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


Ќазвание: Distributed Computing: A Locality-Sensitive Approach (Monographs on Discrete Mathematics and Applications)

јвтор: Peleg D.

јннотаци€:

The only book that gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists.


язык: en

–убрика: ћатематика/

—татус предметного указател€: √отов указатель с номерами страниц

ed2k: ed2k stats

√од издани€: 1987

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

ƒобавлена в каталог: 27.10.2010

ќперации: ѕоложить на полку | —копировать ссылку дл€ форума | —копировать ID
blank
ѕредметный указатель
$D_R$      300
$D_{client}$      310
$D_{server}$      117
$S_{opt}$      208
$\hat{\varphi}$      88
$\lambda$      17
$\tilde{\varphi}$      86
$\varphi$      79
${Message}_{init}$      73
${Time}_{init}$      73
${Time}_{pulse}$      73
(s,r)-set      255Ч259
Acknowledgement      34Ч35 37
Adversary      8 26
Algorithm, $\mathfrak{k}$-$\mathscr{Flood}$      271Ч272
Algorithm, $\mathscr{Asyn}$_$\mathscr{Cover}$      135Ч139 144 147Ч148 158 244
Algorithm, $\mathscr{Asyn}$_$\mathscr{Max}$_$\mathscr{Cover}$      253
Algorithm, $\mathscr{Av}$_$\mathscr{Str}$_$\mathscr{Tree}$      214Ч217
Algorithm, $\mathscr{Av}$_$\mathscr{{Part}_c}$      147 153
Algorithm, $\mathscr{Av}$_$\mathscr{{Part}_e}$      153Ч154 214 217
Algorithm, $\mathscr{Av}$_$\mathscr{{Part}_v}$      147Ч148
Algorithm, $\mathscr{Av}$_$\mathscr{{Part}_w}$      217
Algorithm, $\mathscr{Basic}$_$\mathscr{Part}$      129Ч130 133 177 212 233Ч238
Algorithm, $\mathscr{Controlled}$-GHS      276Ч279
Algorithm, $\mathscr{Decomp}$      158Ч159
Algorithm, $\mathscr{Decomp}$2MIS      292Ч293
Algorithm, $\mathscr{Dist}$_$\mathscr{Decomp}$      257Ч258
Algorithm, $\mathscr{Dist}$_$\mathscr{Dijk}$      50Ч52 113 234 236
Algorithm, $\mathscr{Dist}$_$\mathscr{Part}$      233Ч238
Algorithm, $\mathscr{Dist}$_$\mathscr{Prim}$      56Ч58
Algorithm, $\mathscr{Dist}$_BF      52Ч53
Algorithm, $\mathscr{Dist}$_DFS      54Ч55 235 236
Algorithm, $\mathscr{Downcast}$      41
Algorithm, $\mathscr{Fast}$-MST      275Ч280 286Ч287
Algorithm, $\mathscr{Flood}$      33Ч35 49 52 66 77 256 259 262Ч264
Algorithm, $\mathscr{Flood}$&$\mathscr{Echo}$      35 39
Algorithm, $\mathscr{Greedy}$_$\mathscr{Span}$      197Ч199 205 238 272
Algorithm, $\mathscr{Greedy}$_MIS      91
Algorithm, $\mathscr{Inter}$_$\mathscr{Label}$      229
Algorithm, $\mathscr{Light}$_$\mathscr{Span}$      199Ч204 263
Algorithm, $\mathscr{Max}$_$\mathscr{Cover}$      141Ч145 160 172 239 244
Algorithm, $\mathscr{Max}$_$\mathscr{{Part}_c}$      151Ч153
Algorithm, $\mathscr{Max}$_$\mathscr{{Part}_v}$      149Ч151 153
Algorithm, $\mathscr{Neig}$_$\mathscr{LabeL}$      222
Algorithm, $\mathscr{Ordered}$_$\mathscr{Upcast}$      43
Algorithm, $\mathscr{Rand}$_MIS      97
Algorithm, $\mathscr{Ranked}$_$\mathscr{Upcast}$      42
Algorithm, $\mathscr{Reg}$_$\mathscr{Match}$      160Ч161
Algorithm, $\mathscr{Six}2\mathscr{Three}$      83
Algorithm, $\mathscr{Sync}$_$\mathscr{Av}$_$\mathscr{Cover}$      243Ч252
Algorithm, $\mathscr{Sync}$_$\mathscr{Max}$_$\mathscr{Cover}$      243 249Ч252
Algorithm, $\mathscr{Tcast}$      31Ч33 35 262 290
Algorithm, $\mathscr{Traveler}$      265Ч266
Algorithm, $\mathscr{Tree}$_$\mathscr{Cover}$      172Ч173 199 202 227
Algorithm, $\mathscr{Tree}$_$\mathscr{Embed}$      167Ч168
Algorithm, $\mathscr{Tree}$_$\mathscr{Label}$      224Ч226
Algorithm, $\mathscr{Unordered}$_$\mathscr{Upcast}$      43
Algorithm, $\mathscr{Unweighted}$_$\mathscr{Span}$      177Ч179
Algorithm, $\mathscr{Weighted}$_$\mathscr{Span}$      196Ч197 199 227
Algorithm, ${MIS}_{DFS}$      92Ч93 101
Algorithm, ${MIS}_{RANK}$      92Ч93 101
Algorithm, 6-$\mathscr{Color}$      81Ч84
Algorithm, event-driven      7
Algorithm, GHS      57Ч60 66 275Ч280 287
Algorithm, greedy      47 60Ч63 91Ч93 162 197Ч198
Algorithm, LQ      305Ч306
Algorithm, PRAM_MIS      101 293
Algorithm, randomized      89 97Ч102 162 239Ч243 253 266 272 287
Algorithm, SLT      192Ч194 205Ч206 238 263
Arboricity      223Ч230
Average stretch      10 207Ч220
BFS      32 49Ч57 66Ч68
Blue rule      56Ч58 66
Breadth-first search tree      32 66Ч68
Breadth-first search tree, distributed construction      49Ч53
Broadcast      31Ч40 261Ч272
Buffer      16 19 71 109
Buffer, inbound      301
Buffer, outbound      301
Child      18
Chromatic number      80
CLIQUE      183Ч187
Cluster      9 123Ч154
Cluster, cardinality-based      161Ч163
Cluster, cluster-neighborhood      127
Cluster, degree      128
Cluster, graph      127
Cluster, vertex degree      128
Cluster, vertex-neighborhood      127
Cluster, weak      132
Coarsening      131Ч132 135Ч155 160 162 171Ч173 180 199 200 212 239Ч253
Coloring, edge      88
Coloring, vertex      79Ч89
Communication cost      25
Complexity bound, existential      25
Complexity bound, global      25
Complexity, message      23 24
Complexity, space      22
Complexity, space, maximum      22
Complexity, space, total      22
Complexity, time      21
Complexity, time, asynchronous      22
Complexity, time, synchronous      22
Configuration      19
Configuration, initial      19
Convergecast      34Ч40 50 57 75 113 234Ч235 290
Correct simulation      69Ч70
Cover      123Ч129 135Ч145
Cover, $\rho$-neighborhood      126 133 135 138 140 143 155 172 239 243 251 253
Cover, distributed, construction      239Ч253
Cover, distributed, construction, low communication      243Ч253
Cover, distributed, construction, randomized      239Ч243
Cover, hierarchy      155Ч157 163Ч164
Cover, hierarchy, refinement      155Ч156 312Ч314
Cycle radius      274 275
Deg      16
Degree, cover      127
Degree, cover, average      127
Degree, cover, maximum      127
Degree, cover, weighted      144
Degree, graph      167
Degree, graph, maximum      167
Degree, regional matching      160
Degree, tree cover, maximum      171
Depth, tree      17
Depth, tree cover      171
Depth-first search      49 54 229
Depth-first search, tree      54Ч55 66Ч68
DFS      49 54 229
Diameter, cluster      125
Diameter, cluster, weak      132
Diameter, ratio      205
Diameter, unweighted      17 274
Dilation, broadcast      261
Dilation, routing      107
Directory      113
Directory, hierarchical      306Ч309 312Ч316
Directory, hierarchical, refinement      312Ч314
Directory, regional      305Ч316
Distance      16Ч18
Distance, code      182
Distance, unweighted      16 126 217
Distributed match-making      118
Dominating set      95Ч96 182 276 277
downcast      41
Edge utilization      266Ч268 270
Enabling property      72
Event      19
Event, communication      19
Event, computation      19
execution      20
Execution, externally similar      268
Execution, legal      20
Execution, similar      70
External radius      274
flooding      33Ч34 39Ч40 49 52 66 77 256 259 262Ч264 271Ч272
Free bit      116
Function globally-sensitive      36
Function semigroup      36 38 113 114 117 119
girth      166
Graph      16Ч18
Graph, cartesian product      181
Graph, center      17
Graph, chordal      183Ч189 222 303
Graph, complete      23 205 209 272 286
Graph, grid      75 112 124 143 163 172 174 181 188 209 220 224 230 272 303
Graph, hypercube      112 180Ч183 187 188 224 230 292 315
Graph, line      87Ч88
Graph, planar      75 102 133 154 158 181 188 198 220 223 230 303
Graph, ring      52 53 75 85Ч89 93Ч94 102 108 112 181 209 224 230 272 303
Graph, split      183
Graph, universal      223Ч224 229Ч230
Graph, unweighted      16
Greedoid      61
Hamming code      182
Header, function      104
Header, initial      104
Header, initial function      104
Home-cluster      252
Home-tree      171
ID-assignment      15
Identifier      15
Independent maximum      91
Independent set      91
Independent set, matroid      60
Independent set, maximal      79 91Ч102
Independent set, maximal, decomposition based      292Ч294
Independent set, maximal, lexicographically first      91Ч92 101
Individual messages problem      28
Intercluster edges      127
ITR      228Ч230 295Ч304
J-usable server      309Ч310 314
Job scheduling      315
k-of-$\mathfrak{m}$ problem, largest      65
k-of-$\mathfrak{m}$ problem, smallest      44Ч45 65
k-server problem      219 317
Kernel      135
Key      62
Label, adjacency      222
Label, approximate-distance      227
Label, distance      224
Label, interval      229 295
Label, routing      103
Labeling scheme, adjacency      221Ч224
Labeling scheme, approximate-distance      227Ч228
Labeling scheme, distance      224Ч227
Labeling scheme, interval      228Ч230
Layer      18Ч19
Leader election      79
Local query      113Ч115 305Ч306
Local query, centralized      115
Local query, full updates      115
Local query, update-free      114
Mailing problem      280Ч287
Matching, global      118
Matching, regional      159Ч164 180 188 252 305Ч308 312 316
Matroid      61
Matroid, minimally dependent set      62
Matroid, optimization      60Ч68
Matroid, pipeline algorithm      62Ч68
Matroid, rank      61
Minimum total distance tree      169
Minimum-weight outgoing edge      56Ч60
Minimum-weight spanning tree      55Ч60 191Ч206 218Ч219 238 263
Minimum-weight spanning tree, distributed construction      55Ч68 273Ч287
Minimum-weight spanning tree, fragment      56Ч60 274Ч287
Minimum-weight spanning tree, fragment forest      59 276Ч279
MIS      79 91Ч102
Mobile tracking      315
Model, $\mathcal{ASYNC}$      27Ч29 69 77 289
Model, $\mathcal{CONGEST}$      27 243 275Ч276 280
Model, $\mathcal{CONGEST}$ asynchronous      49 57
Model, $\mathcal{CONGEST}$ synchronous      28 41 58 60 287
Model, $\mathcal{LOCAL}$      27Ч29 77 79 85 91 97 239 255 274Ч276 292
Model, anonymous      4 27 56 67 93 94 102 239 264
Model, asynchronous      6Ч7 69Ч77
Model, clean network      20 31 49 56 264
Model, comparison      267
Model, distributed      15Ч29
Model, known topology      264Ч272
Model, message-passing      2 15Ч16
Model, point-to-point      3 15Ч16
Model, PRAM      2
Model, shared memory      2
Model, synchronous      5 7 69Ч77
MST      49 55Ч60 191Ч206 218Ч219 238 262Ч263
Multigraph      15
name server      109 119 315
Neighbor update problem      74
Neighborhood      17Ч18
Neighborhood, code      182
Neighborhood, size-based      161Ч163
Neighborhood, unweighted      126 217
Network decomposition      157Ч159 163Ч164 180 253 292Ч294
Network decomposition, colored      257
Network decomposition, distributed construction      255Ч259
network design      317
Nondeterminism      6
Nonspannability      179 182 187 189
Operation $\mathscr{Find}$      116Ч119 306Ч314
Operation $\mathscr{Query}$      113Ч117 305Ч306
Operation $\mathscr{Update}$      114Ч115 117Ч119 307Ч316
Overlap, tree cover      171
Palette reduction      80Ч81
Partition      123Ч130 147Ч154
Partition, (s,r)      255
Partition, distributed construction      233Ч238
Partition, partial      138Ч145
Partition, separated      131 140Ч145
Pipeline      38Ч45 62Ч68 216 235Ч237
Pivot      155Ч162 312Ч316
Pivot, subordinate      155
Pivot, supervisor      156
Port      3 16
Port, function      104
Procedure $\mathscr{Cluster}$      244Ч251
Procedure $\mathscr{Cluster}$_$\mathscr{Cons}$      234 236Ч238 245
Procedure $\mathscr{Color}$2MIS      93
Procedure $\mathscr{Converge}$      34Ч40 50 57 75 113 234Ч235 290
Procedure $\mathscr{Dist}$_$\mathscr{Calc}$      224Ч226
Procedure $\mathscr{Dist}$_$\mathscr{Estimate}$      227Ч228
Procedure $\mathscr{First}$_$\mathscr{Free}$      80Ч84 258
Procedure $\mathscr{Graph}$_$\mathscr{Label}$      227
Procedure $\mathscr{Join}$      92
Procedure $\mathscr{Light}$_TC      199Ч203
Procedure $\mathscr{Next}$_$\mathscr{Ctr}$      234Ч238
Procedure $\mathscr{Part}$      138Ч143 145 158
Procedure $\mathscr{Pipeline}$      63Ч68 276Ч279
Procedure $\mathscr{Pipeline}$MST      66Ч68
Procedure $\mathscr{Rand}$_$\mathscr{Part}$      239Ч243
Procedure $\mathscr{RecurseColor}$      84Ч85 258
Procedure $\mathscr{Reduce}$      80Ч81 84 93
Procedure $\mathscr{Rep}$_$\mathscr{Edge}$      234Ч238
Procedure $\mathscr{Sep}$_$\mathscr{Part}$      140Ч141 143 158 159 239
Procedure $\mathscr{Sep}$_$\mathscr{Rule}$_$\mathscr{Part}$      255Ч256
Procedure $\mathscr{Shift}$_$\mathscr{Down}$      82Ч83
Procedure $\mathscr{Small}$_$\mathscr{Dom}$_$\mathscr{Set}$      95Ч96 276Ч278
Procedure $\mathscr{Sub}$_$\mathscr{Tree}$_$\mathscr{Label}$      224
Procedure $\mathscr{Sync}$_$\mathscr{Part}$      244Ч252
Procedure $\mathscr{Tour}$_MST      192Ч199
1 2
blank
–еклама
blank
blank
HR
@Mail.ru
       © Ёлектронна€ библиотека попечительского совета мехмата ћ√”, 2004-2019
Ёлектронна€ библиотека мехмата ћ√” | Valid HTML 4.01! | Valid CSS! ќ проекте