Distributed computing through combinatorial topology
Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, s...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | eBook |
| Language: | Inglés |
| Published: |
Waltham, MA :
Morgan Kaufmann
2014.
|
| Edition: | 1st ed |
| Series: | Gale eBooks
|
| Subjects: | |
| See on Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009628354706719 |
| Summary: | Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This |
|---|---|
| Item Description: | Description based upon print version of record. |
| Physical Description: | 1 online resource (xiv, 319 pages) : illustrations (some color) |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 9780124047280 |
