Titel

Merkliste
1 Ergebnisse

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-..:

, In: Proceedings of the 30th International Symposium on High-Performance Parallel and Distributed Computing,

sao, piyush ; lu, Hao ; Kannan, Ramakrishnan... - p. 121-131 , 2021

Link: https://dl.acm.org/doi/10.1145/3431379.3460651

RT 
T1 <cTitle>Proceedings of the 30th International Symposium on High-Performance Parallel and Distributed Computing</cTitle>: T1 <Title>Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters</Title>

UL https://suche.suub.uni-bremen.de/peid=acm-3460651&Exemplar=1&LAN=DE
				
A1 sao, piyush
A1 lu, Hao
A1 Kannan, Ramakrishnan
A1 Thakkar, Vijay
A1 Vuduc, Richard
A1 Potok, Thomas
PB ACM
YR 2021
K1 all-pair shortest path
K1 distributed algorithm
K1 floyd-warshall algorithm
K1 gpu computing
K1 semi-ring algebra
K1 Theory of computation
K1 Design and analysis of algorithms
K1 Graph algorithms analysis
K1 Shortest paths
K1 Computing methodologies
K1 Computer graphics
K1 Graphics systems and interfaces
K1 Graphics processors
K1 Software and its engineering
K1 Software organization and properties
K1 Software system structures
K1 Software system models
K1 Massively parallel systems
K1 Modeling and simulation
K1 Simulation types and techniques
K1 Massively parallel and high-performance simulations
SP 121
OP 131
LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3431379.3460651
DO https://dl.acm.org/doi/10.1145/3431379.3460651
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)