"buddy memory allocation" meaning in English

See buddy memory allocation in All languages combined, or Wiktionary

Noun

Head templates: {{en-noun|-}} buddy memory allocation (uncountable)
  1. (computing theory) A form of memory allocation that divides memory into partitions to try to satisfy a memory request as suitably as possible. Wikipedia link: buddy memory allocation Tags: uncountable Categories (topical): Theory of computing Related terms: buddy block, buddy system
    Sense id: en-buddy_memory_allocation-en-noun-yJpyq3TZ Categories (other): English entries with incorrect language header Topics: computing, computing-theory, engineering, mathematics, natural-sciences, physical-sciences, sciences

Download JSON data for buddy memory allocation meaning in English (1.4kB)

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "buddy memory allocation (uncountable)",
      "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": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A form of memory allocation that divides memory into partitions to try to satisfy a memory request as suitably as possible."
      ],
      "id": "en-buddy_memory_allocation-en-noun-yJpyq3TZ",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "divide",
          "divide"
        ],
        [
          "partition",
          "partition"
        ],
        [
          "satisfy",
          "satisfy"
        ],
        [
          "request",
          "request"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A form of memory allocation that divides memory into partitions to try to satisfy a memory request as suitably as possible."
      ],
      "related": [
        {
          "word": "buddy block"
        },
        {
          "word": "buddy system"
        }
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "buddy memory allocation"
      ]
    }
  ],
  "word": "buddy memory allocation"
}
{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "buddy memory allocation (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "buddy block"
    },
    {
      "word": "buddy system"
    }
  ],
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "en:Theory of computing"
      ],
      "glosses": [
        "A form of memory allocation that divides memory into partitions to try to satisfy a memory request as suitably as possible."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "divide",
          "divide"
        ],
        [
          "partition",
          "partition"
        ],
        [
          "satisfy",
          "satisfy"
        ],
        [
          "request",
          "request"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A form of memory allocation that divides memory into partitions to try to satisfy a memory request as suitably as possible."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "buddy memory allocation"
      ]
    }
  ],
  "word": "buddy memory allocation"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-10 from the enwiktionary dump dated 2024-05-02 using wiktextract (a644e18 and edd475d). 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.