Communication vs Distributed Computation: an alternative trade-off curve

Size: px
Start display at page:

Download "Communication vs Distributed Computation: an alternative trade-off curve"

Transcription

1 Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, {yahya.ezzeldin, mkamoose, axiv: v1 [cs.it] 24 May 2017 Abstact In this pape, we evisit the communication vs. distibuted computing tade-off, studied within the famewok of MapReduce in [1]. An implicit assumption in the afoementioned wok is that each seve pefoms all possible computations on all the files stoed in its memoy. Ou stating obsevation is that, if seves can compute only the intemediate values they need, then stoage constaints do not diectly imply computation constaints. We examine how this affects the communicationcomputation tade-off and suggest that the tade-off be studied with a pedetemined stoage constaint. We then poceed to examine the case whee seves need to pefom computationally intensive tasks, and may not have sufficient time to pefom all computations equied by the scheme in [1]. Given a theshold that limits the computational load, we deive a lowe bound on the associated communication load, and popose a heuistic scheme that achieves in some cases the lowe bound. I. INTRODUCTION Distibuted computation acoss a set of wieless netwoked seves is well motivated fo seveal pactical constaints: we may want to speed up computation time so as to finish a computation faste; we may have patial view of the files needed fo computation acoss seves; we may have limited memoy in each seve; o we may be motivated by enegy constaints. In this pape we conside the distibuted computing famewok studied in [1], that follows the achitectue of MapReduce [2]. Ou stating obsevation is that, the system in [1] does not explicitly sepaate computation fom stoage. The system uses a cluste of seves to compute Q output functions fom N input files. Each file is stoed in diffeent seves, balancing the amount of stoage acoss seves. The wok in [1] calculates the tade-off between the amount of computation and communication that seves need to do fo such file placement. Howeve, an undelying assumption of the deived tade-off, is that each seve pefoms all possible computations on all the files stoed in its memoy. It is natual to ask: is it indeed useful to pefom all possible computations? The following simple example illustates that this is not always the case. Conside a cluste with =3 seves, N=3 files and Q=3 output functions. All 3 files ae available at each seve and each seve is equied to compute only one of the output functions. In this case, instead of pefoming 9 computations pe seve (as assumed in [1]), each seve only needs to pefom computations elated to its dedicated output function, i.e., only 3 computations ae needed pe seve. Ou fist contibution is to genealize this obsevation and deive an altenative tade-off cuve to the scheme in [1]. We explicitly use thee paametes: C total the total amount of computation equied; that captues the memoy equiements; and the communication load L. We conside the placement and communication scheme in [1], and calculate the minimum numbe of computations each seve needs to pefom. We take into account the amount computed by the seve fo its assigned output functions, the amount that need to be communicated to othe seves, and the amount needed to use as side infomation to decode tansmissions fom othe seves. We then poceed to examine the case whee seves need to pefom computationally intensive tasks, and in paticula, do not have sufficient time to pefom all computations the cuve in [1] equies. Such a scenaio may occu in wieless, whee we may have cheap mobile devices with low computational powe that need to coopeatively pefom time-citical opeations, fo scientific computing o vitual eality applications. We ask, if the cluste is limited to pefom an amount of computation below a theshold, what is the esulting minimum communication equied to achieve the function computation. Ou second contibution is to deive a lowe bound fo the communication-computation tade-off when a cluste has a limited computation budget. Fo this lowe bound, we assume that the files ae distibuted acoss the cluste with a pedetemined level of edundancy that does not gow with the available computation budget. We show that a scheme diectly infeed fom [1] pefoms pooly when compaed against the deived lowe bound. Finally, we develop a distibuted computing scheme inspied by [1] and show though numeical evaluation that the communication-computation tade-off it povides is compaable to the afoementioned lowe bound. Related Wok. Minimizing communication load fo distibuted computation tasks has eceived consideable attention in the liteatue: stating fom distibuted boolean function computation between two paties [3], [4] to the moe genealized theoy of communication complexity [5], [6]. A key concept in educing the needed amount of communication is though netwok coding. A pominent example of this concept is in the context of distibuted cache netwoks [7], [8], [9], whee coding is used in eithe the data placement o data delivey phases to educe the amount of communication in the delivey phase. Recently, coding was also consideed in the context of distibuted computing systems that ae based on the MapReduce famewok [1], [10], [11]. In fact, the authos in [1] povided a Coded Distibuted Computing (CDC) scheme which educes the amount of communication needed in the

2 data shuffling phase by using coded multicast tansmissions. Ou wok diffes in that we sepaate computation and stoage, and thus deive altenative tade-off cuves depending on the elative values of these paametes. II. SYSTEM MODEL Notation. Calligaphic lettes denote sets though out the pape. A denotes the cadinality of the set A. The expession [a : b] denotes the set of integes fom a to b. MapReduce famewok. We conside a cluste of seves that computes Q output functions φ q, q [1 : Q], fom N input files w n, n [1 : N]. In this pape, we assume that the seves shae a lossless boadcast domain: a tansmission fom a seve can be losslesly eceived by all othe seves. We assume the cluste uses a MapReduce famewok to compute the set of Q functions in a distibuted manne. MapReduce is based on the assumption that each output function can be calculated as a function of some intemediate pocessing of the files. In othe wods, φ q (w 1,..., w N ) = h q (v q,1,..., v q,n ), whee v q,n = g q,n (w n ) is the intemediate value computed fom file w n elevant to the output function φ q, and has length T bits. In MapReduce teminology, the intemediate value is computed (o mapped ) using a map function g q,n and h q educes the intemediate values {v q,n } N n=1 to output φ q. Based on this decomposition, the computation model in [1] consists of thee phases: Map, Shuffle and Reduce. Additionally, a Placement phase distibutes files and tasks among the seves in the cluste. We next descibe each of the phases: 1) Placement Phase: Each seve k is loaded with a subset M k of the N files, such that k M k = [1 : N]. Each seve k is also assigned to compute a patition W k of the output functions, whee k W k = [1 : Q]. 2) Map Phase: Each seve k computes a subset C k of the intemediate values elated to M k, i.e., C k {v q,n q [1 : Q], n M k }. At the end of the Map phase, the assigned computation subsets satisfy that k C k = {v q,n q [1 : Q], n [1 : N]}. Remak 1. In MapReduce, files ae mapped by pesenting them as (key, value) pais to a map( ) function that outputs a set of intemediate (key, value) pais based on the input pai. Although, the same map( ) build is used acoss the seves, the function can output diffeent sets intemediate values based on the seve ID by including this infomation in the key. 3) Shuffle Phase: Fo a seve k to compute a function φ q whee q W k, it needs all the intemediate messages V q = {v q,n q W k, n [1:N]}. Thus in the Shuffle phase, the seves exchange intemediate values, such that each seve has access to all its needed sets V q. The shuffling scheme can be descibed as follows: each seve k ceates a message X k that is a function of its locally computed intemediate values and boadcasts this message X k to the emaining 1 nodes. 4) Reduce Phase: In the Reduce phase, seve k uses its locally computed intemediate values and the eceived tansmissions X 1,..., X to decode the set of the needed intemediate values V q, q W k. Using V q, the nodes can now compute the desied functions φ q = h q (V q ), q W k. Pefomance metics. We measue the pefomance of this computation cluste acoss thee paametes: the load edundancy (), the computation load (C total ) and the communication load (L), defined as follows: Load Redundancy. We define the load edundancy as the aveage numbe of times a file is assigned acoss the seves. k=1 M k We denote this by, i.e., N. Load edundancy captues memoy constaints. Computation Load. We define the computation load C total k C k as the total numbe of computations pefomed acoss seves in the cluste. Communication Load. We define the communication load L b(x i) k=1 QNT, as the numbe of bits tansmitted in the Shuffle phase nomalized by QNT, whee b(x i ) is the numbe of bits used to epesent X i and QNT is the total numbe of bits in all intemediate values v q,n, fo q = [1 : Q] and n = [1 : N]. Fom the definition, we have 0 L 1. The definitions of L and follow [1]; howeve in this pape, we explicitly sepaate the edundancy fom the computation load, and use diffeent paametes fo each. III. ON THE RELATION BETWEEN REDUNDANCY AND COMPUTATION An undelying assumption in [1] is that each seve k must compute all the intemediate value fo its stoed files M k. In othe wods, C k = {v q,n q [1 : Q], n M k }. In this case, the load edundancy is linealy popotional to the total numbe of computations in the system as C k = M k Q and can be theefoe egaded as the computation load. Howeve, if the seve can selectively choose which intemediate values of M k to compute in the Map phase (as long as the communication load is the same), then the total numbe of computations is not necessaily linealy coelated with. Consequently, an incease in does not necessaily esult in an incease in the numbe of computations pefomed by the cluste. Fo example, assume that Q = and each seve is equied to compute 1 output function (without loss of geneality, W k = {k}). Then, we have C total = fo both = 1 and =. Fo = 1, each file is available at only one seve, thus each seve needs to compute all intemediate values fo all files stoed in its memoy. Fo =, all files ae available at each seve. Thus, each seve needs only to compute N intemediate values elated to its output function. In both cases, the optimal communication load L() = is achieved [1, Theoem 1]. Note that fo =, if the seves computed all intemediate values fo thei files, thee would be computations instead of. Late in this section, we chaacteize the minimum computation load needed by the Coded Distibuted Computing (CDC) scheme in [1] in ode to achieve the optimal communication load L () in [1, Theoem 1] fo = [1 : ]. As we see late, taking this minimum computation load into account changes the tade-off in [1] fo CDC. As a peliminay to that discussion, we next biefly descibe the CDC scheme in [1].

3 An oveview of the CDC scheme. Assume that N and Q ae sufficiently lage so that N = ( ) η1 and Q = η 2 fo some η 1, η 2 N. The CDC scheme opeates as follows (see [1] fo a complete desciption): 1) Placement Phase: A disjoint subset M T of the files is assigned to each subset T of seves whee M T = η 1. Evey seve is thus assigned a set of N/ files and evey η 1 patition of these files is shaed with a unique set of 1 othe seves. Evey seve k is also assigned a unique subset W k of the output functions to calculate such that W k = η 2. 2) Map Phase: Evey seve computes all possible intemediate function values fo the files it has. 3) Shuffling Phase: The shuffling phase epeats the following pocedue fo evey set S [1 : ] of size + 1: (i) Fo evey i S, define S i =S\{i} and identify VS i i as V i S i {v q,n n j Si M j, q W i }. (1) The set VS i i epesents the intemediate values that ae needed by seve i to compute functions in W i, which can be computed exclusively by all seves in S i (ecall that a file is eplicated at exactly seves). Note that VS i i =η 1 η 2. (ii) Split evey intemediate value in VS i i into disjoint pats of T/ bits and associate each pat with a seve in S i. Thus we split the set VS i i into patitions denoted by VS i, j S i,j i, each T of size η 1 η 2. Each seve j will be esponsible to convey its pat to seve i with coded boadcast tansmissions. (iii) Afte splitting all sets VS i i fo all i S (we have + 1 T such sets), seve k sends the bit-wise XOR of all the η 1 η 2 - bit pats in Uk S i S Vi S, i.e., it makes η i,k 1η 2 boadcast tansmissions each of size T bits. Each tansmission is useful to all othe nodes in S; moeove, each seve in S has the equied side infomation to decode the pat it needs. 4) Reduce Phase: In the educe phase, evey seve uses its locally computed intemediate values and the decoded intemediate values in the shuffling phase to compute the η 2 output functions assigned to it in the initialization phase. Next we discuss the minimum computation load needed fo the CDC scheme. Minimum Computations. The next poposition chaacteizes the minimum computation equied by the CDC scheme. Poposition 1. Fo the placement scheme in [1] with = [1 : ], the communication load L () = can be achieved with computation load ( + 1) C total =. (2) Poof. We fist note that evey seve i locally computes all intemediate values equied by the functions in W i and coesponding to the files in M i ; we denote these intemediate values as C Mi,W i. Thus, we have C Mi,W i = {v q,n q W i, n N M i } C i. Note that C Mi,W i = W i M i =η 2. In addition to C Mi,W i, seve i also pefoms a set of computations equied to cay out shuffling in the CDC scheme. We denote this set by C T Xi. To calculate the numbe of computations in C T Xi, we distinguish between computations equied by seve i to decode its needed intemediate values (fom tansmissions in the shuffling phase) and the computations needed to ceate its tansmissions X i in the shuffling phase. Obseve (fom the desciption of the CDC scheme ealie and in [1]) that in any S [1 : ] of size + 1 whee i S, seve i uses the sets {VS k k,i, k S\{i}} to constuct its tansmission. In addition, since the emaining pats {VS k k,j k S\{i}, j S\{i, k}} will be XOR-ed (at the othe seves) with pats needed by seve i, then seve i should compute the intemediate values k S\{i} VS k k in ode to decode its equested intemediate values as well as constuct its tansmissions in the shuffling phase. This amounts to k S,k i Vk S k = η 1 η 2 computations fo evey set S. Thus, the total numbe of computations by seve i, C i, is C i = C T Xi + C Mi,W i ( ) (( ) (i) 1 N (ii) 1 = η 1 η 2 + η 2 = η 2 η 1 + N ) ( ( 1 (iii) = Q ) ) N ( )+ N = ( +1) 2, (3) whee: (i) follows since seve i appeas in only ( ) 1 subsets of size + 1; (ii) and (iii) follow fom the assumptions that N = ( ) η1 and Q = η 2. Fom symmety, the total numbe of computations in the Map phase equals C total = C i. Note fom (2) that C total is quadatic in. Thus, we cannot view as a diect measue of computation load since both the communication load L as well as the numbe of computations C total educe fo ( + 1)/2. Fig. 1 shows the elation in (2) fo N = 2520 and = Q = 10 vesus the numbe of computations if a seve compute all map functions fo each of its stoed files. If we use [1, Theoem 1] and Poposition 1 to couple C total and L, then we get the tade-off shown in Fig. 2 fo the CDC scheme, whee the ed line is a scaled vesion of the tade-off in [1]. Fom Fig. 2, it can be seen that if we ae fee to choose fo a given C total, then the optimal tade-off happens at C total = = 25200; by picking = = 10. This gives a communication load equal to zeo while achieving the minimum computation load. This obsevation suggests that we can bette undestand the communication-computation tade-off, if we conside it with a pedefined edundancy load () that does not change with the computation load C total. Thus, in the emainde of the pape, we conside as a paamete of the cluste (with, Q and N), and show how we can exploit this edundancy to pefom coded distibuted computing when at most C total computations ae allowed. IV. AN ACHIEVABLE COMMUNICATION-COMPUTATION TRADE-OFF Conside a distibuted computing cluste with paametes N, Q, and load edundancy, whee epesents the numbe of times each file is stoed acoss the seves in the cluste. Fo ou discussion in this section, we assume that [1 : ] and that the file placement (fo a given ) follows the stategy in [1]. We ae inteested in answeing the question: If the

4 Computation Load (Ctotal) 10 5 N = 2520, Q = 10, = 10 3 Minimum computations equied fo CDC Computations pefomed fo CDC in [1] Load Redundancy () Fig. 1: Computation Load vs. Load Redundancy. Communication Load (L) N = 2520, Q = 10, = 10 Minimum computations equied fo CDC Computations pefomed fo CDC in [1] Computation Load (C total ) 10 5 Fig. 2: Communication Load vs. Computation Load. Communication Load (L) N = 2520, Q = 10, = 10, = 5 Split-CDC (Patial Computations) Split-CDC (Intege Computations) CDC-fit Lowe Bound Computation Load (C total ) 10 4 Fig. 3: Communication Load vs. Computation Load fo S-CDC. cluste is allowed to pefom at most C total computations, what is the minimum communication load L(, C total ) needed in ode to compute Q output functions using the cluste? If C total ( +1)/, then fom Poposition 1, we can diectly use the CDC scheme descibed in [1], to achieve the( optimal ) communication load L(, C total ) = L () = 1 1. Howeve, when Ctotal < ( + 1)/, then the available computation budget is not enough to pefom the shuffling and decoding equied by the CDC scheme. In this case, can the CDC scheme be adapted to wok with a estictive computation budget? Fom [1], we can infe a simple modification to the CDC scheme, which we efe to as CDCfit. In this scheme, we use CDC on the cluste while opeating it with a lowe load edundancy that fits the computation constaints. In othe wods, we pick = max{ C total ( + 1)/, } and opeate the cluste as if the files ae only epeated times. This ensues that thee ae enough computations to satisfy CDC ( fo) and achieve the communication load L( ) = 1 1. A natual question to ask hee is whethe this is the best possible appoach? To chaacteize this, we next develop a lowe bound on the communication load when the cluste has a computation load C total and load edundancy. Lowe Bound on Communication load. We povide hee a lowe bound on the communication load fo only a paticula class of shuffling schemes. In this class, given a boadcast tansmission sent duing the shuffling phase, seve i can decode its equied intemediate value fom that tansmission using only side infomation that it has locally computed. i.e., it does not ely on futue tansmissions to povide it with enough linea combinations to decode its equied intemediate values. In what follows, an l-type tansmission denotes a boadcast tansmission made by a seve duing shuffling, which consists of the XOR of equally-sized pats of l intemediate values. The weight of an l-type tansmission is the size of the intemediate value pats used in the tansmission. In ode to elax ou lowe bound, we assume that a seve can pefom patial computations on the files, i.e., if a seve wants to tansmit a faction of ft bits (with 0 f 1) of v q,n (ecall v q,n is made of T bits), then it only expends f of a computation. With this assumption, we can obseve the following popeties of ou cluste: Obs. 1. Each seve has N/ files stoed locally, and needs to eceive ( )N Q intemediate values though shuffling. Obs. 2. Fo a cluste with load edundancy, all feasible tansmission have l. This follows by noting that an l-type tansmission is assumed to satisfy l seves 1. Theefoe, each intemediate value involved in this tansmission is computed once at the tansmitte, and computed once at each of the othe l 1 seves which would utilize this intemediate value as side infomation to decode the tansmission. Since each file is epeated acoss seves, then l. Obs. 3. In the shuffling phase, each l-type tansmission and weight f T incus an added computation cost to the cluste equal to l 2 ft. To see this, note that the seve sending this tansmission makes lf T computations. Moeove, an l-type tansmission seves l seves, each of which would have to do (l 1)f T computations to acquie the needed side infomation. Theefoe we get lft + l(l 1)fT = l 2 ft. Let z l be the numbe of l-type tansmissions. Then, the communication load fo a shuffling scheme is lowe bounded by the solution of the following Linea Pogam (LP) L lb (C total ) = s.t. z l l z i 0, min {z 1,...,z } l z l ( ), i [1 : ], z l l 2 + C total whee: (i) the fist constaint is a necessay condition fo the shuffling phase to delive ( )QN intemediate values to 2 each seve in the cluste; (ii) the second condition is a necessay condition fo the total computation (local computations and shuffling computations) to not exceed C total. Note that the esult of the LP is a lowe bound to the communication load since the fist constaint is not sufficient to ensue that each seve eceives its needed intemediate values. Fig 3 compaes the communication-computation tade-off fo the afoementioned CDC-fit scheme with the lowe bound in (4). The two tade-offs ae close only towads high computation loads which allows the system to opeate with an close to 1 If it is only useful fo less than l seves then the tansmitte could have XOR-ed less intemediate values to geneate the tansmission. (4)

5 the natual of the cluste. Next, we popose a modification to the CDC scheme denoted as Split-CDC (S-CDC) that povide a communication-computation tade-off close to the tade-off suggested by the lowe bound in (4). Split-CDC (S-CDC). In ode to intoduce S-CDC, we make the following obsevations on the shuffling stategy in CDC. Obs. 1. The set VS i i descibed in (1) is of size VS i i = η 1 η 2. Obs. 2. Fo evey subset S of + 1 seves, the computations needed to satisfy all seves in S is (+1)η 1 η 2 and the numbe of packets communicated among them is +1 η 1η 2. Obs. 3. Fom (1), it is not had to see that fo any subset S S such that S > 1, VS i i VS i i S i,. The pevious obsevations suggest the following modification to the CDC scheme. Each subset S of size + 1 can be split into disjoint subsets of smalle size. Each smalle subset S can still be used to satisfy its membes with the set VS i i as pe Obsevation 3. Theefoe, by using subsets {S } of size diffeent than + 1, this would allow the scheme to exhibit diffeent levels of communications and computations pe S (based on the size of the splits), as evident fom Obsevation 2. The possible sizes of S ae [1 : ], which we efe to as the split size. Fo, define j = and = ( + 1) j( + 1) 1. Thus we can split set S into j disjoint sets S ( ) of size ( + 1) and one set S ( ) of size ( + 1). Fo each set in S ( ), the needed numbe of computations is ( + 1)η 1 η 2 and the needed numbe of communicated packets is +1 η 1 η 2. If S ( ) is not empty, then simila expession follow (except when S ( ) = 1, whee we need η 1 η 2 computations and η 1 η 2 packets exchanges to send the intemediate values though unicast tansmissions fom any seve in S ( ) ). Finally, since VS i i = η 1 η 2, fo evey subset S of size + 1, CDC would natually incu η 1 η 2 tansmission ounds, each deliveing exactly one intemediate value in VS i i fo all seves in S. Thus, ou obsevations suggest that CDC can opeate each of these tansmission ounds with a diffeent splitting size of S; thus the name Split-CDC (S-CDC). Fo a tansmission ound using split size, the total computations and communications pe subset S of size +1 is { j ( + 1) + ( + 1), 0, Comp( ) = j ( + 1) + 1, = 0, { Comm( j +1 ) = + +1, 0, j , = 0. z η 1η 2 S-CDC can now be fomally descibed. Let be the faction of the intemediate values in VS i i pe subset S that is deliveed using split size. Then, S-CDC woks as follows: z 1) Detemine the optimal values of η 1η 2 fo [1 : ] - this is done via solving the LP in (5). 2) Fo each S [1:] of size +1 and split size [1:]: Split set S into j disjoint sets S ( ) of size ( + 1) and one set S ( ) of size ( + 1). Use enough computations and communications pe each of the subsets S ( ) and S ( ) as pe the CDC scheme, to delive z intemediate values to all seves in S. The computations and communications needed to do so is equal to z Comp( ) and z Comm( ) espectively. What emains is to find the optimal values of z. We do so via solving the following LP, which minimizes the total communication load subject to a total computation constaint. L P (C total ) = min {z 1,...,z } s.t. ( + 1 ( ) + 1 z l Comm(l) z l = η 1 η 2, z i 0, i [1 : ], ) z l Comp(l) + C total. (5) Note that in (5), the vaiables z l ae allowed to take nonintege values which means that we ae allowing the seves to do patial computations of the intemediate values if that is what they will need to tansmit o decode. To estict patial computations, we can appoximate the solution of (5) to get a suboptimal intege-valued solution ẑl. Note that if an optimal solution of (5) is non-intege, then thee exists only two nonzeo elements of {zl }; we denote these two elements as z l 1 and z l2 whee l 1 < l 2. Then fo ou appoximate solution, we define ẑl 2 = zl 2 and ẑl 1 = η 1 η 2 zl 2. This gives us ẑ l Comm(l). a communication load ˆL P (C total ) = ( +1) Fig. 3 compaes the pefomance of S-CDC with the lowe bound in (4) fo N = 2520, Q = = 10 and = 5 when patial computations ae allowed. In this paticula setup, Fig. 3 shows that by peventing patial computations, we only incu a small faction of the communication load as an expense. REFERENCES [1] S. Li, M. A. Maddah-Ali, and A. S. Avestimeh, Fundamental tadeoff between computation and communication in distibuted computing, in IEEE Intenational Symposium on Infomation Theoy (ISIT), 2016, pp [2] J. Dean and S. Ghemawat, Mapeduce: simplified data pocessing on lage clustes, Communications of the ACM, vol. 51, no. 1, pp , [3] A. C.-C. Yao, Some complexity questions elated to distibutive computing (peliminay epot), in Poceedings of the eleventh annual ACM symposium on Theoy of computing, 1979, pp [4] A. Olitsky and J. Roche, Coding fo computing, IEEE Tans. on Infomation Theoy, vol. 47, no. 3, pp , [5] E. ushilevitz and N. Nisan, Communication complexity, [6]. Becke and U. Wille, Communication complexity of goup key distibution, in Poceedings of the 5th ACM confeence on Compute and communications secuity, 1998, pp [7] M. A. Maddah-Ali and U. Niesen, Fundamental limits of caching, IEEE Tans. on Infomation Theoy, vol. 60, no. 5, pp , [8] N. aamchandani, U. Niesen, M. A. Maddah-Ali, and S. N. Diggavi, Hieachical coded caching, IEEE Tans. on Infomation Theoy, vol. 62, no. 6, pp , [9] J. Hachem, N. aamchandani, and S. Diggavi, Content caching and delivey ove heteogeneous wieless netwoks, in IEEE Confeence on Compute Communications (INFOCOM), 2015, pp [10] S. Li, M. A. Maddah-Ali, and A. S. Avestimeh, Coded distibuted computing: Staggling seves and multistage dataflows, in 54th Annual Alleton Confeence on Communication, Contol, and Computing. IEEE, 2016, pp [11] Q. Yu, S. Li, M. A. Maddah-Ali, and A. S. Avestimeh, How to optimally allocate esouces fo coded distibuted computing? axiv pepint axiv: , 2017.

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class

More information

Coded Distributed Computing

Coded Distributed Computing Coded Distibuted Computing Salman Avestimeh USC joint wok with Songze Li (USC), Qian Yu (USC), and Mohammad Maddah-Ali (Bell-Labs) Asiloma Confeence Nov. 2016 Infastuctues fo (Big) Data Analytics How to

More information

Cloud-Aided Wireless Networks with Edge Caching: Fundamental Latency Trade-Offs in Fog Radio Access Networks

Cloud-Aided Wireless Networks with Edge Caching: Fundamental Latency Trade-Offs in Fog Radio Access Networks 206 IEEE Intenational Symposium on Infomation Theoy Cloud-Aided Wieless Netwos with Edge Caching: Fundamental Latency Tade-Offs in Fog Radio Access Netwos Ravi Tandon Osvaldo Simeone Depatment of ECE Univesity

More information

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet

More information

Point-Biserial Correlation Analysis of Fuzzy Attributes

Point-Biserial Correlation Analysis of Fuzzy Attributes Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh

More information

Conversion Functions for Symmetric Key Ciphers

Conversion Functions for Symmetric Key Ciphers Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401

More information

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth

More information

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management

More information

An Unsupervised Segmentation Framework For Texture Image Queries

An Unsupervised Segmentation Framework For Texture Image Queries An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu

More information

Dynamic Topology Control to Reduce Interference in MANETs

Dynamic Topology Control to Reduce Interference in MANETs Dynamic Topology Contol to Reduce Intefeence in MANETs Hwee Xian TAN 1,2 and Winston K. G. SEAH 2,1 {stuhxt, winston}@i2.a-sta.edu.sg 1 Depatment of Compute Science, School of Computing, National Univesity

More information

On the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks

On the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks On the Fowading Aea of Contention-Based Geogaphic Fowading fo Ad Hoc and Senso Netwoks Dazhi Chen Depatment of EECS Syacuse Univesity Syacuse, NY dchen@sy.edu Jing Deng Depatment of CS Univesity of New

More information

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension 17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach

More information

Topological Characteristic of Wireless Network

Topological Characteristic of Wireless Network Topological Chaacteistic of Wieless Netwok Its Application to Node Placement Algoithm Husnu Sane Naman 1 Outline Backgound Motivation Papes and Contibutions Fist Pape Second Pape Thid Pape Futue Woks Refeences

More information

On using circuit-switched networks for file transfers

On using circuit-switched networks for file transfers On using cicuit-switched netwoks fo file tansfes Xiuduan Fang, Malathi Veeaaghavan Univesity of Viginia Email: {xf4c, mv5g}@viginia.edu Abstact High-speed optical cicuit-switched netwoks ae being deployed

More information

arxiv: v2 [physics.soc-ph] 30 Nov 2016

arxiv: v2 [physics.soc-ph] 30 Nov 2016 Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity

More information

IP Multicast Simulation in OPNET

IP Multicast Simulation in OPNET IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok

More information

Controlled Information Maximization for SOM Knowledge Induced Learning

Controlled Information Maximization for SOM Knowledge Induced Learning 3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity

More information

HISTOGRAMS are an important statistic reflecting the

HISTOGRAMS are an important statistic reflecting the JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe

More information

Bo Gu and Xiaoyan Hong*

Bo Gu and Xiaoyan Hong* Int. J. Ad Hoc and Ubiquitous Computing, Vol. 11, Nos. /3, 1 169 Tansition phase of connectivity fo wieless netwoks with gowing pocess Bo Gu and Xiaoyan Hong* Depatment of Compute Science, Univesity of

More information

A modal estimation based multitype sensor placement method

A modal estimation based multitype sensor placement method A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;

More information

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012 2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo

More information

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which

More information

Reachable State Spaces of Distributed Deadlock Avoidance Protocols

Reachable State Spaces of Distributed Deadlock Avoidance Protocols Reachable State Spaces of Distibuted Deadlock Avoidance Potocols CÉSAR SÁNCHEZ and HENNY B. SIPMA Stanfod Univesity We pesent a family of efficient distibuted deadlock avoidance algoithms with applications

More information

A Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform

A Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform A Shape-peseving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonunifom Fuzzification Tansfom Felipe Fenández, Julio Gutiéez, Juan Calos Cespo and Gacián Tiviño Dep. Tecnología Fotónica, Facultad

More information

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the

More information

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes On the Convesion between Binay Code and BinayReflected Gay Code on Boolean Cubes The Havad community has made this aticle openly available. Please shae how this access benefits you. You stoy mattes Citation

More information

Erasure-Coding Based Routing for Opportunistic Networks

Erasure-Coding Based Routing for Opportunistic Networks Easue-Coding Based Routing fo Oppotunistic Netwoks Yong Wang, Sushant Jain, Magaet Matonosi, Kevin Fall Pinceton Univesity, Univesity of Washington, Intel Reseach Bekeley ABSTRACT Routing in Delay Toleant

More information

Towards Adaptive Information Merging Using Selected XML Fragments

Towards Adaptive Information Merging Using Selected XML Fragments Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,

More information

A Recommender System for Online Personalization in the WUM Applications

A Recommender System for Online Personalization in the WUM Applications A Recommende System fo Online Pesonalization in the WUM Applications Mehdad Jalali 1, Nowati Mustapha 2, Ali Mamat 2, Md. Nasi B Sulaiman 2 Abstact foeseeing of use futue movements and intentions based

More information

Performance Optimization in Structured Wireless Sensor Networks

Performance Optimization in Structured Wireless Sensor Networks 5 The Intenational Aab Jounal of Infomation Technology, Vol. 6, o. 5, ovembe 9 Pefomance Optimization in Stuctued Wieless Senso etwoks Amine Moussa and Hoda Maalouf Compute Science Depatment, ote Dame

More information

AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE

AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE Tolga Numanoglu, Bulent Tavli, and Wendi Heinzelman Depatment of Electical and Compute Engineeing Univesity

More information

Detection and Recognition of Alert Traffic Signs

Detection and Recognition of Alert Traffic Signs Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives

More information

Module 6 STILL IMAGE COMPRESSION STANDARDS

Module 6 STILL IMAGE COMPRESSION STANDARDS Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.

More information

The Internet Ecosystem and Evolution

The Internet Ecosystem and Evolution The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee

More information

SCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS

SCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS SCALABL NRGY FFICINT AD-HOC ON DMAND DISTANC VCTOR (S-AODV) ROUTING PROTOCOL IN WIRLSS MSH NTWORKS Sikande Singh Reseach Schola, Depatment of Compute Science & ngineeing, Punjab ngineeing College (PC),

More information

The Dual Round Robin Matching Switch with Exhaustive Service

The Dual Round Robin Matching Switch with Exhaustive Service The Dual Round Robin Matching Switch with Exhaustive Sevice Yihan Li, Shivenda S. Panwa, H. Jonathan Chao Abstact Vitual Output Queuing is widely used by fixed-length highspeed switches to ovecome head-of-line

More information

= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2

= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2 Random Waypoint Model in n-dimensional Space Esa Hyytiä and Joma Vitamo Netwoking Laboatoy, Helsinki Univesity of Technology, Finland Abstact The andom waypoint model (RWP) is one of the most widely used

More information

Scaling Location-based Services with Dynamically Composed Location Index

Scaling Location-based Services with Dynamically Composed Location Index Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute

More information

Assessment of Track Sequence Optimization based on Recorded Field Operations

Assessment of Track Sequence Optimization based on Recorded Field Operations Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment

More information

Configuring RSVP-ATM QoS Interworking

Configuring RSVP-ATM QoS Interworking Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP

More information

Accurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen

Accurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen Accuate Diffaction Efficiency Contol fo Multiplexed Volume Hologaphic Gatings Xuliang Han, Gichel Kim, and Ray T. Chen Micoelectonic Reseach Cente Depatment of Electical and Compute Engineeing Univesity

More information

A Two-stage and Parameter-free Binarization Method for Degraded Document Images

A Two-stage and Parameter-free Binarization Method for Degraded Document Images A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and

More information

Transmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design

Transmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design Tansmission Lines Modeling Based on Vecto Fitting Algoithm and RLC Active/Passive Filte Design Ahmed Qasim Tuki a,*, Nashien Fazilah Mailah b, Mohammad Lutfi Othman c, Ahmad H. Saby d Cente fo Advanced

More information

A New Finite Word-length Optimization Method Design for LDPC Decoder

A New Finite Word-length Optimization Method Design for LDPC Decoder A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology

More information

A Novel Automatic White Balance Method For Digital Still Cameras

A Novel Automatic White Balance Method For Digital Still Cameras A Novel Automatic White Balance Method Fo Digital Still Cameas Ching-Chih Weng 1, Home Chen 1,2, and Chiou-Shann Fuh 3 Depatment of Electical Engineeing, 2 3 Gaduate Institute of Communication Engineeing

More information

A Memory Efficient Array Architecture for Real-Time Motion Estimation

A Memory Efficient Array Architecture for Real-Time Motion Estimation A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN

More information

Efficient protection of many-to-one. communications

Efficient protection of many-to-one. communications Efficient potection of many-to-one communications Miklós Molná, Alexande Guitton, Benad Cousin, and Raymond Maie Iisa, Campus de Beaulieu, 35 042 Rennes Cedex, Fance Abstact. The dependability of a netwok

More information

An Improved Resource Reservation Protocol

An Improved Resource Reservation Protocol Jounal of Compute Science 3 (8: 658-665, 2007 SSN 549-3636 2007 Science Publications An mpoved Resouce Resevation Potocol Desie Oulai, Steven Chambeland and Samuel Piee Depatment of Compute Engineeing

More information

Multi-Objective Analysis of Ridesharing in Automated Mobility-on-Demand

Multi-Objective Analysis of Ridesharing in Automated Mobility-on-Demand Robotics: Science and Systems 018 Pittsbugh, PA, USA, June 6-30, 018 Multi-Objective Analysis of Rideshaing in Automated Mobility-on-Demand Michal Čáp and Javie Alonso-Moa Dept. of Cognitive Robotics,

More information

Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks

Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks Numbe of Paths and Neighbous Effect on Multipath Routing in Mobile Ad Hoc Netwoks Oday Jeew School of Infomation Systems and Accounting Univesity of Canbea Canbea ACT 2617, Austalia oday.jeew@canbea.edu.au

More information

Coded Distributed Computing. Salman Avestimehr

Coded Distributed Computing. Salman Avestimehr Coded Distibuted Computing Salman Avestimeh Computing Infastuctue of CPS How to optimally utilize esouces? stoage communication esouces computation enegy time Fundamental Tadeoffs between Resouces stoage

More information

THE THETA BLOCKCHAIN

THE THETA BLOCKCHAIN THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent

More information

WIRELESS sensor networks (WSNs), which are capable

WIRELESS sensor networks (WSNs), which are capable IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. XX, NO. XX, XXX 214 1 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang, Kuan

More information

Optimal Sporadic Location Privacy Preserving Systems in Presence of Bandwidth Constraints

Optimal Sporadic Location Privacy Preserving Systems in Presence of Bandwidth Constraints Optimal Spoadic Location Pivacy Peseving Systems in Pesence of Bandwidth Constaints ABSTRACT Michael Hemann KU Leuven ESAT/COSIC, iminds Leuven, Belgium michael.hemann@esat.kuleuven.be Claudia Diaz KU

More information

Optical Flow for Large Motion Using Gradient Technique

Optical Flow for Large Motion Using Gradient Technique SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this

More information

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits

More information

Prioritized Traffic Recovery over GMPLS Networks

Prioritized Traffic Recovery over GMPLS Networks Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing

More information

Any modern computer system will incorporate (at least) two levels of storage:

Any modern computer system will incorporate (at least) two levels of storage: 1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe

More information

INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM

INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM LiLi Du Depatment of Civil, Achitectual, and Envionmental Engineeing Illinois Institute of Technology 3300

More information

Hierarchically Clustered P2P Streaming System

Hierarchically Clustered P2P Streaming System Hieachically Clusteed P2P Steaming System Chao Liang, Yang Guo, and Yong Liu Polytechnic Univesity Thomson Lab Booklyn, NY 11201 Pinceton, NJ 08540 Abstact Pee-to-pee video steaming has been gaining populaity.

More information

Improvement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1

Improvement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1 Impovement of Fist-ode Takagi-Sugeno Models Using Local Unifom B-splines Felipe Fenández, Julio Gutiéez, Gacián Tiviño and Juan Calos Cespo Dep. Tecnología Fotónica, Facultad de Infomática Univesidad Politécnica

More information

Annales UMCS Informatica AI 2 (2004) UMCS

Annales UMCS Informatica AI 2 (2004) UMCS Pobane z czasopisma Annales AI- Infomatica http://ai.annales.umcs.pl Annales Infomatica AI 2 (2004) 33-340 Annales Infomatica Lublin-Polonia Sectio AI http://www.annales.umcs.lublin.pl/ Embedding as a

More information

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks 788 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 12, NO. 2, APRIL 2016 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang,

More information

Adaptation of TDMA Parameters Based on Network Conditions

Adaptation of TDMA Parameters Based on Network Conditions Adaptation of TDMA Paametes Based on Netwok Conditions Boa Kaaoglu Dept. of Elect. and Compute Eng. Univesity of Rocheste Rocheste, NY 14627 Email: kaaoglu@ece.ocheste.edu Tolga Numanoglu Dept. of Elect.

More information

Delay-Optimized File Retrieval under LT-Based Cloud Storage

Delay-Optimized File Retrieval under LT-Based Cloud Storage infomation: DOI 10.1109/TCC.015.404, IEEE Tansactions on Cloud Computing IEEE TRANSACTIONS ON CLOUD COMPUTING 1 Delay-Optimized File Retieval unde LT-Based Cloud Stoage Haifeng Lu,Chuan Heng Foh, Senio

More information

Analysis of Wired Short Cuts in Wireless Sensor Networks

Analysis of Wired Short Cuts in Wireless Sensor Networks Analysis of Wied Shot Cuts in Wieless Senso Netwos ohan Chitaduga Depatment of Electical Engineeing, Univesity of Southen Califonia, Los Angeles 90089, USA Email: chitadu@usc.edu Ahmed Helmy Depatment

More information

A Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces

A Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces A Family of Distibuted Deadlock Avoidance Potocols and thei Reachable State Spaces Césa Sánchez, Henny B. Sipma, and Zoha Manna Compute Science Depatment Stanfod Univesity, Stanfod, CA 94305-9025 {cesa,sipma,manna}@cs.stanfod.edu

More information

Separability and Topology Control of Quasi Unit Disk Graphs

Separability and Topology Control of Quasi Unit Disk Graphs Sepaability and Topology Contol of Quasi Unit Disk Gaphs Jiane Chen, Anxiao(Andew) Jiang, Iyad A. Kanj, Ge Xia, and Fenghui Zhang Dept. of Compute Science, Texas A&M Univ. College Station, TX 7784. {chen,

More information

EE 6900: Interconnection Networks for HPC Systems Fall 2016

EE 6900: Interconnection Networks for HPC Systems Fall 2016 EE 6900: Inteconnection Netwoks fo HPC Systems Fall 2016 Avinash Kaanth Kodi School of Electical Engineeing and Compute Science Ohio Univesity Athens, OH 45701 Email: kodi@ohio.edu 1 Acknowledgement: Inteconnection

More information

A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM

A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM Accepted fo publication Intenational Jounal of Flexible Automation and Integated Manufactuing. A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM Nagiza F. Samatova,

More information

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments Wieless Netwoks 0, 3 32, 200 200 Kluwe Academic Publishes. Manufactued in The Nethelands. Combinatoial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registation in Mobile

More information

Tier-Based Underwater Acoustic Routing for Applications with Reliability and Delay Constraints

Tier-Based Underwater Acoustic Routing for Applications with Reliability and Delay Constraints Tie-Based Undewate Acoustic Routing fo Applications with Reliability and Delay Constaints Li-Chung Kuo Depatment of Electical Engineeing State Univesity of New Yok at Buffalo Buffalo, New Yok 14260 Email:

More information

Shortest Paths for a Two-Robot Rendez-Vous

Shortest Paths for a Two-Robot Rendez-Vous Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal

More information

CLOUD based storage systems are emerging to gain significant

CLOUD based storage systems are emerging to gain significant IEEE TRANSACTIONS ON CLOUD COMPUTING, VOL. 5, NO. 2, APRIL-JUNE 2017 221 On the Latency and Enegy Efficiency of Distibuted Stoage Systems Akshay Kuma, Student Membe, IEEE, Ravi Tandon, Membe, IEEE, and

More information

An Energy-Efficient Approach for Provenance Transmission in Wireless Sensor Networks

An Energy-Efficient Approach for Provenance Transmission in Wireless Sensor Networks An Enegy-Efficient Appoach fo Povenance Tansmission in Wieless Senso Netwoks S. M. Iftekhaul Alam Pudue Univesity alams@pudue.edu Sonia Fahmy Pudue Univesity fahmy@cs.pudue.edu Abstact Assessing the tustwothiness

More information

On Adaptive Bandwidth Sharing with Rate Guarantees

On Adaptive Bandwidth Sharing with Rate Guarantees On Adaptive Bandwidth Shaing with Rate Guaantees N.G. Duffield y T. V. Lakshman D. Stiliadis y AT&T Laboatoies Bell Labs Rm A175, 180 Pak Avenue Lucent Technologies Floham Pak, 101 Cawfods Cone Road NJ

More information

Gravitational Shift for Beginners

Gravitational Shift for Beginners Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational

More information

Fault-Tolerant Routing Schemes in RDT(2,2,1)/α-Based Interconnection Network for Networks-on-Chip Designs

Fault-Tolerant Routing Schemes in RDT(2,2,1)/α-Based Interconnection Network for Networks-on-Chip Designs Fault-Toleant Routing Schemes in RDT(,,)/α-Based Inteconnection Netwok fo Netwoks-on-Chip Designs Mei Yang, Tao Li, Yingtao Jiang, and Yulu Yang Dept. of Electical & Compute Engineeing Univesity of Nevada,

More information

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:

More information

UCLA Papers. Title. Permalink. Authors. Publication Date. Localized Edge Detection in Sensor Fields. https://escholarship.org/uc/item/3fj6g58j

UCLA Papers. Title. Permalink. Authors. Publication Date. Localized Edge Detection in Sensor Fields. https://escholarship.org/uc/item/3fj6g58j UCLA Papes Title Localized Edge Detection in Senso Fields Pemalink https://escholashipog/uc/item/3fj6g58j Authos K Chintalapudi Govindan Publication Date 3-- Pee eviewed escholashipog Poweed by the Califonia

More information

FACE VECTORS OF FLAG COMPLEXES

FACE VECTORS OF FLAG COMPLEXES FACE VECTORS OF FLAG COMPLEXES ANDY FROHMADER Abstact. A conjectue of Kalai and Eckhoff that the face vecto of an abitay flag complex is also the face vecto of some paticula balanced complex is veified.

More information

Parametric Query Optimization for Linear and Piecewise Linear Cost Functions

Parametric Query Optimization for Linear and Piecewise Linear Cost Functions Paametic Quey Oimization fo Linea and Piecewise Linea Cost Functions Avind Hulgei S. Sudashan Indian Institute of Technology, Bombay {au, sudasha}@cse.iitb.ac.in Abstact The of a quey an depends on many

More information

Data mining based automated reverse engineering and defect discovery

Data mining based automated reverse engineering and defect discovery Data mining based automated evese engineeing and defect discovey James F. Smith III, ThanhVu H. Nguyen Naval Reseach Laboatoy, Code 5741, Washington, D.C., 20375-5000 ABSTRACT A data mining based pocedue

More information

Switching and Fault Transients of Unit Transformers of a Combined-Cycle Gas Turbine Generator

Switching and Fault Transients of Unit Transformers of a Combined-Cycle Gas Turbine Generator Switching and Fault Tansients of Unit Tansfomes of a Combined-Cycle Gas Tubine Geneato M. Kizilcay, S. Demmig Abstact A new combined-cycle powe plant is to be connected to a 110-kV gid though a powe cable

More information

Interference-Aware Multicast for Wireless Multihop Networks

Interference-Aware Multicast for Wireless Multihop Networks Intefeence-Awae Multicast fo Wieless Multihop Netwoks Daniel Letpatchya School of Electical and Compute Engineeing Geogia Institute of Technology Atlanta, Geogia 30332 0250 Douglas M. Blough School of

More information

Illumination methods for optical wear detection

Illumination methods for optical wear detection Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical

More information

COSC 6385 Computer Architecture. - Pipelining

COSC 6385 Computer Architecture. - Pipelining COSC 6385 Compute Achitectue - Pipelining Sping 2012 Some of the slides ae based on a lectue by David Culle, Pipelining Pipelining is an implementation technique wheeby multiple instuctions ae ovelapped

More information

On the throughput-cost tradeoff of multi-tiered optical network architectures

On the throughput-cost tradeoff of multi-tiered optical network architectures 1 On the thoughput-cost tadeoff of multi-tieed optical netwok achitectues Guy Weichenbeg, Vincent W. S. Chan, and Muiel Médad Laboatoy fo Infomation and Decision Systems Massachusetts Institute of Technology

More information

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number. Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show

More information

Heterogeneous V2V Communications in Multi-Link and Multi-RAT Vehicular Networks

Heterogeneous V2V Communications in Multi-Link and Multi-RAT Vehicular Networks 1 Heteogeneous V2V Communications in Multi-Link and Multi-RAT Vehicula Netwoks Miguel Sepulce and Javie Gozalvez Abstact Connected and automated vehicles will enable advanced taffic safety and efficiency

More information

(1) W tcp = (3) N. Assuming 1 P r 1. = W r (4) a 1/(k+1) W 2/(k+1)

(1) W tcp = (3) N. Assuming 1 P r 1. = W r (4) a 1/(k+1) W 2/(k+1) 1 Multi Path PERT Ankit Singh and A. L. Naasimha Reddy Electical and Compute Engineeing Depatment, Texas A&M Univesity; email: eddy@ece.tamu.edu. Abstact This pape pesents a new multipath delay based algoithm,

More information

Elliptic Generation Systems

Elliptic Generation Systems 4 Elliptic Geneation Systems Stefan P. Spekeijse 4.1 Intoduction 4.1 Intoduction 4.2 Two-Dimensional Gid Geneation Hamonic Maps, Gid Contol Maps, and Poisson Systems Discetization and Solution Method Constuction

More information

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using

More information

RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver

RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver 1 RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Dive Amit Jain Daji Qiao Kang G. Shin The Univesity of Michigan Ann Abo, MI 4819, USA {amitj,dqiao,kgshin@eecs.umich.edu Abstact The cuent

More information

A Minutiae-based Fingerprint Matching Algorithm Using Phase Correlation

A Minutiae-based Fingerprint Matching Algorithm Using Phase Correlation A Minutiae-based Fingepint Matching Algoithm Using Phase Coelation Autho Chen, Weiping, Gao, Yongsheng Published 2007 Confeence Title Digital Image Computing: Techniques and Applications DOI https://doi.og/10.1109/dicta.2007.4426801

More information

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,

More information

SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH

SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,

More information

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences Ameican Jounal of ata ining and Knowledge iscovey 27; 2(4): 2-8 http://www.sciencepublishinggoup.com//admkd doi:.648/.admkd.2724.2 Genealized Gey Taget ecision ethod Based on ecision akes Indiffeence Attibute

More information

Modeling a shared medium access node with QoS distinction

Modeling a shared medium access node with QoS distinction Modeling a shaed medium access node with QoS distinction Matthias Gies, Jonas Geutet Compute Engineeing and Netwoks Laboatoy (TIK) Swiss Fedeal Institute of Technology Züich CH-8092 Züich, Switzeland email:

More information

Secure Collaboration in Mediator-Free Environments

Secure Collaboration in Mediator-Free Environments Secue Collaboation in Mediato-Fee Envionments Mohamed Shehab School of Electical and Compute Engineeing Pudue Univesity West Lafayette, IN, USA shehab@pudueedu Elisa Betino Depatment of Compute Sciences

More information