"coflows" meaning in English

See coflows in All languages combined, or Wiktionary

Noun

Head templates: {{head|en|noun form}} coflows
  1. plural of coflow Tags: form-of, plural Form of: coflow
    Sense id: en-coflows-en-noun-hO7TOM0l Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries
{
  "head_templates": [
    {
      "args": {
        "1": "en",
        "2": "noun form"
      },
      "expansion": "coflows",
      "name": "head"
    }
  ],
  "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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "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": "quote"
        }
      ],
      "form_of": [
        {
          "word": "coflow"
        }
      ],
      "glosses": [
        "plural of coflow"
      ],
      "id": "en-coflows-en-noun-hO7TOM0l",
      "links": [
        [
          "coflow",
          "coflow#English"
        ]
      ],
      "tags": [
        "form-of",
        "plural"
      ]
    }
  ],
  "word": "coflows"
}
{
  "head_templates": [
    {
      "args": {
        "1": "en",
        "2": "noun form"
      },
      "expansion": "coflows",
      "name": "head"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English non-lemma forms",
        "English noun forms",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries"
      ],
      "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": "quote"
        }
      ],
      "form_of": [
        {
          "word": "coflow"
        }
      ],
      "glosses": [
        "plural of coflow"
      ],
      "links": [
        [
          "coflow",
          "coflow#English"
        ]
      ],
      "tags": [
        "form-of",
        "plural"
      ]
    }
  ],
  "word": "coflows"
}

Download raw JSONL data for coflows meaning in English (1.4kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.