"coflow" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "co",
        "3": "flow"
      },
      "expansion": "co- + flow",
      "name": "prefix"
    }
  ],
  "etymology_text": "co- + flow",
  "forms": [
    {
      "form": "coflows",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "coflow (plural coflows)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with co-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2016, Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman, “Asymptotically Optimal Approximation Algorithms for Coflow Scheduling”, in arXiv",
          "text": "Furthermore, we give an O(#x5C;logn#x2F;#x5C;log#x5C;logn)-approximation polynomial time algorithm for scheduling circuit-based coflows where flow paths are not given (here n 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 O(1)-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..",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Any of a series of flows that have a common source and destination"
      ],
      "id": "en-coflow-en-noun-8pebvJRf",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "flow",
          "flow"
        ],
        [
          "common",
          "common"
        ],
        [
          "source",
          "source"
        ],
        [
          "destination",
          "destination"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Any of a series of flows that have a common source and destination"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "coflow"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "co",
        "3": "flow"
      },
      "expansion": "co- + flow",
      "name": "prefix"
    }
  ],
  "etymology_text": "co- + flow",
  "forms": [
    {
      "form": "coflows",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "coflow (plural coflows)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with co-",
        "English terms with quotations",
        "en:Graph theory"
      ],
      "examples": [
        {
          "ref": "2016, Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman, “Asymptotically Optimal Approximation Algorithms for Coflow Scheduling”, in arXiv",
          "text": "Furthermore, we give an O(#x5C;logn#x2F;#x5C;log#x5C;logn)-approximation polynomial time algorithm for scheduling circuit-based coflows where flow paths are not given (here n 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 O(1)-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..",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Any of a series of flows that have a common source and destination"
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "flow",
          "flow"
        ],
        [
          "common",
          "common"
        ],
        [
          "source",
          "source"
        ],
        [
          "destination",
          "destination"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Any of a series of flows that have a common source and destination"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "coflow"
}