Files in this item

FilesDescriptionFormat

application/pdf

application/pdftop_dc.pdf (255kB)
main articlePDF

Description

Title:Survey on Topological Methods in Distributed Computing
Author(s):Rahman, Muntasir Raihan
Subject(s):Distributed Computing
Combinatorial Topology
Algebraic Topology
Lower Bound and Impossibility Results
Abstract:One of the most exciting developments in the theory of distributed computing in recent years has been the application of powerful concepts from topology to prove results about computability in resilient distributed systems. Topology is a branch of mathematics that deals with connectivity and convergence of certain types of objects. As it turns out, the higher dimensional connectivity properties of these special objects are related to the solvability of certain distributed computing tasks. In this survey, we thoroughly investigate the topological approach to distributed computing, especially how to use techniques from combinatorial and algebraic topology to prove impossibility and lower bound results for important problems in distributed systems.
Issue Date:2012-07-31
Genre:Technical Report
Type:Text
Language:English
URI:http://hdl.handle.net/2142/33762
Publication Status:unpublished
Peer Reviewed:not peer reviewed
Date Available in IDEALS:2012-07-31


This item appears in the following Collection(s)

Item Statistics