Zobrazeno 1 - 10
of 454
pro vyhledávání: '"Matei Ripeanu"'
Publikováno v:
Proceedings of the 6th International Workshop on Edge Systems, Analytics and Networking.
Autor:
Hazem A. Abdelhafez, Hassan Halawa, Amr Almoallim, Amirhossein Ahmadi, Karthik Pattabiraman, Matei Ripeanu
Publikováno v:
2022 IEEE/ACM 7th Symposium on Edge Computing (SEC).
Publikováno v:
ACM Transactions on Parallel Computing. 8:1-45
Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scena
Autor:
Scott Sallinen, Matei Ripeanu
Publikováno v:
2021 IEEE/ACM 11th Workshop on Irregular Applications: Architectures and Algorithms (IA3).
Autor:
Hassan H. Halawa, Matei Ripeanu
Publikováno v:
GRADES-NDA@SIGMOD
Most of today's graph analytics systems model static graphs and do not support business use cases that require the ability to: (i) query the dynamic graph data for a time-evolving system, (ii) carry out investigations on its historical evolution, and
Publikováno v:
EdgeSys@EuroSys
While applications deployed at the edge often rely on performance stability (or, at a minimum, on a predictable level of performance), variability at the edge remains a real problem [4]. This study uncovers a surprising source of variability: intrins
Autor:
Jan Hidders, Mohamed Ragab, Angela Bonifati, Hannes Voigt, Maciej Besta, Alexandru Iosup, Ana Lucia Varbanescu, Petra Selmer, Tim Hegeman, Joshua Shinavier, Katja Hose, Stefania Dumbrava, Vasiliki Kalavri, Matei Ripeanu, Gábor Szárnyas, Eiko Yoneki, Da Yan, Semih Salihoglu, Renzo Angles, Eric Peukert, Olaf Hartig, Christian Schulz, Marcelo Arenas, Riccardo Tommasini, Nikolay Yakovets, Alexandru Uta, Stefan Plantikow, Juan F. Sequeda, M. Tamer Özsu, Emanuele Della Valle, Peter Boncz, Khaled Ammar, Wim Martens, Hsiang-Yun Wu, Bernhard Haslhofer, Sherif Sakr, Adriana Iamnitchi, Khuzaima Daudjee, Walid G. Aref, Antonino Tumeo, Hugo Kapp
Publikováno v:
Communications of the ACM
Communications of the ACM, 2021, 64 (9), pp.62-71. ⟨10.1145/3434642⟩
Communications of the ACM, Association for Computing Machinery, 2021, 64 (9), pp.62-71. ⟨10.1145/3434642⟩
Communications of the ACM, 64 (9)
Communications of the ACM, 64(9), 62-71
Communications of the ACM, 64(9)
Communications of the ACM, 2021, 64 (9), pp.62-71. ⟨10.1145/3434642⟩
Communications of the ACM, Association for Computing Machinery, 2021, 64 (9), pp.62-71. ⟨10.1145/3434642⟩
Communications of the ACM, 64 (9)
Communications of the ACM, 64(9), 62-71
Communications of the ACM, 64(9)
Graphs are, by nature, "unifying abstractions" that can leverage interconnectedness to represent, explore, predict, and explain real- and digital-world phenomena. although real users and consumers of graph instances and graph workloads understand the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0583a1df0b7470a0eda73099680ac6bd
http://hdl.handle.net/11311/1203211
http://hdl.handle.net/11311/1203211
Publikováno v:
IEEE BigData
Modern shared-memory platforms embrace the Non-uniform Memory Access (NUMA) architecture - they have physically distributed, yet cache-coherent shared-memory. This paper explores the feasibility of a shared-memory graph processing engine for NUMA pla
Publikováno v:
IA3@SC
Subgraph search in a massive background graph, i.e., pattern matching in graphs, is a challenging problem, particularly in an interactive usage scenario where fast response time is important. Our approach, Prune.Juice [1], is based on two intuitions:
Publikováno v:
GRADES-NDA@SIGMOD
We present the design overview of a pattern matching engine for labeled graphs that supports interactive search: the user, based on feedback received from the search system, repeatedly revises her search template until s/he is satisfied with the resu