A low‐latency memory‐cube network with dual diagonal mesh topology and bypassed pipelines

Summary A memory cube network is an interconnection network composed of 3D stacked memories called memory cubes. By exploiting a packet switching, it can provide fast memory accesses to a large number of memory cubes. Although interconnection networks have been studied in many years for supercomputers and data centers, existing technologies are difficult to apply to memory cube networks. This is because the link length and the number of ports are limited, and hence the hop count increases. In this article, we propose a dual diagonal mesh (DDM), a layout‐oriented memory‐cube network. Furthermore, we propose the routing algorithm and the router architecture with bypassed pipelines for DDM. Our experimental results demonstrate that our routing and router architecture with bypassed pipelines reduces the memory access latency. We implement four router architectures and evaluate them with the traffic patterns derived from the NAS parallel benchmark.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2024-09-23
DOI
https://doi.org/10.1002/cpe.8290
Citations
1
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A low‐latency memory‐cube network with dual diagonal mesh topology and bypassed pipelines

Ryota Yasudo, Kai Keida, Masashi Oda
1 citations
Concurrency and Computation Practice and Experience
Interconnection Networks and Systems
0.35
article

A low‐latency memory‐cube network with dual diagonal mesh topology and bypassed pipelines

Ryota Yasudo, Kai Keida, Masashi Oda
article en
1 citations

Abstract

Summary A memory cube network is an interconnection network composed of 3D stacked memories called memory cubes. By exploiting a packet switching, it can provide fast memory accesses to a large number of memory cubes. Although interconnection networks have been studied in many years for supercomputers and data centers, existing technologies are difficult to apply to memory cube networks. This is because the link length and the number of ports are limited, and hence the hop count increases. In this article, we propose a dual diagonal mesh (DDM), a layout‐oriented memory‐cube network. Furthermore, we propose the routing algorithm and the router architecture with bypassed pipelines for DDM. Our experimental results demonstrate that our routing and router architecture with bypassed pipelines reduces the memory access latency. We implement four router architectures and evaluate them with the traffic patterns derived from the NAS parallel benchmark.

Concurrency and Computation Practice and ExperienceVol. 36(28)
Kyoto University (JP), Kyoto College of Graduate Studies for Informatics (JP)
Japan Society for the Promotion of Science
Openalex Percentile: Top 39%
Interconnection Networks and Systems
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.