Jump to content

Chunking (computing)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by UnCatBot (talk | contribs) at 23:49, 13 December 2008 ((Bot) tagging, added uncategorised tag). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer programming, chunking has multiple meanings.

In memory management

Typical modern software systems allocate memory dynamically from structures known as heaps. Calls are made to heap-management routines to allocate and free memory. Heap management involves some computation time and can be a performance issue. Chunking refers to strategies for improving performance by using special knowledge of a situation to aggregate related memory-allocation requests. For example, if it is known that a certain kind of object will typically be required in groups of eight, instead of allocating and freeing each object individually, making sixteen calls to the heap manager, one could allocate and free an array of eight of the objects, reducing the number of calls to two.


chunking is putting together multiple units of info so they can be easier understood