Zobrazeno 1 - 10
of 263
pro vyhledávání: '"Ümit V, Çatalyürek"'
Autor:
Xiaojing An, Priyanka Ghosh, Patrick Keppler, Sureyya Emre Kurt, Sriram Krishnamoorthy, Ponnuswamy Sadayappan, Aravind Sukumaran Rajam, Ümit V. Çatalyürek, Ananth Kalyanaraman
Publikováno v:
iScience, Vol 25, Iss 11, Pp 105273- (2022)
Summary: De novo genome assembly is a fundamental problem in computational molecular biology that aims to reconstruct an unknown genome sequence from a set of short DNA sequences (or reads) obtained from the genome. The relative ordering of the reads
Externí odkaz:
https://doaj.org/article/0651a4b847574ae3a77a993418f600bf
Publikováno v:
ACM Journal of Experimental Algorithmics. 27:1-26
Even distribution of irregular workload to processing units is crucial for efficient parallelization in many applications. In this work, we are concerned with a spatial partitioning called rectilinear partitioning (also known as generalized block dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::317bc91d06b5a7874408786c8167dbd4
https://doi.org/10.1145/3523750
https://doi.org/10.1145/3523750
Publikováno v:
2022 IEEE 29th International Conference on High Performance Computing, Data, and Analytics (HiPC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24151d19bd4cfdbd58a2018cd28811e1
https://doi.org/10.1109/hipc56025.2022.00030
https://doi.org/10.1109/hipc56025.2022.00030
Publikováno v:
Proceedings of the Platform for Advanced Scientific Computing Conference.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1152139422917a7558708050d02366cc
https://doi.org/10.1145/3539781.3539798
https://doi.org/10.1145/3539781.3539798
Publikováno v:
Proceedings of the 5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62681bbb7e224ea18e2f6895a069023f
https://doi.org/10.1145/3534540.3534694
https://doi.org/10.1145/3534540.3534694
Autor:
M. Yusuf Özkaya, Ümit V. Çatalyürek, Hasan Metin Aktulga, Abdullah Alperen, Afibuzzaman, Fazlay Rabbi
Publikováno v:
ICPP
Recently, several task-parallel programming models have emerged to address the high synchronization and load imbalance issues as well as data movement overheads in modern shared memory architectures. OpenMP, the most commonly used shared memory paral
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e25c40f01a20b5047a1d3b0e3f96b5f
https://doi.org/10.1145/3472456.3472476
https://doi.org/10.1145/3472456.3472476
Publikováno v:
IPDPS Workshops
Computing k-cores on graphs is an important graph mining target as it provides an efficient means of identifying a graph’s dense and cohesive regions. Computing k-cores on hypergraphs has seen recent interest, as many datasets naturally produce hyp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39e2ac922873c3ca4cd2df628e3d38bd
https://doi.org/10.1109/ipdpsw52791.2021.00158
https://doi.org/10.1109/ipdpsw52791.2021.00158
Autor:
Kasimir Gabert, Ümit V. Çatalyürek
Publikováno v:
IPDPS Workshops
Graph and sparse matrix systems are highly tuned, able to run complex graph analytics in fractions of seconds on billion-edge graphs. For both developers and researchers, the focus has been on computational kernels and not end-to-end runtime. Despite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0cc69c17bd85d78cd1b6e1b1ccfdae02
https://doi.org/10.1109/ipdpsw52791.2021.00050
https://doi.org/10.1109/ipdpsw52791.2021.00050
Autor:
Karen D. Devine, Ümit V. Çatalyürek, Mark A. Taylor, Mehmet Deveci, Sivasankaran Rajamanickam, Kevin Pedretti
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 30:2018-2032
We present a new method for reducing parallel applications’ communication time by mapping their MPI tasks to processors in a way that lowers the distance messages travel and the amount of congestion in the network. Assuming geometric proximity amon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaa852dbd9f9adbf27b9c9a2af2aa18b
https://doi.org/10.1109/tpds.2019.2900043
https://doi.org/10.1109/tpds.2019.2900043
Publikováno v:
CF
In today's data-driven world and heterogeneous computing environments, processing large-scale graphs in an architecture agnostic manner has become more crucial than ever before. In terms of graph analytics frameworks, on the one side, there has been
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91f170a3c341f9f5b98f424760498e77
https://doi.org/10.1145/3457388.3459987
https://doi.org/10.1145/3457388.3459987