Sökning: onr:"swepub:oai:DiVA.org:kth-234110" >
On the distributed ...
On the distributed complexity of large-scale graph computations
-
Pandurangan, G. (författare)
-
Robinson, P. (författare)
-
- Scquizzato, Michele (författare)
- KTH,Teoretisk datalogi, TCS
-
(creator_code:org_t)
- 2018-07-11
- 2018
- Engelska.
-
Ingår i: SPAA '18 Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. - New York, NY, USA : Association for Computing Machinery (ACM). - 9781450357999 ; , s. 405-414
- Relaterad länk:
-
https://dl.acm.org/d...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where k 2 machines jointly perform computations on graphs with n nodes (typically, n ≫ k). The input graph is assumed to be initially randomly partitioned among the k machines, a common implementation in many real-world systems. Communication is point-to-point, and the goal is to minimize the number of communication rounds of the computation.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas