483 citations · 3k across the 177 of their papers we have counts for
5 papers · 1 filter
Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations
Tobias Wicky, Edgar Solomonik, Torsten Hoefler
We present a new parallel algorithm for solving triangular systems with multiple right hand sides (TRSM). TRSM is used extensively in numerical linear algebra computations, both to…
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
Edgar Solomonik, Maciej Besta, Flavio Vella +1
Betweenness centrality (BC) is a crucial graph problem that measures the significance of a vertex by the number of shortest paths leading through it. We propose Maximal Frontier Be…
AllConcur: Leaderless Concurrent Atomic Broadcast (Extended Version)
Marius Poke, Torsten Hoefler, Colin W. Glass
Many distributed systems require coordination between the components involved. With the steady growth of such systems, the probability of failures increases, which necessitates sca…
SDNsec: Forwarding Accountability for the SDN Data Plane
Takayuki Sasaki, Christos Pappas, Taeho Lee +2
SDN promises to make networks more flexible, programmable, and easier to manage. Inherent security problems in SDN today, however, pose a threat to the promised benefits. First, th…
A communication-avoiding parallel algorithm for the symmetric eigenvalue problem
Edgar Solomonik, Grey Ballard, James Demmel +1
Many large-scale scientific computations require eigenvalue solvers in a scaling regime where efficiency is limited by data movement. We introduce a parallel algorithm for computin…