English
Related papers

Related papers: HyLine: a Simple and Practical Flow Scheduling for…

200 papers

This study addresses the urban transit pattern design problem, optimizing stop sequences, headways, and fleet sizes across multiple routes and periods simultaneously to minimize user costs (composed of riding, waiting, and transfer times)…

Systems and Control · Electrical Eng. & Systems 2026-02-10 Max T. M. Ng , Draco Tong , Hani S. Mahmassani , Omer Verbas , Taner Cokyasar

Coflow is a prominent network abstraction for modeling communication patterns in data centers. Since coflow scheduling in large-scale data centers is $\mathcal{NP}$-hard, this paper investigates this problem within heterogeneous parallel…

Data Structures and Algorithms · Computer Science 2026-05-26 Chi-Yeh Chen

Traffic load-balancing in datacenters alleviates hot spots and improves network utilization. In this paper, a stable in-network load-balancing algorithm is developed in the setting of software-defined networking. A control plane configures…

Networking and Internet Architecture · Computer Science 2016-12-07 Sucha Supittayapornpong , Michael J. Neely

Big data processing applications are becoming more and more complex. They are no more monolithic in nature but instead they are composed of decoupled analytical processes in the form of a workflow. One type of such workflow applications is…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-12-19 Mutaz Barika , Saurabh Garg , Andrew Chan , Rodrigo N. Calheiros

Key-based workload partitioning is a common strategy used in parallel stream processing engines, enabling effective key-value tuple distribution over worker threads in a logical operator. While randomized hashing on the keys is capable of…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-12-14 Junhua Fang , Rong Zhang , Tom Z. J. Fu , Zhenjie Zhang , Aoying Zhou , Junhua Zhu

With the rise of Software Defined Networks (SDN), there is growing interest in dynamic and centralized traffic engineering, where decisions about forwarding paths are taken dynamically from a network-wide perspective. Frequent path…

Networking and Internet Architecture · Computer Science 2016-10-11 Tal Mizrahi , Yoram Moses

New optical technologies offer the ability to reconfigure network topologies dynamically, rather than setting them once and for all. This is true in both optical wide area networks (optical WANs) and in datacenters, despite the many…

Data Structures and Algorithms · Computer Science 2020-01-23 Michael Dinitz , Benjamin Moseley

Long flows contribute huge volumes of traffic over inter-datacenter WAN. The Flow Completion Time (FCT) is a vital network performance metric that affects the running time of distributed applications and the users' quality of experience.…

Networking and Internet Architecture · Computer Science 2019-02-15 Mohammad Noormohammadpour , Ajitesh Srivastava , Cauligi S. Raghavendra

A growing number of critical workflow applications leverage a streamlined edge-hub-cloud architecture, which diverges from the conventional edge computing paradigm. An edge device, in collaboration with a hub device and a cloud server,…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-23 Andreas Kouloumpris , Georgios L. Stavrinides , Maria K. Michael , Theocharis Theocharides

Nowadays, the use of soft computational techniques in power systems under the umbrella of machine learning is increasing with good reception. In this paper, we first present a deep learning approach to find the optimal configuration for…

Networking and Internet Architecture · Computer Science 2025-01-14 Davoud Yousefi , Hassan Yari , Farzad Osouli , Mohammad Ebrahimi , Somayeh Esmalifalak , Morteza Johari , Abbas Azarnezhad , Fatemeh Sadeghi , Rogayeh Mirzapour

This paper addresses the scheduling problem of coflows in identical parallel networks, which is a well-known $NP$-hard problem. Coflow is a relatively new network abstraction used to characterize communication patterns in data centers. We…

Data Structures and Algorithms · Computer Science 2023-12-21 Chi-Yeh Chen

Utilizing existing transportation networks better and designing (parts of) networks involves routing decisions to minimize transportation costs and maximize consolidation effects. We study the concrete example of hinterland networks for the…

Optimization and Control · Mathematics 2023-03-30 Niklas Jost , Dorothee Henke , Ivo Hedtke , Oliver Bredtmann , Joachim Weise , Christoph Buchheim , Uwe Clausen

Traditionally, HPC workloads have been deployed in bare-metal clusters; but the advances in virtualization have led the pathway for these workloads to be deployed in virtualized clusters. However, HPC cluster administrators/providers still…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-24 Jashwant Raj Gunasekaran , Michael Cui , Prashanth Thinakaran , Josh Simons , Mahmut Taylan Kandemir , Chita R. Das

In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a…

Networking and Internet Architecture · Computer Science 2012-06-14 Bo Ji , Changhee Joo , Ness B. Shroff

AllReduce is a technique in distributed computing which saw use in many critical applications of deep learning. Existing methods of AllReduce scheduling oftentimes lack flexibility due to being topology-specific or relying on extensive…

Networking and Internet Architecture · Computer Science 2025-03-28 Yufan Wei , Mickel Liu , Wenfei Wu

In data-parallel computing frameworks, intermediate parallel data is often produced at various stages which needs to be transferred among servers in the datacenter network (e.g. the shuffle phase in MapReduce). A stage often cannot start or…

Data Structures and Algorithms · Computer Science 2017-04-28 Mehrnoosh Shafiee , Javad Ghaderi

Co-flows model a modern scheduling setting that is commonly found in a variety of applications in distributed and cloud computing. In co-flow scheduling, there are $m$ input ports and $m$ output ports. Each co-flow $j \in J$ can be…

Data Structures and Algorithms · Computer Science 2018-12-04 Sungjin Im , Manish Purohit

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…

Networking and Internet Architecture · Computer Science 2020-11-02 Maciej Besta , Jens Domke , Marcel Schneider , Marek Konieczny , Salvatore Di Girolamo , Timo Schneider , Ankit Singla , Torsten Hoefler

With the ever-increasing computational demand of DNN training workloads, distributed training has been widely adopted. A combination of data, model and pipeline parallelism strategy, called hybrid parallelism distributed training, is…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-06-16 Guandong Lu , Runzhe Chen , Yakai Wang , Yangjie Zhou , Rui Zhang , Zheng Hu , Yanming Miao , Zhifang Cai , Li Li , Jingwen Leng , Minyi Guo

In situ approaches can accelerate the pace of scientific discoveries by allowing scientists to perform data analysis at simulation time. Current in situ workflow systems, however, face challenges in handling the growing complexity and…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-04-05 Orcun Yildiz , Dmitriy Morozov , Arnur Nigmetov , Bogdan Nicolae , Tom Peterka