Page 157 |
Save page Remove page | Previous | 157 of 243 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
for any s 2 {1, ..., min{N,K}}, 2 [0, 1], where ` 2 {1, ..., s} is the minimum value such that6
s(s − 1) − `(` − 1)
2 + s (N − ` + 1)`. (11.12)
Remark 11.5. The above theorem improves the state of the art in various scenarios. For example,
when N is sufficiently large (i.e., N K(K+1)
2 ), the above theorem gives tight converse bound
for KM
N 1, as shown in (11.23). The above matching converse can not be proved directly using
converse bounds provided in [6–8, 161, 169, 170] (e.g., for K = 4, N = 10, and M = 1, none of these
bounds give R 3).
Remark 11.6. Although Theorem 11.2 gives infinitely many linear converse bounds on R , the region
of the memory-rate pair (M,R ) characterized by Theorem 11.2 has a simple shape with finite
corner points. Specifically, by applying the arguments used in the proof of Theorem 11.1, one can
show that the exact bounded region given by Theorem 11.2 is bounded by the lower convex envelop
of points {(N−`+1
s , s−1
2 + `(`−1)
2s ) | s 2 {1, ..., J}, ` 2 {1, ..., s}} [ {(0, J)}, where J = min{N,K}.
For the case of large N, we can exactly characterize the values of R and R ave for K 5. We
formally state this result in the following theorem:
Theorem 11.3. For a caching system with K users, a database of N files, and a local cache size
of M files at each user, we have
R = R
ave = Ru(N,K, r) (11.13)
for large N (i.e., N ! +1) when K 5, where Ru(N,K, r) is defined in Definition 11.1.7
Remark 11.7. As discussed in [144], the special case of large N is important to handle asynchronous
demands. More specifically, [144] showed that asynchronous demands can be handled by splitting
each file into many subfiles, and delivering concurrent subfile requests using the optimum caching
schemes. In this case, we essentially need to solve the caching problem when the number of files
(i.e., the subfiles) is large, but the fraction of files that can be stored at each user is fixed. In this
chapter, we completely characterize this tradeoff for systems with up to 5 users, for both peak rate
and average rate, while in prior works, this tradeoff has only been exactly characterized in two
instances: the single-user case [140] and, more recently, the two-user case [170].
Remark 11.8. Although Theorem 11.3 only consider systems with up to 5 users, the converse bounds
used in its proof also tightly characterize the minimum communication rate in many cases even for
systems with more than 5 users. For both peak rate and average rate, we can show that more than
6Such ` always exists, because when ` = s, (11.12) can be written as s (N − s + 1)s, which always holds true.
7Rigorously, we show that the maximum possible gap between R , R
ave, and Ru(N,K, r) over M 2 [0,N] approaches
0 as N goes to infinity.
142
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 157 |
| Full text | for any s 2 {1, ..., min{N,K}}, 2 [0, 1], where ` 2 {1, ..., s} is the minimum value such that6 s(s − 1) − `(` − 1) 2 + s (N − ` + 1)`. (11.12) Remark 11.5. The above theorem improves the state of the art in various scenarios. For example, when N is sufficiently large (i.e., N K(K+1) 2 ), the above theorem gives tight converse bound for KM N 1, as shown in (11.23). The above matching converse can not be proved directly using converse bounds provided in [6–8, 161, 169, 170] (e.g., for K = 4, N = 10, and M = 1, none of these bounds give R 3). Remark 11.6. Although Theorem 11.2 gives infinitely many linear converse bounds on R , the region of the memory-rate pair (M,R ) characterized by Theorem 11.2 has a simple shape with finite corner points. Specifically, by applying the arguments used in the proof of Theorem 11.1, one can show that the exact bounded region given by Theorem 11.2 is bounded by the lower convex envelop of points {(N−`+1 s , s−1 2 + `(`−1) 2s ) | s 2 {1, ..., J}, ` 2 {1, ..., s}} [ {(0, J)}, where J = min{N,K}. For the case of large N, we can exactly characterize the values of R and R ave for K 5. We formally state this result in the following theorem: Theorem 11.3. For a caching system with K users, a database of N files, and a local cache size of M files at each user, we have R = R ave = Ru(N,K, r) (11.13) for large N (i.e., N ! +1) when K 5, where Ru(N,K, r) is defined in Definition 11.1.7 Remark 11.7. As discussed in [144], the special case of large N is important to handle asynchronous demands. More specifically, [144] showed that asynchronous demands can be handled by splitting each file into many subfiles, and delivering concurrent subfile requests using the optimum caching schemes. In this case, we essentially need to solve the caching problem when the number of files (i.e., the subfiles) is large, but the fraction of files that can be stored at each user is fixed. In this chapter, we completely characterize this tradeoff for systems with up to 5 users, for both peak rate and average rate, while in prior works, this tradeoff has only been exactly characterized in two instances: the single-user case [140] and, more recently, the two-user case [170]. Remark 11.8. Although Theorem 11.3 only consider systems with up to 5 users, the converse bounds used in its proof also tightly characterize the minimum communication rate in many cases even for systems with more than 5 users. For both peak rate and average rate, we can show that more than 6Such ` always exists, because when ` = s, (11.12) can be written as s (N − s + 1)s, which always holds true. 7Rigorously, we show that the maximum possible gap between R , R ave, and Ru(N,K, r) over M 2 [0,N] approaches 0 as N goes to infinity. 142 |
