AI Chat AI Image Generator AI Video Text to Speech

An Online Matching Model for Self-Adjusting ToR-to-ToR Networks

06/19/2020

∙

by Chen Avin, et al.

∙

∙

This is a short note that formally presents the matching model for the theoretical study of self-adjusting networks as initially proposed in [1].

Chen Avin
16 publications
Chen Griner
4 publications
Iosif Salem
10 publications
Stefan Schmid
88 publications

page 1

page 2

page 3

research

∙ 12/26/2020

A second-order self-adjusting steepness based remapping method for arbitrary quadrilateral meshes

In this paper, based on the idea of self-adjusting steepness based schem...

0 Zhiwei He, et al. ∙

research

∙ 04/05/2019

ReNets: Toward Statically Optimal Self-Adjusting Networks

This paper studies the design of self-adjusting networks whose topology ...

0 Chen Avin, et al. ∙

research

∙ 07/08/2022

Self-Adjusting Linear Networks with Ladder Demand Graph

This paper revisits the problem of designing online algorithms for self-...

0 Anton Paramonov, et al. ∙

research

∙ 05/14/2021

Efficient Parallel Self-Adjusting Computation

Self-adjusting computation is an approach for automatically producing dy...

0 Daniel Anderson, et al. ∙

research

∙ 11/17/2021

A Note on Simulation-Based Inference by Matching Random Features

We can, and should, do statistical inference on simulation models by adj...

0 Cosma Rohilla Shalizi, et al. ∙

research

∙ 02/25/2023

Toward Self-Adjusting k-ary Search Tree Networks

Datacenter networks are becoming increasingly flexible with the incorpor...

0 Evgenii Feder, et al. ∙

research

∙ 08/10/2021

A Tight Analysis of Slim Heaps and Smooth Heaps

The smooth heap and the closely related slim heap are recently invented ...

0 Corwin Sinnamon, et al. ∙