Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Devine, Karen D"'
Autor:
Çatalyürek, Ümit V., Devine, Karen D., Faraj, Marcelo Fonseca, Gottesbüren, Lars, Heuer, Tobias, Meyerhenke, Henning, Sanders, Peter, Schlag, Sebastian, Schulz, Christian, Seemaier, Daniel, Wagner, Dorothea
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical algorithms for balanced (hyper)graph partitioning together with futur
Externí odkaz:
http://arxiv.org/abs/2205.13202
Graph coloring is often used in parallelizing scientific computations that run in distributed and multi-GPU environments; it identifies sets of independent data that can be updated in parallel. Many algorithms exist for graph coloring on a single GPU
Externí odkaz:
http://arxiv.org/abs/2107.00075
Autor:
Deveci, Mehmet, Devine, Karen D., Pedretti, Kevin, Taylor, Mark A., Rajamanickam, Sivasankaran, Catalyurek, Umit V.
We present a new method for mapping applications' MPI tasks to cores of a parallel computer such that applications' communication time is reduced. We address the case of sparse node allocation, where the nodes assigned to a job are not necessarily lo
Externí odkaz:
http://arxiv.org/abs/1804.09798
Publikováno v:
In Parallel Computing May 2022 110
Autor:
Plimpton, Steven J., Devine, Karen D.
Publikováno v:
In Parallel Computing 2011 37(9):610-632
Autor:
Acer, Seher, Azad, Ariful, Boman, Erik G, Buluç, Aydın, Devine, Karen D, Ferdous, SM, Gawande, Nitin, Ghosh, Sayan, Halappanavar, Mahantesh, Kalyanaraman, Ananth, Khan, Arif, Minutoli, Marco, Pothen, Alex, Rajamanickam, Sivasankaran, Selvitopi, Oguz, Tallent, Nathan R, Tumeo, Antonino
Publikováno v:
The International Journal of High Performance Computing Applications, vol 35, iss 6
Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::ae4eb831a886d24c16a2af20def74b2e
https://escholarship.org/uc/item/00c5m1sg
https://escholarship.org/uc/item/00c5m1sg
Autor:
Catalyurek, Umit V., Boman, Erik G., Devine, Karen D., Bozdağ, Doruk, Heaphy, Robert T., Riesen, Lee Ann
Publikováno v:
In Journal of Parallel and Distributed Computing 2009 69(8):711-724
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Computer Methods in Applied Mechanics and Engineering 2002 191(11):1097-1112
Autor:
Salinger, Andrew G. *, Shadid, John N., A. Hutchinson, Scott, Hennigan, Gary L., Devine, Karen D., Moffat, Harry K.
Publikováno v:
In Journal of Crystal Growth 1999 203(4):516-533