Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Y. N. Srikant"'
Autor:
Shalini Jain, Ramakrishna Upadrasta, S. VenkataKeerthy, Rohit Aggarwal, Y. N. Srikant, Maunendra Sankar Desarkar
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 17:1-27
We propose IR2Vec, a Concise and Scalable encoding infrastructure to represent programs as a distributed embedding in continuous space. This distributed embedding is obtained by combining representation learning methods with flow information to captu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::886e673a7e39c3adb928cf24bf8ca83a
https://doi.org/10.1145/3418463
https://doi.org/10.1145/3418463
Publikováno v:
Distributed Graph Analytics ISBN: 9783030418854
This chapter provides some insights into the issues in programming parallel algorithms. Parallelism, atomicity, push and pull types of computation, algorithms driven by topology or data, vertex based, edge based and worklist based computation, are so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2532d99d2cdab551073887ed4732f402
https://doi.org/10.1007/978-3-030-41886-1_3
https://doi.org/10.1007/978-3-030-41886-1_3
Publikováno v:
Distributed Graph Analytics ISBN: 9783030418854
This chapter provides an overview of GPU architectures and CUDA programming. The performance of the same graph algorithms on multi-core CPU and GPU are usually very different. Intricacies of thread scheduling, barrier synchronization, warp based exec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bee3443555a28b0a01813f2c0952d156
https://doi.org/10.1007/978-3-030-41886-1_5
https://doi.org/10.1007/978-3-030-41886-1_5
Publikováno v:
Distributed Graph Analytics ISBN: 9783030418854
This chapter discusses a summary of experimental results of running elementary graph algorithm implementations on multi-core CPU, GPU, and distributed systems for different types of graph inputs. A description of the future directions for research in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::273b1c338aba00e54d7aa0101491ba59
https://doi.org/10.1007/978-3-030-41886-1_8
https://doi.org/10.1007/978-3-030-41886-1_8
Publikováno v:
Distributed Graph Analytics ISBN: 9783030418854
Frameworks take away the drudgery of routine tasks in programming graph analytic applications. This chapter describes in some detail, the different models of execution that are used in graph analytics, such as BSP, Map-Reduce, asynchronous execution,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2493cdd82f58f234c0406dc18a6190a2
https://doi.org/10.1007/978-3-030-41886-1_4
https://doi.org/10.1007/978-3-030-41886-1_4
Publikováno v:
Distributed Graph Analytics ISBN: 9783030418854
This chapter discusses the importance of graph analytics. It describes important concepts in elementary graph theory and different graph representations, programming frameworks for parallelization, and various challenges posed by graph analytics algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec80c581edbe949a2432f78b02f26163
https://doi.org/10.1007/978-3-030-41886-1_1
https://doi.org/10.1007/978-3-030-41886-1_1
Publikováno v:
Distributed Graph Analytics ISBN: 9783030418854
This chapter provides a discussion of various sequential graph algorithms and issues in their implementations. After describing fundamental algorithms like traversals, shortest paths, etc., more specialized algorithms such as betweenness centrality,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b339d1496ef33cdd8fff4ddd6936cac
https://doi.org/10.1007/978-3-030-41886-1_2
https://doi.org/10.1007/978-3-030-41886-1_2
Publikováno v:
Distributed Graph Analytics ISBN: 9783030418854
The domain-specific language Falcon is presented in this chapter. The data types and statements of Falcon that support easy programming of graph analytics applications are described. To drive home the point that Falcon programs can be very efficient,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::337aea3e591e65ee4567e1397473dc8c
https://doi.org/10.1007/978-3-030-41886-1_7
https://doi.org/10.1007/978-3-030-41886-1_7
Publikováno v:
Distributed Graph Analytics ISBN: 9783030418854
Dynamic graph algorithms compute the graph properties from the previous set of values. Typical operations in dynamic graph algorithms are insertion and deletion of edges and vertices, and the query for property values relevant to the algorithm. The e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05c4cf0fd1d4ff8f38b23286a7fe708b
https://doi.org/10.1007/978-3-030-41886-1_6
https://doi.org/10.1007/978-3-030-41886-1_6