English edit

Etymology edit

co- +‎ flow

Noun edit

coflow (plural coflows)

  1. (graph theory) Any of a series of flows that have a common source and destination
    • 2016, Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman, “Asymptotically Optimal Approximation Algorithms for Coflow Scheduling”, in arXiv[1]:
      Furthermore, we give an  -approximation polynomial time algorithm for scheduling circuit-based coflows where flow paths are not given (here   is the number of network edges). We note that our task-based coflow scheduling problem is equivalent to the fully-flexible order scheduling problem on unrelated parallel machines for which no  -factor approximation algorithm was known prior to this work. We obtain our results by developing a general framework for coflow schedules, based on interval-indexed linear programs, which may extend to other coflow models and objective functions and may also yield improved approximation bounds for specific network scenarios..