Interconnect Scheduling
Interconnect Scheduling is a computational method that determines the optimal temporal allocation and routing of data transmissions across shared communication resources in a multiprocessor or multicomputer system to minimize latency and contention.
35
Publications
1.5K
Citations
93
Authors
36
Institutions
Publications per year
2017–2026
2
Parents
35
Force-directed scheduling in automatic data path synthesis
Pierre Paulin, J.P. Knight · 1987 · 234 citations
Packet Switched vs. Time Multiplexed FPGA Overlay Networks
Nachiket Kapre, Nikil Mehta, Michael deLorimier et al. · 2006 · 143 citations
Efficient Schemes for Parallel Communication
Eli Upfal · Journal of the ACM · 1984 · 137 citations · Full text
Designing a Crossbar Scheduler for HPC Applications
Cyriel Minkenberg, François Abel, Péter Müller et al. · IEEE Micro · 2006 · 73 citations
Engineering, Computer Engineering, High-performance Computing +17
1–5 of 35
93
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 93
36
State University of New York
Albany, United States
5 h-index
10 publications
298 citations
Stony Brook University
Stony Brook, United States
5 h-index
10 publications
298 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
6 publications
176 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
2 h-index
5 publications
62 citations
University of Pittsburgh
Pittsburgh, United States
2 h-index
4 publications
64 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
180 citations
Case Western Reserve University
Cleveland, United States
2 h-index
2 publications
103 citations
Concurrent Technologies Corporation
Johnstown, United States
2 h-index
2 publications
32 citations
1–8 of 36
TPDS · 3 publications · 91 citations
3
h-index
2 publications · 34 citations
2
h-index
JON · 1 publications · 13 citations
1
h-index
JACM · 1 publications · 137 citations
1
h-index
1 publications · 63 citations
1
h-index
1–5