Marcel Schneider

dblp:27/3441 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 52% Interconnection networks and networks-on-chip · 48%
Computer networks
2 papers
Routing and switching · 85% Datacenter networks · 15%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
routing
0.922021
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks · IEEE Trans. Parallel Distributed Syst. 2021
FatPaths: routing in supercomputers and data centers when shortest paths fall short · SC 2020
Interconnection networks and networks-on-chip › network topology
low-diameter topology
0.512021
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks · IEEE Trans. Parallel Distributed Syst. 2021
Electronic design automation › physical design › routing
multipath routing
0.512021
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks · IEEE Trans. Parallel Distributed Syst. 2021
Interconnection networks and networks-on-chip
network topology
0.512021
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks · IEEE Trans. Parallel Distributed Syst. 2021
Routing and switching
multipath routing
0.412020
FatPaths: routing in supercomputers and data centers when shortest paths fall short · SC 2020
Routing and switching
routing
0.412020
FatPaths: routing in supercomputers and data centers when shortest paths fall short · SC 2020
Interconnection networks and networks-on-chip › cluster interconnect
infiniband
0.112021
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks · IEEE Trans. Parallel Distributed Syst. 2021
Interconnection networks and networks-on-chip › high-speed networks
supercomputer interconnect
0.112021
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks · IEEE Trans. Parallel Distributed Syst. 2021

Methods — techniques the papers use, named apart from their topics

taxonomy · 1.0path diversity analysis · 1.0transport layer redesign · 0.9flowlet switching · 0.9
YearPublicationVenuePosition
2026 EvalNet: A Practical Toolchain for Generation and Analysis of Extreme-Scale Interconnects
Maciej Besta, Patrick Iff, Marcel Schneider, Nils Blach, Alessandro Maissen, Salvatore Di Girolamo, Jens Domke, Jascha Krattenmacher, Kartik Lakhotia, Laura Monroe, Fabrizio Petrini, Robert Gerstenberger, Torsten Hoefler
IPDPS3
2021 High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks
abstract
The recent line of research into topology design focuses on lowering network diameter. Many low-diameter topologies such as Slim Fly or Jellyfish that substantially reduce cost, power consumption, and latency have been proposed. A key challenge in realizing the benefits of these topologies is routing. On one hand, these networks provide shorter path lengths than established topologies such as Clos or torus, leading to performance improvements. On the other hand, the number of shortest paths between each pair of endpoints is much smaller than in Clos, but there is a large number of non-minimal paths between router pairs. This hampers or even makes it impossible to use established multipath routing schemes such as ECMP. In this article, to facilitate high-performance routing in modern networks, we analyze existing routing protocols and architectures, focusing on how well they exploit the diversity of minimal and non-minimal paths. We first develop a taxonomy of different forms of support for multipathing and overall path diversity. Then, we analyze how existing routing schemes support this diversity. Among others, we consider multipathing with both shortest and non-shortest paths, support for disjoint paths, or enabling adaptivity. To address the ongoing convergence of HPC and “Big Data” domains, we consider routing protocols developed for both HPC systems and for data centers as well as general clusters. Thus, we cover architectures and protocols based on Ethernet, InfiniBand, and other HPC networks such as Myrinet. Our review will foster developing future high-performance multipathing routing protocols in supercomputers and data centers.
Maciej Besta, Jens Domke, Marcel Schneider, Marek Konieczny, Salvatore Di Girolamo, Timo Schneider, Ankit Singla, Torsten Hoefler
IEEE Trans. Parallel Distributed Syst.3
2020 FatPaths: routing in supercomputers and data centers when shortest paths fall short
abstract
We introduce FatPaths: a simple, generic, and robust routing architecture that enables state-of-the-art low-diameter topologies such as Slim Fly to achieve unprecedented performance. FatPaths targets Ethernet stacks in both HPC supercomputers as well as cloud data centers and clusters. FatPaths exposes and exploits the rich (“fat”) diversity of both minimal and non-minimal paths for high-performance multi-pathing. Moreover, FatPaths uses a redesigned “purified” transport layer that removes virtually all TCP performance issues (e.g., the slow start), and incorporates flowlet switching, a technique used to prevent packet reordering in TCP networks, to enable very simple and effective load balancing. Our design enables recent low-diameter topologies to outperform powerful Clos designs, achieving 15% higher net throughput at 2” lower latency for comparable cost. FatPaths will significantly accelerate Ethernet clusters that form more than 50% of the Top500 list and it may become a standard routing scheme for modern topologies.Extended paper version: https://arxiv.org/abs/1906.10885
Maciej Besta, Marcel Schneider, Marek Konieczny, Karolina Cynk, Erik Henriksson, Salvatore Di Girolamo, Ankit Singla, Torsten Hoefler
SC2