On scheduling coflows (extended abstract)

DOI10.1007/978-3-319-59250-3_2MaRDI QIDQ2401141zbMATH OpenOpenAlexFDO

Authors Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang

Publication date 31 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-59250-3_2

zbMATH Keywords

coflow schedulingconcurrent open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• On scheduling coflows
• Matroid coflow scheduling
• Co-scheduling algorithms for high-throughput workload execution
• scientific article; zbMATH DE number 2080861
• scientific article; zbMATH DE number 2080125
• Models and algorithms for coscheduling compute-intensive tasks on a network of workstations
• scientific article; zbMATH DE number 1929963
• Supporting schedules of resource co-allocation for distributed computing in scalable systems

Cited in

(8)

• Co-scheduling algorithms for high-throughput workload execution
• On scheduling coflows
• The matroid intersection cover problem
• The Complexity of Scheduling for p-Norms of Flow and Stretch
• Flow-time optimization for concurrent open-shop and precedence constrained scheduling models
• Matroid coflow scheduling
• Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey
• Approximating minimum sum coloring with bundles

This page was built for publication: On scheduling coflows (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401141)