12 citations · 14 across the 6 of their papers we have counts for
5 papers · 1 filter
Hierarchical Coded Matrix Multiplication
Shahrzad Kiani, Nuwan Ferdinand, Stark C. Draper
In distributed computing systems slow working nodes, known as stragglers, can greatly extend finishing times. Coded computing is a technique that enables straggler-resistant comput…
Cuboid Partitioning for Hierarchical Coded Matrix Multiplication
Shahrzad Kiani, Nuwan Ferdinand, Stark C. Draper
Coded matrix multiplication is a technique to enable straggler-resistant multiplication of large matrices in distributed computing systems. In this paper, we first present a concep…
Hierarchical Coded Matrix Multiplication
Shahrzad Kiani, Nuwan Ferdinand, Stark C. Draper
Slow working nodes, known as stragglers, can greatly reduce the speed of distributed computation. Coded matrix multiplication is a recently introduced technique that enables stragg…
Exploitation of Stragglers in Coded Computation
Shahrzad Kiani, Nuwan Ferdinand, Stark C. Draper
In cloud computing systems slow processing nodes, often referred to as "stragglers", can significantly extend the computation time. Recent results have shown that error correction…
Iterative method for simultaneous sparse approximation
Sahar Sadrizadeh, Shahrzad Kiani, Mahdi Boloursaz +1
This paper studies the problem of Simultaneous Sparse Approximation (SSA). This problem arises in many applications which work with multiple signals maintaining some degree of depe…