Catello Di Martino
Catello Di Martino has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Aditya Ranjan
University of Illinois Urbana-Champaign, Urbana, USA
1 shared publication - Andrea Francini
Nokia Bell Labs
1 shared publication - Archit Patke
University of Illinois Urbana-Champaign, Urbana, USA
1 shared publication - Brett Bode
University of Illinois, Urbana, Il
1 shared publication - Bruce Cilli
Nokia Bell Labs, Murray Hill, NJ, USA
1 shared publication - Chandra Narayanaswami
IBM Research, Yorktown Heights, NY, USA
1 shared publication
Latest Publications
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1145-1164
Story of Two GPUs: Characterizing the Resilience of Hopper H100 and Ampere A100 GPUs
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1145-1164
Open AccessStory of Two GPUs: Characterizing the Resilience of Hopper H100 and Ampere A100 GPUs
- Open Access
- 4 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 2419-2424
Routing-Aware Shaping for Feasible Multi-Domain Determinism
Use cases for network determinism may involve the traversal of multiple network domains. A typical example is the edge-cloud virtualization of the controllers for industrial automation, where the end-to-end data path may include a private mobile network and a wired local-area network within the factory premises, a public transport network between the factory and the edge-cloud data center, and a switching fabric within the same data center. Maintaining deterministic guarantees throughout these domains, likely operated by different providers, is a daunting task when each domain relies on its own control and data-plane technologies for satisfaction of its allocated portion of the end-to-end requirements. We propose a universal model for determinism in wired packet networks that simplifies the realization of deterministic services over chains of network domains. The model builds on a novel traffic shaper where routing information constrains the packet scheduling decisions. The shaper, and therefore the provisioning of resources for every deterministic service, is only needed at the ingress edge of each wired domain. We conjecture perdomain latency bounds enforced by the shaper and corroborate them with experimental evidence. The bounds are easy to combine for multi-domain network paths.
- 4 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 2419-2424
Open AccessRouting-Aware Shaping for Feasible Multi-Domain Determinism
Use cases for network determinism may involve the traversal of multiple network domains. A typical example is the edge-cloud virtualization of the controllers for industrial automation, where the end-to-end data path may include a private mobile network and a wired local-area network within the factory premises, a public transport network between the factory and the edge-cloud data center, and a switching fabric within the same data center. Maintaining deterministic guarantees throughout these domains, likely operated by different providers, is a daunting task when each domain relies on its own control and data-plane technologies for satisfaction of its allocated portion of the end-to-end requirements. We propose a universal model for determinism in wired packet networks that simplifies the realization of deterministic services over chains of network domains. The model builds on a novel traffic shaper where routing information constrains the packet scheduling decisions. The shaper, and therefore the provisioning of resources for every deterministic service, is only needed at the ingress edge of each wired domain. We conjecture perdomain latency bounds enforced by the shaper and corroborate them with experimental evidence. The bounds are easy to combine for multi-domain network paths.