UID:
edoccha_9960073763502883
Format:
1 online resource (xiv, 319 pages) :
,
illustrations (some color)
Edition:
1st ed.
ISBN:
0-12-404728-9
Series Statement:
Gale eBooks
Content:
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
Note:
Description based upon print version of record.
,
part I. Fundamentals -- part II. Colorless tasks -- part III. General tasks -- part IV. Advanced topics.
,
English
Additional Edition:
ISBN 0-12-404578-2
Language:
English
Bookmarklink
