Sökning: WFRF:(Tzoumas Kostas) >
Asymmetry in Large-...
Asymmetry in Large-Scale Graph Analysis, Explained
-
- Kalavri, Vasiliki (författare)
- KTH,Programvaruteknik och Datorsystem, SCS
-
- Ewen, Stephan (författare)
- TU Berlin
-
- Tzoumas, Kostas (författare)
- TU Berlin
-
visa fler...
-
- Vlassov, Vladimir (författare)
- KTH,Programvaruteknik och Datorsystem, SCS
-
- Markl, Volker (författare)
- TU Berlin
-
- Haridi, Seif (författare)
- KTH,Programvaruteknik och Datorsystem, SCS
-
visa färre...
-
(creator_code:org_t)
- 2014-06-22
- 2014
- Engelska.
-
Ingår i: <em>Proceedings of the Second International Workshop on Graph Data ManagementExperience and Systems (GRADES 2014)</em>, June 22, 2014, Snowbird, Utah, USA.. - New York, NY, USA : ACM.
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Iterative computations are in the core of large-scale graph processing. In these applications, a set of parameters is continuously refined, until a fixed point is reached. Such fixed point iterations often exhibit non-uniform computational behavior, where changes propagate with different speeds throughout the parameter set, making them active or inactive during iterations. This asymmetrical behavior can lead to a many redundant computations, if not exploited. Many specialized graph processing systems and APIs exist that run iterative algorithms efficiently exploiting this asymmetry. However, their functionality is sometimes vaguely defined and due to their different programming models and terminology used, it is often challenging to derive equivalence between them. We describe an optimization framework for iterative graph processing, which utilizes dataset dependencies. We explain several optimization techniques that exploit asymmetrical behavior of graph algorithms. We formally specify the conditions under which, an algorithm can use a certain technique. We also design template execution plans, using a canonical set of dataflow operators and we evaluate them using real-world datasets and applications. Our experiments show that optimized plans can significantly reduce execution time, often by an order of magnitude. Based on our experiments, we identify a trade-off that can be easily captured and could serve as the basis for automatic optimization of large-scale graph-processing applications.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)