Page 237 
Save page Remove page  Previous  237 of 243  Next 

small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)

This page
All

G.7 Proof of Theorem 11.1 for average rate Here we prove Theorem 11.1 for the average rate (i.e. inequalities (11.8) and (11.10)). The upper bounds of R ave in these inequalities can be achieved using the caching scheme provided in [11], hence we only need to prove their lower bounds. To do so, we define the following terminology: We divide the set of all demands, denoted by D, into smaller subsets, and refer them to as types. We use the same definition in [11], which are stated as follows: Given an arbitrary demand d, we define its statistics, denoted by s(d), as a sorted array of length N, such that si(d) equals the number of users that request the ith most requested file. We denote the set of all possible statistics by S. Grouping by the same statistics, the set of all demands D can be broken into many subsets. For any statistics s 2 S, we define type Ds as the set of queries with statistics s. Note that for each demand d, the value Ne(d) only depends on its statistics s(d), and thus the value is identical across all demands in Ds. For convenience, we denote that value by Ne(s). Given a prefetching scheme and a type Ds, we say a rate R is achievable for type Ds if we can find a function R(d) that is achievable for any demand d in Ds, satisfying R = Ed[R(d)], where d is uniformly random in Ds. Hence, to characterize R ave, it is sufficient to lower bound the achievable rates for each type individually, and show that for each type, the caching scheme provided in [11] is within the given constant factors optimal for large F and small . We first lower bound any achievable rate for each type as follows : Within a type Ds, we can find a demand d, such that users in {1, ...,Ne(s)} requests different files. We can easily generalize Lemma 11.2 to this demand, and any achievable rate of this demand, denoted by Rd, is lower bounded by the following inequality: Rd 1 F 0 @ NXe(s) k=1 H(Wdk Z{1,...,k},W{d1,...,dk−1}) 1 A − Ne(s)( 1 F + ). (G.72) Applying the same bounding technique to all demands in type Ds. We can prove that any rate that is achievable for Ds, denoted by Rs, is bounded by the follows: Rs 1 F 0 @ NXe(s) k=1 H (WkZ{1,...,k},W{1,...,k−1}) 1 A − Ne(s)( 1 F + ), (G.73) where function H (·) is defined in the proof of Theorem 11.2. 222
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  20200324 
Date submitted  20200804 
Date approved  20200805 
Restricted until  20200805 
Date published  20200805 
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 informationtheoretic 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 orderwise improvements over the state of the arts and significantly generalizes classical codingtheoretic 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 gradienttype computation. We prove their optimality by developing informationtheoretic and linearalgebraic converse bounding techniques. ❧ Finally, we consider the problem of coding for communication reduction. In the context of distributed computation, we focus on a MapReducetype 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 informationtheoretic converse bounding approach. The presented lower bound exactly matches the inverseproportional coding gain achieved by coded distributed computing schemes, completely characterizing the optimal computationcommunication tradeoff. The proposed converse bounding approach strictly improves conventional cutset 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 stateoftheart schemes under both centralized and decentralized settings, for both peak and average communication rates. Moreover, by developing informationtheoretic 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  uscthesesm 
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 email 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 900897002, USA 
Repository email  cisadmin@lib.usc.edu 
Filename  etdYuQian8883.pdf 
Archival file  Volume13/etdYuQian8883.pdf 
Description
Title  Page 237 
Full text  G.7 Proof of Theorem 11.1 for average rate Here we prove Theorem 11.1 for the average rate (i.e. inequalities (11.8) and (11.10)). The upper bounds of R ave in these inequalities can be achieved using the caching scheme provided in [11], hence we only need to prove their lower bounds. To do so, we define the following terminology: We divide the set of all demands, denoted by D, into smaller subsets, and refer them to as types. We use the same definition in [11], which are stated as follows: Given an arbitrary demand d, we define its statistics, denoted by s(d), as a sorted array of length N, such that si(d) equals the number of users that request the ith most requested file. We denote the set of all possible statistics by S. Grouping by the same statistics, the set of all demands D can be broken into many subsets. For any statistics s 2 S, we define type Ds as the set of queries with statistics s. Note that for each demand d, the value Ne(d) only depends on its statistics s(d), and thus the value is identical across all demands in Ds. For convenience, we denote that value by Ne(s). Given a prefetching scheme and a type Ds, we say a rate R is achievable for type Ds if we can find a function R(d) that is achievable for any demand d in Ds, satisfying R = Ed[R(d)], where d is uniformly random in Ds. Hence, to characterize R ave, it is sufficient to lower bound the achievable rates for each type individually, and show that for each type, the caching scheme provided in [11] is within the given constant factors optimal for large F and small . We first lower bound any achievable rate for each type as follows : Within a type Ds, we can find a demand d, such that users in {1, ...,Ne(s)} requests different files. We can easily generalize Lemma 11.2 to this demand, and any achievable rate of this demand, denoted by Rd, is lower bounded by the following inequality: Rd 1 F 0 @ NXe(s) k=1 H(Wdk Z{1,...,k},W{d1,...,dk−1}) 1 A − Ne(s)( 1 F + ). (G.72) Applying the same bounding technique to all demands in type Ds. We can prove that any rate that is achievable for Ds, denoted by Rs, is bounded by the follows: Rs 1 F 0 @ NXe(s) k=1 H (WkZ{1,...,k},W{1,...,k−1}) 1 A − Ne(s)( 1 F + ), (G.73) where function H (·) is defined in the proof of Theorem 11.2. 222 