High-Bandwidth Low-Latency Approximate Interconnection Networks

Daichi Fujiki, Kiyo Ishii, Ikki Fujiwara, Hiroki Matsutani, Hideharu Amano, Henri Casanova, Michihiro Koibuchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Computational applications are subject to various kinds of numerical errors, ranging from deterministic round-off errors to soft errors caused by non-deterministic bit flips, which do not lead to application failure but corrupt application results. Non-deterministic bit flips are typically mitigated in hardware using various error correcting codes (ECC). But in practice, due to performance and cost concerns, these techniques do not guarantee error-free execution. On large-scale computing platforms, soft errors occur with non-negligible probability in RAM and on the CPU, and it has become clear that applications must tolerate them. For some applications, this tolerance is intrinsic as result quality can remain acceptable even in the presence of soft errors (e.g., data analysis applications, multimedia applications). Tolerance can also be built into the application, resolving data corruptions in software during application execution. By contrast, today's optical networks hold on to a rigid error-free standard, which imposes limits on network performance scalability. In this work we propose high-bandwidth, low-latency approximate networks with the following three features:(1) Optical links that exploit multi-level quadrature amplitude modulation (QAM) for achieving high bandwidth, (2) Avoidance of forward error correction (FEC), which makes optical link error-prone but affords lower latency, and(3) The use of symbol mapping coding between bit sequence and QAM to ensure data integrity that is sufficient for practical soft-error-tolerant applications. Discrete-event simulation results for application benchmarks show that approx networks achieve speedups up to 2.94 when compared to conventional networks.

Original languageEnglish
Title of host publicationProceedings - 2017 IEEE 23rd Symposium on High Performance Computer Architecture, HPCA 2017
PublisherIEEE Computer Society
Pages469-480
Number of pages12
ISBN (Electronic)9781509049851
DOIs
Publication statusPublished - 2017 May 5
Event23rd IEEE Symposium on High Performance Computer Architecture, HPCA 2017 - Austin, United States
Duration: 2017 Feb 42017 Feb 8

Other

Other23rd IEEE Symposium on High Performance Computer Architecture, HPCA 2017
CountryUnited States
CityAustin
Period17/2/417/2/8

Fingerprint

Bandwidth
Optical links
Quadrature amplitude modulation
Forward error correction
Discrete event simulation
Random access storage
Network performance
Fiber optic networks
Application programs
Program processors
Scalability
Hardware
Costs

Keywords

  • Approximate computing
  • Interconnect and network interface architectures

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Fujiki, D., Ishii, K., Fujiwara, I., Matsutani, H., Amano, H., Casanova, H., & Koibuchi, M. (2017). High-Bandwidth Low-Latency Approximate Interconnection Networks. In Proceedings - 2017 IEEE 23rd Symposium on High Performance Computer Architecture, HPCA 2017 (pp. 469-480). [7920848] IEEE Computer Society. https://doi.org/10.1109/HPCA.2017.38

High-Bandwidth Low-Latency Approximate Interconnection Networks. / Fujiki, Daichi; Ishii, Kiyo; Fujiwara, Ikki; Matsutani, Hiroki; Amano, Hideharu; Casanova, Henri; Koibuchi, Michihiro.

Proceedings - 2017 IEEE 23rd Symposium on High Performance Computer Architecture, HPCA 2017. IEEE Computer Society, 2017. p. 469-480 7920848.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fujiki, D, Ishii, K, Fujiwara, I, Matsutani, H, Amano, H, Casanova, H & Koibuchi, M 2017, High-Bandwidth Low-Latency Approximate Interconnection Networks. in Proceedings - 2017 IEEE 23rd Symposium on High Performance Computer Architecture, HPCA 2017., 7920848, IEEE Computer Society, pp. 469-480, 23rd IEEE Symposium on High Performance Computer Architecture, HPCA 2017, Austin, United States, 17/2/4. https://doi.org/10.1109/HPCA.2017.38
Fujiki D, Ishii K, Fujiwara I, Matsutani H, Amano H, Casanova H et al. High-Bandwidth Low-Latency Approximate Interconnection Networks. In Proceedings - 2017 IEEE 23rd Symposium on High Performance Computer Architecture, HPCA 2017. IEEE Computer Society. 2017. p. 469-480. 7920848 https://doi.org/10.1109/HPCA.2017.38
Fujiki, Daichi ; Ishii, Kiyo ; Fujiwara, Ikki ; Matsutani, Hiroki ; Amano, Hideharu ; Casanova, Henri ; Koibuchi, Michihiro. / High-Bandwidth Low-Latency Approximate Interconnection Networks. Proceedings - 2017 IEEE 23rd Symposium on High Performance Computer Architecture, HPCA 2017. IEEE Computer Society, 2017. pp. 469-480
@inproceedings{042af4e6c82c4ca794730ffbd13327a9,
title = "High-Bandwidth Low-Latency Approximate Interconnection Networks",
abstract = "Computational applications are subject to various kinds of numerical errors, ranging from deterministic round-off errors to soft errors caused by non-deterministic bit flips, which do not lead to application failure but corrupt application results. Non-deterministic bit flips are typically mitigated in hardware using various error correcting codes (ECC). But in practice, due to performance and cost concerns, these techniques do not guarantee error-free execution. On large-scale computing platforms, soft errors occur with non-negligible probability in RAM and on the CPU, and it has become clear that applications must tolerate them. For some applications, this tolerance is intrinsic as result quality can remain acceptable even in the presence of soft errors (e.g., data analysis applications, multimedia applications). Tolerance can also be built into the application, resolving data corruptions in software during application execution. By contrast, today's optical networks hold on to a rigid error-free standard, which imposes limits on network performance scalability. In this work we propose high-bandwidth, low-latency approximate networks with the following three features:(1) Optical links that exploit multi-level quadrature amplitude modulation (QAM) for achieving high bandwidth, (2) Avoidance of forward error correction (FEC), which makes optical link error-prone but affords lower latency, and(3) The use of symbol mapping coding between bit sequence and QAM to ensure data integrity that is sufficient for practical soft-error-tolerant applications. Discrete-event simulation results for application benchmarks show that approx networks achieve speedups up to 2.94 when compared to conventional networks.",
keywords = "Approximate computing, Interconnect and network interface architectures",
author = "Daichi Fujiki and Kiyo Ishii and Ikki Fujiwara and Hiroki Matsutani and Hideharu Amano and Henri Casanova and Michihiro Koibuchi",
year = "2017",
month = "5",
day = "5",
doi = "10.1109/HPCA.2017.38",
language = "English",
pages = "469--480",
booktitle = "Proceedings - 2017 IEEE 23rd Symposium on High Performance Computer Architecture, HPCA 2017",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - High-Bandwidth Low-Latency Approximate Interconnection Networks

AU - Fujiki, Daichi

AU - Ishii, Kiyo

AU - Fujiwara, Ikki

AU - Matsutani, Hiroki

AU - Amano, Hideharu

AU - Casanova, Henri

AU - Koibuchi, Michihiro

PY - 2017/5/5

Y1 - 2017/5/5

N2 - Computational applications are subject to various kinds of numerical errors, ranging from deterministic round-off errors to soft errors caused by non-deterministic bit flips, which do not lead to application failure but corrupt application results. Non-deterministic bit flips are typically mitigated in hardware using various error correcting codes (ECC). But in practice, due to performance and cost concerns, these techniques do not guarantee error-free execution. On large-scale computing platforms, soft errors occur with non-negligible probability in RAM and on the CPU, and it has become clear that applications must tolerate them. For some applications, this tolerance is intrinsic as result quality can remain acceptable even in the presence of soft errors (e.g., data analysis applications, multimedia applications). Tolerance can also be built into the application, resolving data corruptions in software during application execution. By contrast, today's optical networks hold on to a rigid error-free standard, which imposes limits on network performance scalability. In this work we propose high-bandwidth, low-latency approximate networks with the following three features:(1) Optical links that exploit multi-level quadrature amplitude modulation (QAM) for achieving high bandwidth, (2) Avoidance of forward error correction (FEC), which makes optical link error-prone but affords lower latency, and(3) The use of symbol mapping coding between bit sequence and QAM to ensure data integrity that is sufficient for practical soft-error-tolerant applications. Discrete-event simulation results for application benchmarks show that approx networks achieve speedups up to 2.94 when compared to conventional networks.

AB - Computational applications are subject to various kinds of numerical errors, ranging from deterministic round-off errors to soft errors caused by non-deterministic bit flips, which do not lead to application failure but corrupt application results. Non-deterministic bit flips are typically mitigated in hardware using various error correcting codes (ECC). But in practice, due to performance and cost concerns, these techniques do not guarantee error-free execution. On large-scale computing platforms, soft errors occur with non-negligible probability in RAM and on the CPU, and it has become clear that applications must tolerate them. For some applications, this tolerance is intrinsic as result quality can remain acceptable even in the presence of soft errors (e.g., data analysis applications, multimedia applications). Tolerance can also be built into the application, resolving data corruptions in software during application execution. By contrast, today's optical networks hold on to a rigid error-free standard, which imposes limits on network performance scalability. In this work we propose high-bandwidth, low-latency approximate networks with the following three features:(1) Optical links that exploit multi-level quadrature amplitude modulation (QAM) for achieving high bandwidth, (2) Avoidance of forward error correction (FEC), which makes optical link error-prone but affords lower latency, and(3) The use of symbol mapping coding between bit sequence and QAM to ensure data integrity that is sufficient for practical soft-error-tolerant applications. Discrete-event simulation results for application benchmarks show that approx networks achieve speedups up to 2.94 when compared to conventional networks.

KW - Approximate computing

KW - Interconnect and network interface architectures

UR - http://www.scopus.com/inward/record.url?scp=85019605853&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85019605853&partnerID=8YFLogxK

U2 - 10.1109/HPCA.2017.38

DO - 10.1109/HPCA.2017.38

M3 - Conference contribution

AN - SCOPUS:85019605853

SP - 469

EP - 480

BT - Proceedings - 2017 IEEE 23rd Symposium on High Performance Computer Architecture, HPCA 2017

PB - IEEE Computer Society

ER -