Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Chunking (computing)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Confuse|Thunking}} In [[computer programming]], '''chunking''' has multiple meanings. ==In memory management== Typical modern [[software]] systems allocate [[computer memory|memory]] dynamically from structures known as [[dynamic memory allocation|heap]]s. 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. ==In HTTP message transmission== {{main|Chunked transfer encoding}} '''Chunking''' is a specific feature of the [[HTTP]] 1.1 protocol.<ref>{{cite web |title=HTTP/1.1: Protocol Parameters |url=https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.6.1 |access-date=2019-12-10 }}</ref> Here, the meaning is the opposite of that used in memory management. It refers to a facility that allows inconveniently large messages to be broken into conveniently-sized smaller "chunks". ==In data deduplication, data synchronization and remote data compression== In [[data deduplication]], [[data synchronization]] and remote [[data compression]], Chunking is a process to split a file into smaller pieces called chunks by the chunking algorithm. It can help to eliminate duplicate copies of repeating data on storage, or reduces the amount of data sent over the network by only selecting changed chunks. The Content-Defined Chunking (CDC) algorithm like [[Rolling hash]] and its variants have been the most popular data deduplication algorithms for the last 15 years.<ref>{{cite conference |title=FastCDC: a Fast and Efficient Content-Defined Chunking Approach for Data Deduplication |date=2016 |url=https://www.usenix.org/system/files/conference/atc16/atc16-paper-xia.pdf |access-date=2019-12-10 |conference=USENIX ATC β16 }}</ref> == See also == * [[Chunk (information)]], a fragment of data within certain file formats == References == {{Reflist}} [[Category:Memory management]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Cite conference
(
edit
)
Template:Cite web
(
edit
)
Template:Confuse
(
edit
)
Template:Distinguish
(
edit
)
Template:Main
(
edit
)
Template:Rcatsh
(
edit
)
Template:Reflist
(
edit
)