Interconnection Pattern Mapping
Interconnection Pattern Mapping is a systematic method that specifies how data paths are dynamically or statically configured in a multistage interconnection network to realize a desired pattern of communication between processing elements, distinguished by its formal representation of routing constraints and network topology characteristics.
7
Publications
302
Citations
16
Authors
9
Institutions
Publications per year
2017–2026
1
7
Efficient Schemes for Parallel Communication
Eli Upfal · Journal of the ACM · 1984 · 137 citations · Full text
TensorLib: A Spatial Accelerator Generation Framework for Tensor Algebra
Liancheng Jia, Zizhang Luo, Liqiang Lu et al. · 2021 · 47 citations
Efficient schemes for parallel communication
Nonrestoring binary division using a cellular array
J.C. Majithia · Electronics Letters · 1970 · 27 citations
1–5 of 7
16
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 16
9
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
180 citations
Binghamton University
Binghamton, United States
1 h-index
2 publications
44 citations

Shizuoka University
Shizuoka, Japan
1 h-index
4 publications
60 citations
Hamamatsu University
Hamamatsu, Japan
1 h-index
3 publications
45 citations

Peking University
Beijing, China
1 h-index
4 publications
188 citations
Semiconductor Energy Laboratory (Japan)
Atsugi, Japan
1 h-index
3 publications
33 citations
Peng Cheng Laboratory
Shenzhen, China
1 h-index
1 publications
47 citations

McMaster University
Hamilton, Canada
1 h-index
1 publications
27 citations
1–8 of 9
JACM · 1 publications · 137 citations
1
h-index
1 publications · 27 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 11 citations
1
h-index
TPDS · 1 publications · 22 citations
1
h-index
1–5