Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Aditya Ramamoorthy"'
Autor:
Ruoyu Meng, Aditya Ramamoorthy
Publikováno v:
Entropy, Vol 26, Iss 11, p 896 (2024)
We consider a quantum and a classical version of a multi-party function computation problem with n players, where players 2,…,n need to communicate appropriate information to player 1 so that a “generalized” inner product function with an appro
Externí odkaz:
https://doaj.org/article/71417d3db16843acb4aa6cfc84c5f39a
Autor:
Li Tang, Aditya Ramamoorthy
Publikováno v:
ISIT
Polynomial based methods have recently been used in several works for mitigating the effect of stragglers (slow or failed nodes) in distributed matrix computations. For a system with $n$ worker nodes where $s$ can be stragglers, these approaches allo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6a0110f102a63393546a535f2a7f1b2
https://doi.org/10.1109/tit.2021.3137266
https://doi.org/10.1109/tit.2021.3137266
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
State-of-the-art machine learning models are routinely trained on large-scale distributed clusters. Crucially, such systems can be compromised when some of the computing devices exhibit abnormal (Byzantine) behavior and return arbitrary results to th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7412e017e68b13259b39b0221e7a93e7
https://doi.org/10.1109/isit50566.2022.9834813
https://doi.org/10.1109/isit50566.2022.9834813
An Integrated Method to Deal with Partial Stragglers and Sparse Matrices in Distributed Computations
Autor:
Anindya Bijoy Das, Aditya Ramamoorthy
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::951a9fa1cc51048ea24841cd3c9c2b21
https://doi.org/10.1109/isit50566.2022.9834346
https://doi.org/10.1109/isit50566.2022.9834346
Publikováno v:
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e09a362fbf0ac9e1e7aa13adb59424b
https://doi.org/10.1109/icassp43922.2022.9747220
https://doi.org/10.1109/icassp43922.2022.9747220
Publikováno v:
IEEE Signal Processing Magazine. 37:136-145
The current big data era routinely requires the processing of large-scale data on massive distributed computing clusters. In these applications, data sets are often so large that they cannot be housed in the memory and/or the disk of any one computer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf063c32baa23a06015bb91fa0591567
https://doi.org/10.1109/msp.2020.2974149
https://doi.org/10.1109/msp.2020.2974149
Autor:
Anindya Bijoy Das, Aditya Ramamoorthy
Publikováno v:
ISIT
Distributed matrix computations over large clusters can suffer from the problem of slow or failed worker nodes (called stragglers) which can dominate the overall job execution time. Coded computation utilizes concepts from erasure coding to mitigate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb825931798ebdc22d0d60508d74bcdf
https://doi.org/10.1109/isit45174.2021.9518059
https://doi.org/10.1109/isit45174.2021.9518059
Publikováno v:
IEEE Communications Letters. 23:8-11
Distributed matrix multiplication is widely used in several scientific domains. It is well recognized that computation times on distributed clusters are often dominated by the slowest workers (called stragglers). Recent work has demonstrated that str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6f9adfe881b294421adfe70b46fbcef
https://doi.org/10.1109/lcomm.2018.2880213
https://doi.org/10.1109/lcomm.2018.2880213
In this work we study the problem of Subspace Tracking with missing data (ST-miss) and outliers (Robust ST-miss). We propose a novel algorithm, and provide a guarantee for both these problems. Unlike past work on this topic, the current work does not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::288d31d33371c16eb994f3d2e622bf02
http://arxiv.org/abs/2002.12873
http://arxiv.org/abs/2002.12873
Autor:
Li Tang, Aditya Ramamoorthy
Publikováno v:
IEEE Transactions on Information Theory. 64:3099-3120
Coded caching is a technique that generalizes conventional caching and promises significant reductions in traffic over caching networks. However, the basic coded caching scheme requires that each file hosted in the server be partitioned into a large
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f6372d2af4d00423aad249a7a0e18dd
https://doi.org/10.1109/tit.2018.2800059
https://doi.org/10.1109/tit.2018.2800059