Page 39 |
Save page Remove page | Previous | 39 of 243 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
Remark 3.2. Similar to distributed matrix multiplication, we can also extend this computation
strategy to the scenario where the elements of input vectors are real or complex numbers, by
quantizing all input values, embedding them into a finite field, and then directly applying our
distributed convolution algorithm.
3.3 Proof of Theorem 3.2
Now we characterize the optimum recovery threshold Kconv within a factor of 2, as stated in
Theorem 3.2. The upper bound K conv Kconv-poly directly follows from Theorem 4, hence we focus
on proving the lower bound of K conv. We first prove the following inequality.
K
conv max{m, n}. (3.10)
Let a be any fixed non-zero vector, and b be sampled from Fsn
q uniformly at random. We can be
easily show that the operation of convolving with a is invertible, and thus the entropy of c , a b
equals that of b, which is sn log2 q. Note that each worker i returns ˜ai ˜bi, whose entropy is at
most H(˜ai) +H(˜b
i) = s log2 q. Using a cut-set bound around the master, we can show that at least
n results from the workers need to be collected, and thus we have K n.
Similarly we have K m, hence K max{m, n}. Thus we can show that the gap between the
upper and lower bounds is no larger than 2: K max{m, n} m+n
2 > m+n−1
2 = Kconv-poly
2 .
3.4 Proof of Theorem 3.3
As we have shown in Section 3.2, the recovery threshold stated in Theorem 3.3 is achievable using a
polynomial coded computing design, which proves an upper bound of K
conv-linear. Hence, in this
section we focus on proving the matching converse.
Specifically, we aim to prove that given any problem parameters m, n, and N, for any computation
strategy, if the encoding functions are linear, then its recovery threshold is at least m + n − 1. We
prove it by contradiction.
Assume the opposite, then the master can recover c using results from a subset of at most m+n−2
workers. We denote this subset by K. Obviously, we can find a partition of K into two subsets,
denoted by Ka and Kb, such that |Ka| m− 1 and |Kb| n − 1. Note that the encoding functions
of workers in Ka collaboratively and linearly maps Fms to F(m−1)s, which has a non-zero kernel.
Hence, we can find a non-zero input vector a such that all workers in Ka returns 0. Similarly, we
24
Object Description
| Title | Coded computing: a transformative framework for resilient, secure, private, and communication efficient large scale distributed computing |
| Author | Yu, Qian |
| Author email | qyu880@usc.edu;qianyu0929@gmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Electrical Engineering |
| School | Viterbi School of Engineering |
| Date defended/completed | 2020-03-24 |
| Date submitted | 2020-08-04 |
| Date approved | 2020-08-05 |
| Restricted until | 2020-08-05 |
| Date published | 2020-08-05 |
| Advisor (committee chair) | Avestimehr, Salman |
| Advisor (committee member) |
Luo, HaiPeng Ortega, Antonio Soltanolkotabi, Mahdi |
| Abstract | Modern computing applications often require handling massive amounts of data in a distributed setting, where significant issues on resiliency, security, or privacy could arise. This dissertation presents new computing designs and optimality proofs, that address these issues through coding and information-theoretic approaches. ❧ The first part of this thesis focuses on a standard setup, where the computation is carried out using a set of worker nodes, each can store and process a fraction of the input dataset. The goal is to find computation schemes for providing the optimal resiliency against stragglers given the computation task, the number of workers, and the functions computed by the workers. The resiliency is measured in terms of the recovery threshold, defined as the minimum number of workers to wait for in order to compute the final result. We propose optimal solutions for broad classes of computation tasks, from basic building blocks such as matrix multiplication (entangled polynomial codes), Fourier transform (coded FFT), and convolution (polynomial code), to general functions such as multivariate polynomial evaluation (Lagrange coded computing). We develop optimal computing strategies by introducing a general coding framework called “polynomial coded computing”, to exploit the algebraic structure of the computation task and create computation redundancy in a novel coded form across workers. Polynomial coded computing allows for order-wise improvements over the state of the arts and significantly generalizes classical coding-theoretic results to go beyond linear computations. The encoding and decoding process of polynomial coded computing designs can be mapped to polynomial evaluation and interpolation, which can be computed efficiently. ❧ Then we show that polynomial coded computing can be extended to provide unified frameworks that also enable security and privacy in the computation. We present the optimal designs for three important problems: distributed matrix multiplication, multivariate polynomial evaluation, and gradient-type computation. We prove their optimality by developing information-theoretic and linear-algebraic converse bounding techniques. ❧ Finally, we consider the problem of coding for communication reduction. In the context of distributed computation, we focus on a MapReduce-type framework, where the workers need to shuffle their intermediate results to finish the computation. We aim to understand how to optimally exploit extra computing power to reduce communication, i.e., to establish a fundamental tradeoff between computation and communication. We prove a lower bound on the needed communication load for general allocation of the task assignments, by introducing a novel information-theoretic converse bounding approach. The presented lower bound exactly matches the inverse-proportional coding gain achieved by coded distributed computing schemes, completely characterizing the optimal computation-communication tradeoff. The proposed converse bounding approach strictly improves conventional cut-set bounds and can be widely applied to prove exact optimally results for more general settings, as well as more classical communication problems. We also investigate a problem called coded caching, where a single server is connected to multiple users in a cache network through a shared bottleneck link. Each user has an isolated memory that can be used to prefetch content. Then the server needs to deliver users’ demands efficiently in a following delivery phase. We propose caching and delivery designs that improve the state-of-the-art schemes under both centralized and decentralized settings, for both peak and average communication rates. Moreover, by developing information-theoretic bounds, we prove the proposed designs are exactly optimal among all schemes that use uncoded prefetching, and optimal within a factor of 2.00884 among schemes with coded prefetching. |
| Keyword | coding theory; information theory; distributed computing; security; privacy; matrix multiplication; caching |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m |
| Contributing entity | University of Southern California |
| Rights | Yu, Qian |
| Physical access | The author retains rights to his/her dissertation, thesis or other graduate work according to U.S. copyright law. Electronic access is being provided by the USC Libraries in agreement with the author, as the original true and official version of the work, but does not grant the reader permission to use the work if the desired use is covered by copyright. It is the author, as rights holder, who must provide use permission if such use is covered by copyright. The original signature page accompanying the original submission of the work to the USC Libraries is retained by the USC Libraries and a copy of it may be obtained by authorized requesters contacting the repository e-mail address given. |
| Repository name | University of Southern California Digital Library |
| Repository address | USC Digital Library, University of Southern California, University Park Campus MC 7002, 106 University Village, Los Angeles, California 90089-7002, USA |
| Repository email | cisadmin@lib.usc.edu |
| Filename | etd-YuQian-8883.pdf |
| Archival file | Volume13/etd-YuQian-8883.pdf |
Description
| Title | Page 39 |
| Full text | Remark 3.2. Similar to distributed matrix multiplication, we can also extend this computation strategy to the scenario where the elements of input vectors are real or complex numbers, by quantizing all input values, embedding them into a finite field, and then directly applying our distributed convolution algorithm. 3.3 Proof of Theorem 3.2 Now we characterize the optimum recovery threshold Kconv within a factor of 2, as stated in Theorem 3.2. The upper bound K conv Kconv-poly directly follows from Theorem 4, hence we focus on proving the lower bound of K conv. We first prove the following inequality. K conv max{m, n}. (3.10) Let a be any fixed non-zero vector, and b be sampled from Fsn q uniformly at random. We can be easily show that the operation of convolving with a is invertible, and thus the entropy of c , a b equals that of b, which is sn log2 q. Note that each worker i returns ˜ai ˜bi, whose entropy is at most H(˜ai) +H(˜b i) = s log2 q. Using a cut-set bound around the master, we can show that at least n results from the workers need to be collected, and thus we have K n. Similarly we have K m, hence K max{m, n}. Thus we can show that the gap between the upper and lower bounds is no larger than 2: K max{m, n} m+n 2 > m+n−1 2 = Kconv-poly 2 . 3.4 Proof of Theorem 3.3 As we have shown in Section 3.2, the recovery threshold stated in Theorem 3.3 is achievable using a polynomial coded computing design, which proves an upper bound of K conv-linear. Hence, in this section we focus on proving the matching converse. Specifically, we aim to prove that given any problem parameters m, n, and N, for any computation strategy, if the encoding functions are linear, then its recovery threshold is at least m + n − 1. We prove it by contradiction. Assume the opposite, then the master can recover c using results from a subset of at most m+n−2 workers. We denote this subset by K. Obviously, we can find a partition of K into two subsets, denoted by Ka and Kb, such that |Ka| m− 1 and |Kb| n − 1. Note that the encoding functions of workers in Ka collaboratively and linearly maps Fms to F(m−1)s, which has a non-zero kernel. Hence, we can find a non-zero input vector a such that all workers in Ka returns 0. Similarly, we 24 |
