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 ...
Read More
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 book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further.
Read Less
Add this copy of Distributed Computing Through Combinatorial Topology to cart. $49.03, good condition, Sold by ThriftBooks-Reno rated 4.0 out of 5 stars, ships from Reno, NV, UNITED STATES, published 2014 by Morgan Kaufmann Publishers.
Add this copy of Distributed Computing Through Combinatorial Topology to cart. $52.56, good condition, Sold by BooksRun rated 4.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published 2014 by Morgan Kaufmann.
Add this copy of Distributed Computing Through Combinatorial Topology to cart. $59.95, very good condition, Sold by Mahler Books rated 5.0 out of 5 stars, ships from Pflugerville, TX, UNITED STATES, published 2013 by Morgan Kaufmann.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very Good. 0124045782. This book is in very good condition; no remainder marks. It does have some cover shelfwear and corner wear. Inside pages are clean.; Height: 9.25 Inches, Length: 7.5 Inches, Width: 0.76 Inches; 336 pages.
Add this copy of Distributed Computing Through Combinatorial Topology to cart. $78.71, new condition, Sold by Paperbackshop rated 4.0 out of 5 stars, ships from Bensenville, IL, UNITED STATES, published 2014 by Elsevier Science.
Add this copy of Distributed Computing Through Combinatorial Topology to cart. $87.25, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2014 by Morgan Kaufmann Publishers In.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
