The Experts below are selected from a list of 8673 Experts worldwide ranked by ideXlab platform
Viveck R Cadambe - One of the best experts on this subject based on the ideXlab platform.
-
multi version coding an information Theoretic perspective of consistent distributed storage
IEEE Transactions on Information Theory, 2018Co-Authors: Zhiying Wang, Viveck R CadambeAbstract:In applications of distributed storage systems to distributed computing and implementation of key-value stores, the following property, usually referred to as consistency in distributed computing, is an important requirement: as the data stored changes, the latest version of the data must be accessible to a client that connects to the storage system. Motivated by technological trends where key-value stores are increasingly implemented in high-speed memory, an information Theoretic Formulation called multi-version coding is introduced in this paper in order to understand and minimize the memory overhead of consistent distributed storage. Multi-version coding is characterized by $\nu$ totally ordered versions of a message and a storage system with $n$ servers. At each server, values corresponding to an arbitrary subset of the $\nu$ versions are received and encoded. For any subset of $c$ servers in the storage system, the value corresponding to the latest common version or a later version, as per the total ordering, among the $c$ servers is required to be decodable. An achievable multi-version code construction via linear coding and a converse result that shows that the construction is asymptotically tight when $\nu |(c-1)$ are provided. An implication of the converse is that there is an inevitable price, in terms of storage cost, to ensure consistency in distributed storage systems.
-
multi version coding in distributed storage
2015Co-Authors: Zhiying Wang, Viveck R CadambeAbstract:In applications of distributed storage systems to distributed computing and implementation of key- value stores, the following property, usually referred to as consistency in computer science and engineering, is an important requirement: as the data stored changes, the latest version of the data must be accessible to a client that connects to the storage system. An information Theoretic Formulation called multi-version coding is introduced in the paper, in order to study storage costs of consistent distributed storage systems. Multi-version coding is characterized by {\nu} totally ordered versions of a message, and a storage system with n servers. At each server, values corresponding to an arbitrary subset of the {\nu} versions are received and encoded. For any subset of c servers in the storage system, the value corresponding to the latest common version, or a later version as per the total ordering, among the c servers is required to be decodable. An achievable multi-version code construction via linear coding and a converse result that shows that the construction is approximately tight, are provided. An implication of the converse is that there is an inevitable price, in terms of storage cost, to ensure consistency in distributed storage systems.
-
multi version coding an information Theoretic perspective of consistent distributed storage
arXiv: Information Theory, 2015Co-Authors: Zhiying Wang, Viveck R CadambeAbstract:In applications of distributed storage systems to distributed computing and implementation of key- value stores, the following property, usually referred to as consistency in computer science and engineering, is an important requirement: as the data stored changes, the latest version of the data must be accessible to a client that connects to the storage system. An information Theoretic Formulation called multi-version coding is introduced in the paper, in order to study storage costs of consistent distributed storage systems. Multi-version coding is characterized by {\nu} totally ordered versions of a message, and a storage system with n servers. At each server, values corresponding to an arbitrary subset of the {\nu} versions are received and encoded. For any subset of c servers in the storage system, the value corresponding to the latest common version, or a later version as per the total ordering, among the c servers is required to be decodable. An achievable multi-version code construction via linear coding and a converse result that shows that the construction is approximately tight, are provided. An implication of the converse is that there is an inevitable price, in terms of storage cost, to ensure consistency in distributed storage systems.
Zhiying Wang - One of the best experts on this subject based on the ideXlab platform.
-
multi version coding an information Theoretic perspective of consistent distributed storage
IEEE Transactions on Information Theory, 2018Co-Authors: Zhiying Wang, Viveck R CadambeAbstract:In applications of distributed storage systems to distributed computing and implementation of key-value stores, the following property, usually referred to as consistency in distributed computing, is an important requirement: as the data stored changes, the latest version of the data must be accessible to a client that connects to the storage system. Motivated by technological trends where key-value stores are increasingly implemented in high-speed memory, an information Theoretic Formulation called multi-version coding is introduced in this paper in order to understand and minimize the memory overhead of consistent distributed storage. Multi-version coding is characterized by $\nu$ totally ordered versions of a message and a storage system with $n$ servers. At each server, values corresponding to an arbitrary subset of the $\nu$ versions are received and encoded. For any subset of $c$ servers in the storage system, the value corresponding to the latest common version or a later version, as per the total ordering, among the $c$ servers is required to be decodable. An achievable multi-version code construction via linear coding and a converse result that shows that the construction is asymptotically tight when $\nu |(c-1)$ are provided. An implication of the converse is that there is an inevitable price, in terms of storage cost, to ensure consistency in distributed storage systems.
-
multi version coding in distributed storage
2015Co-Authors: Zhiying Wang, Viveck R CadambeAbstract:In applications of distributed storage systems to distributed computing and implementation of key- value stores, the following property, usually referred to as consistency in computer science and engineering, is an important requirement: as the data stored changes, the latest version of the data must be accessible to a client that connects to the storage system. An information Theoretic Formulation called multi-version coding is introduced in the paper, in order to study storage costs of consistent distributed storage systems. Multi-version coding is characterized by {\nu} totally ordered versions of a message, and a storage system with n servers. At each server, values corresponding to an arbitrary subset of the {\nu} versions are received and encoded. For any subset of c servers in the storage system, the value corresponding to the latest common version, or a later version as per the total ordering, among the c servers is required to be decodable. An achievable multi-version code construction via linear coding and a converse result that shows that the construction is approximately tight, are provided. An implication of the converse is that there is an inevitable price, in terms of storage cost, to ensure consistency in distributed storage systems.
-
multi version coding an information Theoretic perspective of consistent distributed storage
arXiv: Information Theory, 2015Co-Authors: Zhiying Wang, Viveck R CadambeAbstract:In applications of distributed storage systems to distributed computing and implementation of key- value stores, the following property, usually referred to as consistency in computer science and engineering, is an important requirement: as the data stored changes, the latest version of the data must be accessible to a client that connects to the storage system. An information Theoretic Formulation called multi-version coding is introduced in the paper, in order to study storage costs of consistent distributed storage systems. Multi-version coding is characterized by {\nu} totally ordered versions of a message, and a storage system with n servers. At each server, values corresponding to an arbitrary subset of the {\nu} versions are received and encoded. For any subset of c servers in the storage system, the value corresponding to the latest common version, or a later version as per the total ordering, among the c servers is required to be decodable. An achievable multi-version code construction via linear coding and a converse result that shows that the construction is approximately tight, are provided. An implication of the converse is that there is an inevitable price, in terms of storage cost, to ensure consistency in distributed storage systems.
Itzhak Bars - One of the best experts on this subject based on the ideXlab platform.
-
u 1 1 noncommutative gauge theory as the foundation of two time physics in field theory
Physical Review D, 2001Co-Authors: Itzhak BarsAbstract:A very simple field theory in noncommutative phase space X^{M},P^{M} in d+2 dimensions, with a gauge symmetry based on noncommutative u*(1,1), furnishes the foundation for the field Theoretic Formulation of Two-Time Physics. This leads to a remarkable unification of several gauge principles in d dimensions, including Maxwell, Einstein and high spin gauge principles, packaged together into one of the simplest fundamental gauge symmetries in noncommutative quantum phase space in d+2 dimensions. A gauge invariant action is constructed and its nonlinear equations of motion are analyzed. Besides elegantly reproducing the first quantized worldline theory with all background fields, the field theory prescribes unique interactions among the gauge fields. A matrix version of the theory, with a large N limit, is also outlined
David Tse - One of the best experts on this subject based on the ideXlab platform.
-
information theory meets game theory on the interference channel
Information Theory Workshop, 2009Co-Authors: Randall A Berry, David TseAbstract:We consider a game Theoretic model for two users communicating over an interference channel, in which each user can autonomously select its encoding and decoding strategy with the objective of maximizing its own rate. We give an information Theoretic Formulation for this game, which enables us to define a Nash equilibrium region that is a natural extension of the information Theoretic capacity region of this channel. In previous work, we completely characterized this Nash equilibrium region for a deterministic interference channel model. Here, we show that certain properties of this analysis extend to a Gaussian channel model. In particular, we show that for a symmetric channel, the symmetric sum-rate point is always achieved as an approximate equilibrium.
J W Burdick - One of the best experts on this subject based on the ideXlab platform.
-
multi agent probabilistic search in a sequential decision Theoretic framework
International Conference on Robotics and Automation, 2008Co-Authors: Timothy H Chung, J W BurdickAbstract:Consider the task of searching a region for the presence or absence of a target using a team of multiple searchers. This paper formulates this search problem as a sequential probabilistic decision, which enables analysis and design of efficient and robust search control strategies. Imperfect detections of the target's possible locations are made by each search agent and shared with teammates. This information is used to update the evolving decision variable which represents the belief that the target is present in the region. The sequential decision-Theoretic Formulation presented in this paper provides an analytic framework to evaluate team search systems, as it includes a performance metric (time until decision), a measure of uncertainty (decision confidence thresholds) and imperfect information gathering (detection error). Strategies for cooperative search are evaluated in this context, and comparisons between homogeneous and hybrid search strategies are investigated in numerical studies.
