# Exploiting Network Loss for Distributed Approximate Computing with   NetApprox

**Authors:** Ke Liu, Jinmou Li, Shin-Yeh Tsai, Theophilus Benson, Yiying Zhang

arXiv: 1901.01632 · 2022-07-01

## TL;DR

NetApprox introduces an approximate-aware network layer that leverages the tolerance of approximate applications to loss, significantly improving job completion times and co-running workload performance in data center environments.

## Contribution

It is the first to design an approximate-aware network layer integrating transport protocols, resource allocation, and scheduling policies for data center applications.

## Key findings

- Up to 80% faster job completion times.
- 79% improvement in non-approximate workload performance.
- Effective in both simulation and real-world deployment.

## Abstract

Many data center applications such as machine learning and big data analytics can complete their analysis without processing the complete set of data. While extensive approximate-aware optimizations have been proposed at hardware, programming language, and application levels. However, to date, the approximate computing optimizations have ignored the network layer.   We propose NetApprox, which to the best of our knowledge, is the first approximate-aware network layer comprising transport-layer protocol, network resource allocation schemes, and scheduling/priority-assignment policies. Building on the observation that approximate applications can tolerate loss, NetApprox's main insights are to aggressively send approximate traffic (which improves the performance of approximate applications) and to minimize the network resources allocated to approximate traffic (which simultaneously limits the impact of aggressive approximate traffic while freeing up resources that, in turn, improve non-approximate applications' performance). We ported Flink, Kafka, Spark, and PyTorch to NetApprox and evaluated NetApprox with both large-scale simulation and real implementation. Our evaluation results show that NetApprox improves job completion times by up to 80% compared to network-oblivious approximation solutions, and improves the performance of co-running non-approximate workloads by 79%.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1901.01632/full.md

## Figures

23 figures with captions in the complete paper: https://tomesphere.com/paper/1901.01632/full.md

## References

66 references — full list in the complete paper: https://tomesphere.com/paper/1901.01632/full.md

---
Source: https://tomesphere.com/paper/1901.01632