toward unifying communication computation storage in
play

Toward Unifying Communication-Computation-Storage in Parallel Data - PowerPoint PPT Presentation

Toward Unifying Communication-Computation-Storage in Parallel Data Systems Xiaotian Tim Yin, Tim Tingqiu Yuan, Jian Li Scope: Full Coverage across Data Life Cycle Mass data Addressing IP interconnection processing technology


  1. Toward Unifying Communication-Computation-Storage in Parallel Data Systems Xiaotian Tim Yin, Tim Tingqiu Yuan, Jian Li

  2. Scope: Full Coverage across Data Life Cycle Mass data • Addressing IP interconnection processing technology • Processor Information • Storage intelligence Network • Future network • Parallel computing architecture • SDN • social networks • Distributed database • Large data analysis • Many-core OS • PLC All-optical • Natural language • Cognitive All optical exchange • Data visualization • Acoustics transmission computing Man-Man • Silicon optical • AI • image processing Wired • Cloud Security Safety Man-Machine ODSP • Robot • Media network access • Cryptography • Cellular system • Quantum Machine- Energy • Intelligent driving • Media storage • WIFI • RF antenna • Energy storage fuel Machine Microwave • Intelligent • AR/VR wireless • Antenna • Smart • New battery transmission Transportation access technology • Power transformation antenna • Health care • Radiofrequency • V/E BAND • Energy control Data Data Data Data Computation Generation Transmission Storage & Applications

  3. Challenge: Theoretical framework to the never-ending quest for higher performance? Ref: Qifa Yan, Sheng Yang, and Michele Wigger, Sept. 2019

  4. From Systematic Tradeoffs to Theoretical Unification Monotonic surface (top) vs Communication-Computation-Storage (CCS) Multi-Party Tradeoff Framework convex surface (bottom) Tradeoff Framework  Problem Model : The same as CCS framework.  Tradeoff Space : Similar to CCS framework,  Problem Model : Define the class of problems under except for having K (K>1) dimensions instead of study, in terms of major components, common pipelines, 3 dimensions: basic operations, etc. 𝑌 (�) -Axis, 𝑌 (�) -Axis, …, 𝑌 (�) -Axis, o  Tradeoff Space : A 3-dimensional space consisting of  Tradeoff Algorithms : The same as CCS the following axis, where each axis represent one factor framework.  Tradeoff Optimality : Similar to CCS for tradeoff and a quantitative measurement of cost: framework, except for the Optimal Tradeoff L-Axis: Communication Cost o Hyper-surface instead of Optimal Tradeoff C-Axis: Computation Cost o surface. R-Axis: Storage Cost o The feasible region refers to the subspace of the whole Definition-1 (Monotonic Hyper-Surface): Given a (k- tradeoff space, where points are achievable by certain monotonic surface. 1)-dimensional hyper-surface  embedded in a k- dimensional space  (k>2),  is monotonic if one of tradeoff algorithms. the following conditions holds: (1) k=2 and the curve  Tradeoff Algorithms : Each tradeoff algorithm is a  is either non-increasing or non-decreasing in any dimension; or (2) k>2 and fixing any dimension at an refinement of the abstract problem model, implementing arbitrary valid value, the resulting (k-2)-dimensional the common pipeline with algorithm-specific details. hyper-surface is monotonic. Each tradeoff algorithm, with each parameter fixed, gives a point in the tradeoff space, whose coordinates are Theorem-1 : For any multi-party tradeoff the cost of that algorithm along each dimension. framework, the joint optimal hyper-surface exists if  Tradeoff Optimality : Results about optimality of one of the individual optimal hyper-surface exists and tradeoff algorithms, in particular the boundary of the is monotonic. feasible region, called the Optimal Tradeoff Surface , which represents what the best tradeoff algorithm can Theorem-2: Super Optimal Tradeoff is achievable iff convex surface. achieve. the coordinate origin is within the feasible region .

  5. Exists Fundamental Theory of Unified interpretation for Communication, Computation and Storage Claim-1: Super Optimal Tradeoff is not achievable in most cases (but works with MR, PS, DHT caching, etc) Theorem-2: Super Optimal Tradeoff is Foliation in 2D (left) and 3D (right) tradeoff space. achievable if and only if the coordinate origin is within the feasible region. Conjecture-1: There exists a fundamental theory that provides a unified interpretation for Communication, Computation and Storage general surface. Super optimal tradeoff outside of the feasible region.

  6. Thanks!

Recommend


More recommend