See buddy memory allocation on Wiktionary
{
"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": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [],
"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",
"Pages with 1 entry",
"Pages with entries",
"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"
}
Download raw JSONL data for buddy memory allocation meaning in All languages combined (1.1kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-06-07 from the enwiktionary dump dated 2025-06-01 using wiktextract (92124b4 and f1c2b61). 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.