Distributed Computing: A Locality-Sensitive Approach

Β· SIAM
Π•Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°
359
Π‘Ρ‚Ρ€Π°Π½ΠΈΡ†ΠΈ
ΠžΡ‚Π³ΠΎΠ²Π°Ρ€Ρ Π½Π° условията
ΠžΡ†Π΅Π½ΠΊΠΈΡ‚Π΅ ΠΈ ΠΎΡ‚Π·ΠΈΠ²ΠΈΡ‚Π΅ Π½Π΅ са ΠΏΠΎΡ‚Π²ΡŠΡ€Π΄Π΅Π½ΠΈ  ΠΠ°ΡƒΡ‡Π΅Ρ‚Π΅ ΠΏΠΎΠ²Π΅Ρ‡Π΅

Всичко Π·Π° Ρ‚Π°Π·ΠΈ Π΅Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°

Presents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications. 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.

ΠžΡ†Π΅Π½Π΅Ρ‚Π΅ Ρ‚Π°Π·ΠΈ Π΅Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°

ΠšΠ°ΠΆΠ΅Ρ‚Π΅ Π½ΠΈ ΠΊΠ°ΠΊΠ²ΠΎ мислитС.

Π˜Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΡ Π·Π° Ρ‡Π΅Ρ‚Π΅Π½Π΅Ρ‚ΠΎ

Π‘ΠΌΠ°Ρ€Ρ‚Ρ„ΠΎΠ½ΠΈ ΠΈ Ρ‚Π°Π±Π»Π΅Ρ‚ΠΈ
Π˜Π½ΡΡ‚Π°Π»ΠΈΡ€Π°ΠΉΡ‚Π΅ ΠΏΡ€ΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΠ΅Ρ‚ΠΎ Google Play Книги Π·Π° Android ΠΈ iPad/iPhone. Π’ΠΎ Π°Π²Ρ‚ΠΎΠΌΠ°Ρ‚ΠΈΡ‡Π½ΠΎ сС синхронизира с ΠΏΡ€ΠΎΡ„ΠΈΠ»Π° Π²ΠΈ ΠΈ Π²ΠΈ позволява Π΄Π° Ρ‡Π΅Ρ‚Π΅Ρ‚Π΅ ΠΎΠ½Π»Π°ΠΉΠ½ ΠΈΠ»ΠΈ ΠΎΡ„Π»Π°ΠΉΠ½, ΠΊΡŠΠ΄Π΅Ρ‚ΠΎ ΠΈ Π΄Π° стС.
Π›Π°ΠΏΡ‚ΠΎΠΏΠΈ ΠΈ ΠΊΠΎΠΌΠΏΡŽΡ‚Ρ€ΠΈ
ΠœΠΎΠΆΠ΅Ρ‚Π΅ Π΄Π° ΡΠ»ΡƒΡˆΠ°Ρ‚Π΅ Π·Π°ΠΊΡƒΠΏΠ΅Π½ΠΈΡ‚Π΅ ΠΎΡ‚ Google Play Π°ΡƒΠ΄ΠΈΠΎΠΊΠ½ΠΈΠ³ΠΈ посрСдством ΡƒΠ΅Π± Π±Ρ€Π°ΡƒΠ·ΡŠΡ€Π° Π½Π° ΠΊΠΎΠΌΠΏΡŽΡ‚ΡŠΡ€Π° си.
Π•Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½ΠΈ Ρ‡Π΅Ρ‚Ρ†ΠΈ ΠΈ Π΄Ρ€ΡƒΠ³ΠΈ устройства
Π—Π° Π΄Π° Ρ‡Π΅Ρ‚Π΅Ρ‚Π΅ Π½Π° устройства с Π΅Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½ΠΎ мастило, ΠΊΠ°Ρ‚ΠΎ Π½Π°ΠΏΡ€ΠΈΠΌΠ΅Ρ€ Π΅Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½ΠΈΡ‚Π΅ Ρ‡Π΅Ρ‚Ρ†ΠΈ ΠΎΡ‚ Kobo, трябва Π΄Π° ΠΈΠ·Ρ‚Π΅Π³Π»ΠΈΡ‚Π΅ Ρ„Π°ΠΉΠ» ΠΈ Π΄Π° Π³ΠΎ ΠΏΡ€Π΅Ρ…Π²ΡŠΡ€Π»ΠΈΡ‚Π΅ Π½Π° устройството си. Π˜Π·ΠΏΡŠΠ»Π½Π΅Ρ‚Π΅ ΠΏΠΎΠ΄Ρ€ΠΎΠ±Π½ΠΈΡ‚Π΅ инструкции Π² ΠŸΠΎΠΌΠΎΡ‰Π½ΠΈΡ Ρ†Π΅Π½Ρ‚ΡŠΡ€, Π·Π° Π΄Π° ΠΏΡ€Π΅Ρ…Π²ΡŠΡ€Π»ΠΈΡ‚Π΅ Ρ„Π°ΠΉΠ»ΠΎΠ²Π΅Ρ‚Π΅ Π² ΠΏΠΎΠ΄Π΄ΡŠΡ€ΠΆΠ°Π½ΠΈΡ‚Π΅ Π΅Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½ΠΈ Ρ‡Π΅Ρ‚Ρ†ΠΈ.
ПодаванС Π½Π° сигнал Π·Π° Π½Π΅Π·Π°ΠΊΠΎΠ½Π½ΠΎ ΡΡŠΠ΄ΡŠΡ€ΠΆΠ°Π½ΠΈΠ΅

ΠžΡ‰Π΅ ΠΎΡ‚ David Peleg

Distributed Computing: 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011, Proceedings
David Peleg
ΠšΠΎΠΌΠΏΡŽΡ‚Ρ€ΠΈ ΠΈ Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ
54,49 β‚¬38,14 β‚¬
Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II
Fedor V. Fomin
ΠšΠΎΠΌΠΏΡŽΡ‚Ρ€ΠΈ ΠΈ Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ
54,49 β‚¬38,14 β‚¬
Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I
Fedor V. Fomin
ΠšΠΎΠΌΠΏΡŽΡ‚Ρ€ΠΈ ΠΈ Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ
54,49 β‚¬38,14 β‚¬
SOFSEM 2010: Theory and Practice of Computer Science: 36th Conference on Current Trends in Theory and Practice of Computer Science, Ε pindleruv MlΓ½n, Czech Republic, January 23-29, 2010. Proceedings
Jan van Leeuwen
ΠšΠΎΠΌΠΏΡŽΡ‚Ρ€ΠΈ ΠΈ Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ
98,09 β‚¬68,66 β‚¬

Подобни Π΅Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½ΠΈ ΠΊΠ½ΠΈΠ³ΠΈ

Combinatorial Data Analysis: Optimization by Dynamic Programming
Lawrence Hubert
86,95 β‚¬60,86 β‚¬
Evaluation and Optimization of Electoral Systems
Pietro Grilli Di Cortona
ΠšΠΎΠΌΠΏΡŽΡ‚Ρ€ΠΈ ΠΈ Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ
91,58 β‚¬64,11 β‚¬
Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I
Fedor V. Fomin
ΠšΠΎΠΌΠΏΡŽΡ‚Ρ€ΠΈ ΠΈ Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ
54,49 β‚¬38,14 β‚¬
Solutions Architect's Handbook: Kick-start your career with architecture design principles, strategies, and generative AI techniques, Edition 3
Saurabh Shrivastava
ΠšΠΎΠΌΠΏΡŽΡ‚Ρ€ΠΈ ΠΈ Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ
39,23 β‚¬27,46 β‚¬