OverSketch: Approximate Matrix Multiplication for the Cloud release_5ygtebaba5farpb37xxmqvlu5i

by Vipul Gupta and Shusen Wang and Thomas Courtade and Kannan Ramchandran

Released as a article .

2019  

Abstract

We propose OverSketch, an approximate algorithm for distributed matrix multiplication in serverless computing. OverSketch leverages ideas from matrix sketching and high-performance computing to enable cost-efficient multiplication that is resilient to faults and straggling nodes pervasive in low-cost serverless architectures. We establish statistical guarantees on the accuracy of OverSketch and empirically validate our results by solving a large-scale linear program using interior-point methods and demonstrate a 34% reduction in compute time on AWS Lambda.
In text/plain format

Archived Files and Locations

application/pdf  2.4 MB
file_7k323ro2fvh4xiccbibauumulq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2019-02-22
Version   v2
Language   en ?
arXiv  1811.02653v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 2ba95190-a297-4a42-a6e7-44f7ba947a69
API URL: JSON