Image de couverture de livre

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Chen, Chi-Yeh
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Indirect Coflow Scheduling
par: Lindermayr, Alexander, et autres
Publié: (2025)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
par: Chen, Chi-Yeh
Publié: (2025)

Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks
par: Chen, Chi-Yeh
Publié: (2026)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
par: Rohwedder, Lars, et autres
Publié: (2025)

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan
par: Chen, Tianqi, et autres
Publié: (2025)

Provably Fast and Space-Efficient Parallel Biconnectivity
par: Dong, Xiaojun, et autres
Publié: (2023)

Engineering Optimal Parallel Task Scheduling
par: Akram, Matthew, et autres
Publié: (2024)

UFO Trees: Practical and Provably-Efficient Parallel Batch-Dynamic Trees
par: De Man, Quinten, et autres
Publié: (2026)

Sequential Diversification with Provable Guarantees
par: Wang, Honglian, et autres
Publié: (2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions
par: Kuszmaul, William, et autres
Publié: (2024)

Dynamic Spectral Clustering with Provable Approximation Guarantee
par: Laenen, Steinar, et autres
Publié: (2024)

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Broadcasting in Heterogeneous Tree Networks with Edge Weight Uncertainty
par: Tsou, Cheng-Hsiao, et autres
Publié: (2024)

Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee
par: Brinkop, Hauke, et autres
Publié: (2025)

Online Flexible Busy Time Scheduling on Heterogeneous Machines
par: Calinescu, Gruia, et autres
Publié: (2024)

Non-Clairvoyant Scheduling with Progress Bars
par: Benomar, Ziyad, et autres
Publié: (2025)

Active Learning for Decision Trees with Provable Guarantees
par: Moakhar, Arshia Soltani, et autres
Publié: (2026)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
par: Segev, Danny
Publié: (2024)

Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
par: Jäger, Sven, et autres
Publié: (2022)

Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
par: Feng, Yiding, et autres
Publié: (2026)

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
par: Jäger, Sven, et autres
Publié: (2024)

Network Design on Undirected Series-Parallel Graphs
par: Bansal, Ishan, et autres
Publié: (2024)

Temporal Routing in Static Networks: The Schedule Completion Problem
par: Döring, Michelle, et autres
Publié: (2026)

SVD Provably Denoises Nearest Neighbor Data
par: Kannan, Ravindran, et autres
Publié: (2026)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
par: Lindermayr, Alexander, et autres
Publié: (2025)

A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
par: Singh, Rajpreet, et autres
Publié: (2025)

Parallel Higher-order Truss Decomposition
par: Chen, Chen, et autres
Publié: (2024)

Parallel Best Arm Identification in Heterogeneous Environments
par: Karpov, Nikolai, et autres
Publié: (2022)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
par: Sinhal, Anay, et autres
Publié: (2026)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
par: Mendoza-Cadena, Mirabel, et autres
Publié: (2026)

Latency Guarantees for Caching with Delayed Hits
par: Gurushankar, Keerthana, et autres
Publié: (2025)

Optimizing Age-of-Information in Piggyback Networks with Recurrent Data Generation
par: Lin, Ching-Chi, et autres
Publié: (2025)

New Approximation Guarantees for The Inventory Staggering Problem
par: Alon, Noga, et autres
Publié: (2025)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
par: Hsieh, Yi-Ting, et autres
Publié: (2025)

Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
par: Ashvinkumar, Vikrant, et autres
Publié: (2026)

Efficient Parallel Ising Samplers via Localization Schemes
par: Chen, Xiaoyu, et autres
Publié: (2025)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
par: Chen, Qingyun, et autres
Publié: (2024)

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
par: Zhao, Jingyang, et autres
Publié: (2023)

Subsetwise and Multi-Level Additive Spanners with Lightness Guarantees
par: Ahmed, Reyan, et autres
Publié: (2024)

Parallel PLL on DAGs
par: Steil, Patrick
Publié: (2025)