• Cite Icon1
  • https://doi.org/10.1145/2714064.2660204Copy DOI Icon

Cybertron

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

I/O reduction has been a major focus in optimizing data-parallel programs for big-data processing. While the current state-of-the-art techniques use static program analysis to reduce I/O, Cybertron proposes a new direction that incorporates runtime mechanisms to push the limit further on I/O reduction. In particular, Cybertron tracks how data is used in the computation accurately at runtime to filter unused data at finer granularity dynamically, beyond what current static-analysis based mechanisms are capable of, and to facilitate a new mechanism called constraint based encoding for more efficient encoding. Cybertron has been implemented and applied to production data-parallel programs; our extensive evaluations on real programs and real data have shown its effectiveness on I/O reduction over the existing mechanisms at reasonable CPU cost, and its improvement on end-to-end performance in various network environments.

Similar Papers
  • Conference Article
  • Citations3

Cybertron

  • Oct 15, 2014
  • Tian Xiao +9
  • Research Article
  • Citations1

Tuning Task Granularity and Data Locality of Data Parallel GPH Programs

  • Dec 01, 2001
  • Parallel Processing Letters
  • H Loidl
  • Conference Article
  • Citations19

Zero Knowledge Static Program Analysis

  • Nov 12, 2021
  • Zhiyong Fang +3
  • Research Article

Towards a Unifying Framework for Tuning Analysis Precision by Program Transformation.

  • Dec 09, 2020
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Mila Dalla Preda
  • Conference Article
  • Citations6

On static timing analysis of GPU kernels

  • Jan 01, 2014
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Vesa Hirvisalo
  • Research Article
  • Citations24

An innovative eco-intensity based method for assessing extended supply chain environmental sustainability

  • Sep 07, 2018
  • International Journal of Production Economics
  • Andrea Tuni +1
  • Research Article
  • Citations18

Towards Efficient Large-Scale Interprocedural Program Static Analysis on Distributed Data-Parallel Computation

  • Apr 01, 2021
  • IEEE Transactions on Parallel and Distributed Systems
  • Rong Gu +7
  • Dissertation

Obtaining Real-World Benchmark Programs from Open-Source Repositories Through Abstract-Semantics Preserving Transformations

  • Jun 10, 2020
  • Maria Paquin
  • Research Article
  • Citations9

An Approach to Reachability Determination for Static Analysis Defects with the Help of Dynamic Symbolic Execution

  • Nov 01, 2018
  • Programming and Computer Software
  • A Yu Gerasimov +3
  • Research Article
  • Citations12

Sounding Node Set and Sounding Interval Determination for IEEE 802.11ac MU-MIMO

  • Dec 01, 2016
  • IEEE Transactions on Vehicular Technology
  • Junsu Choi +2
  • Research Article
  • Citations10

TUNING TASK GRANULARITY AND DATA LOCALITY OF DATA PARALLEL GPH PROGRAMS

  • Dec 01, 2001
  • Parallel Processing Letters
  • Hans-Wolfgang Loidl +2
  • Supplementary Content
  • Citations4

Scalable verification techniques for data-parallel programs

  • Sep 01, 2014
  • Spiral (Imperial College London)
  • Nathan Chong
  • Research Article

Assessing the Adequacy of Synthetic Programs for Learning SPF's Configurations

  • Dec 28, 2018
  • ACM SIGSOFT Software Engineering Notes
  • Maria Paquin +2
  • PDF
  • Book Chapter
  • Citations81

PhASAR: An Inter-procedural Static Analysis Framework for C/C++

  • Jan 01, 2019
  • Philipp Dominik Schubert +2
  • Conference Article
  • Citations39

On the recall of static call graph construction in practice

  • Jun 27, 2020
  • Li Sui +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.