Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Viveck R. Cadambe"'
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0038010d09e028b42ff7e6381d15d99b
https://doi.org/10.1109/isit50566.2022.9834493
https://doi.org/10.1109/isit50566.2022.9834493
Addressing Unreliability in Emerging Devices and Non-von Neumann Architectures Using Coded Computing
Autor:
Tze Meng Low, Sanghamitra Dutta, Pulkit Grover, Viveck R. Cadambe, Haewon Jeong, Yaoqing Yang
Publikováno v:
Proceedings of the IEEE. 108:1219-1234
Computing systems are evolving rapidly. At the device level, emerging devices are beginning to compete with traditional CMOS systems. At the architecture level, novel architectures are successfully avoiding the communication bottleneck that is a cent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccdeafd2195cb535b9aee668971e7fb0
https://doi.org/10.1109/jproc.2020.2986362
https://doi.org/10.1109/jproc.2020.2986362
Autor:
Farzin Haddadpour, Viveck R. Cadambe, Pulkit Grover, Mohammad Fahim, Haewon Jeong, Sanghamitra Dutta
Publikováno v:
Allerton
We provide novel coded computation strategies for distributed matrix-matrix products that outperform the recent "Polynomial code" constructions in recovery threshold, i.e., the required number of successful workers. When $m$-th fraction of each matri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1378add45b70f1b37192b9c87bea696
https://doi.org/10.1109/tit.2019.2929328
https://doi.org/10.1109/tit.2019.2929328
Publikováno v:
IEEE Transactions on Information Theory. 65:6171-6193
Faced with saturation of Moore's law and increasing dimension of data, system designers have increasingly resorted to parallel and distributed computing. However, distributed computing is often bottle necked by a small fraction of slow processors cal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6933b133dc693faad108a733d92f15f
https://doi.org/10.1109/tit.2019.2927558
https://doi.org/10.1109/tit.2019.2927558
Publikováno v:
NCA
In this work, we propose an erasure coding-based protocol that implements a key-value store with atomicity and near-optimal storage cost. Our protocol supports concurrent read and write operations while tolerating asynchronous communication and crash
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bd7300c500e16ac32c9f360ec8a6ba6
https://doi.org/10.1109/nca51143.2020.9306729
https://doi.org/10.1109/nca51143.2020.9306729
In applications of distributed storage systems to modern key-value stores, the stored data is highly dynamic due to frequent updates. The multi-version coding problem was formulated to study the cost of storing dynamic data in distributed storage sys
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0fafcb734fef13c466cd0be644c1a4bc
http://hdl.handle.net/11588/848550
http://hdl.handle.net/11588/848550
Autor:
Viveck R. Cadambe, Vipul Gupta, Tze Meng Low, Yaoqing Yang, Pulkit Grover, Kannan Ramchandran, Christian Engelmann, Haewon Jeong
Publikováno v:
Euro-Par 2020: Parallel Processing ISBN: 9783030576745
Euro-Par
Euro-Par
In this paper, we propose a novel fault-tolerant parallel matrix multiplication algorithm called 3D Coded SUMMA that achieves higher failure-tolerance than replication-based schemes for the same amount of redundancy. This work bridges the gap between
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd095b1803052105627e076154ca0964
https://doi.org/10.1007/978-3-030-57675-2_25
https://doi.org/10.1007/978-3-030-57675-2_25
Autor:
Viveck R. Cadambe, Zhiying Wang
Publikováno v:
IEEE Transactions on Information Theory. 64:4540-4561
In applications of distributed storage systems to distributed computing and implementation of key-value stores, the following property, usually referred to as consistency in distributed computing, is an important requirement: as the data stored chang
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f4c482d37f2d9bb761287f384054ef6
https://doi.org/10.1109/tit.2017.2725273
https://doi.org/10.1109/tit.2017.2725273
Autor:
A. Salman Avestimehr, Stark C. Draper, Pulkit Grover, Sennur Ulukus, Viveck R. Cadambe, Osvaldo Simeone
Publikováno v:
IEEE Journal on Selected Areas in Information Theory. 2:813-813
Computing is the next frontier for information theory. Intellectually, the goal of coded computing has been of interest from the days of von Neumann and Shannon. von Neumann examined this issue in his 1956 paper “Probabilistic Logics and the Synthe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6f41496d3203150ac668949018f6e71
https://doi.org/10.1109/jsait.2021.3108024
https://doi.org/10.1109/jsait.2021.3108024
Autor:
Mohammad Fahim, Viveck R. Cadambe
Publikováno v:
Allerton
In this paper, we propose a distributed coding scheme that allows for lower computation cost per computing node than the standard Lagrange Coded Computing scheme. The proposed coding scheme is useful for cases where the elements of the input data set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df4f715ff448373681374551660742e4
https://doi.org/10.1109/allerton.2019.8919966
https://doi.org/10.1109/allerton.2019.8919966