Knowledge (XXG)

Overhead (computing)

Source 📝

38: 195:, overhead can influence the decision whether or not to include features in new products, or indeed whether to fix bugs. A feature that has a high overhead may not be included – or needs a big financial incentive to do so. Often, even though software providers are well aware of bugs in their products, the payoff of fixing them is not worth the reward, because of the overhead. 150:. Overhead can be a deciding factor in software design, with regard to structure, error correction, and feature inclusion. Examples of computing overhead may be found in Object Oriented Programming (OOP), 466:
take a portion of the space to store directory names and listings, file names, files' sector locations, attributes such as the date and time of the last modification and creation, how the files are
218:. This makes no comment on how long something takes to run or how much memory it uses, but how its increase depends on the size of the input. Overhead is 294:
of data over a communications network requires sending more than just the payload itself. It also involves sending various control and signalling data (
381:
this date can be written as follows with an overhead of 218 characters, while adding the semantic context that it is a CHANGEDATE with index 1.
516: 55: 222:
not part of this calculation, since it varies from one machine to another, whereas the fundamental running time of an algorithm does not.
142:
is any combination of excess or indirect computation time, memory, bandwidth, or other resources that are required to perform a specific
454:
The 349 bytes, resulting from the UTF-8 encoded XML, correlates to a size overhead of 8625% over the original integer representation.
121: 102: 318: 74: 229:, which takes into account all kinds of resources – a combination (though not a trivial one) of complexity and overhead. 642: 587: 59: 278:
stores. For instance, a "4 KB cache" is a cache that holds 4 KB of data. The "4 KB" in this example excludes
183:, each of which have known characteristics. When choosing among them, their respective overhead should also be considered. 295: 81: 243: 88: 48: 496: 70: 568: 203: 199: 471: 226: 151: 329: 247: 192: 147: 377:
the date would consume 19 bytes, a size overhead of 375% over the binary integer representation. As
491: 291: 541: 467: 95: 310: 143: 135: 206:
may provide low space overhead, but at the cost of slow performance (space/time tradeoff).
611: 623: 371: 215: 180: 17: 636: 255: 302:
as the additional data does not contribute to the intrinsic meaning of the message.
279: 612:
Common Performance Issues in Network Applications Part 1: Interactive Applications
517:"Understanding the Visualization of Overhead and Latency in NVIDIA Nsight Systems" 486: 463: 314: 37: 353: 349: 306: 267: 176: 168: 363: 341: 251: 172: 477:
Many small files create more overhead than a low number of large files.
356: 324:
Protocol overhead can be expressed as a percentage of non-application
344:
of information and data introduces overhead too. The date and time
367: 246:
introduces a small run-time overhead. Sometimes the compiler can
386:<?xml version="1.0" encoding="UTF-8"?> 325: 317:) radios, the use of "over" and other signaling needed to avoid 378: 298:) required to reach the destination. This creates a so-called 31: 167:
A programmer/software engineer may have a choice of several
238:
Computer programming (run-time and computational overhead)
332:) divided by the total number of bytes in the message. 214:
Algorithmic complexity is generally specified using
62:. Unsourced material may be challenged and removed. 602:Presentation for course in Computer Architecture. 470:, written and free parts of the space, and a 336:Encodings and data structures (size overhead) 282:such as frame, address, and tag information. 8: 614:, Windows XP Technical Articles, Microsoft 362:, consuming only 4 bytes. Represented as 122:Learn how and when to remove this message 27:Excess resources needed to perform a task 508: 462:Besides the files themselves, computer 286:Communications (data transfer overhead) 154:, data transfer, and data structures. 569:"Inlining Decisions in Visual Studio" 7: 624:Protocol Overhead in IP/ATM Networks 60:adding citations to reliable sources 25: 626:, Minnesota Supercomputer Center 567:Mahaffey, Terry (24 July 2019). 313:are overheads. In two-way (but 36: 588:"Caches and Memory Hierarchies" 225:This should be contrasted with 210:Run-time complexity of software 47:needs additional citations for 1: 274:) refers to how much data a 659: 146:. It is a special case of 586:Sorin, Daniel J. (2009). 71:"Overhead" computing 542:"Inline functions (C++)" 497:Universal Turing machine 383: 163:Choice of implementation 270:, the "cache size" (or 204:succinct data structure 200:implicit data structure 474:on some file systems. 395:"changedate" 227:algorithmic efficiency 152:functional programming 18:Computational overhead 643:Software optimization 521:NVIDIA Technical Blog 346:"2011-07-12 07:18:47" 330:frame synchronization 309:, number dialing and 348:can be expressed as 193:software engineering 148:engineering overhead 56:improve this article 492:Rule of least power 375:2011-07-12 07:18:47 290:Reliably sending a 449:</datetime> 300:protocol overhead 250:this overhead by 132: 131: 124: 106: 16:(Redirected from 650: 627: 621: 615: 609: 603: 601: 599: 597: 592: 583: 577: 576: 564: 558: 557: 555: 553: 538: 532: 531: 529: 528: 513: 450: 447: 443: 440: 436: 433: 429: 426: 422: 419: 415: 412: 408: 405: 402: 399: 396: 393: 390: 387: 376: 361: 352:with the 32-bit 321:is an overhead. 311:call set-up time 198:For example, an 136:computer science 127: 120: 116: 113: 107: 105: 64: 40: 32: 21: 658: 657: 653: 652: 651: 649: 648: 647: 633: 632: 631: 630: 622: 618: 610: 606: 595: 593: 590: 585: 584: 580: 566: 565: 561: 551: 549: 546:Microsoft Learn 540: 539: 535: 526: 524: 515: 514: 510: 505: 483: 460: 452: 451: 448: 446:</second> 445: 441: 439:</minute> 438: 434: 431: 427: 424: 420: 417: 413: 410: 406: 403: 400: 397: 394: 391: 388: 385: 374: 359: 338: 288: 264: 240: 235: 212: 189: 181:data structures 165: 160: 158:Software design 128: 117: 111: 108: 65: 63: 53: 41: 28: 23: 22: 15: 12: 11: 5: 656: 654: 646: 645: 635: 634: 629: 628: 616: 604: 578: 559: 533: 507: 506: 504: 501: 500: 499: 494: 489: 482: 479: 459: 456: 442:<second> 435:<minute> 418:</month> 384: 337: 334: 328:(protocol and 287: 284: 263: 260: 256:function calls 254:some of these 239: 236: 234: 231: 216:Big O notation 211: 208: 188: 185: 164: 161: 159: 156: 130: 129: 44: 42: 35: 26: 24: 14: 13: 10: 9: 6: 4: 3: 2: 655: 644: 641: 640: 638: 625: 620: 617: 613: 608: 605: 589: 582: 579: 574: 573:C++ Team Blog 570: 563: 560: 547: 543: 537: 534: 522: 518: 512: 509: 502: 498: 495: 493: 490: 488: 485: 484: 480: 478: 475: 473: 469: 465: 457: 455: 432:</hour> 414:<month> 411:</year> 401:"1" 382: 380: 373: 369: 365: 358: 355: 351: 347: 343: 335: 333: 331: 327: 322: 320: 316: 312: 308: 303: 301: 297: 293: 285: 283: 281: 280:overhead bits 277: 273: 269: 261: 259: 257: 253: 249: 245: 237: 232: 230: 228: 223: 221: 217: 209: 207: 205: 201: 196: 194: 186: 184: 182: 178: 174: 170: 162: 157: 155: 153: 149: 145: 141: 137: 126: 123: 115: 112:February 2018 104: 101: 97: 94: 90: 87: 83: 80: 76: 73: –  72: 68: 67:Find sources: 61: 57: 51: 50: 45:This article 43: 39: 34: 33: 30: 19: 619: 607: 594:. Retrieved 581: 575:. Microsoft. 572: 562: 550:. Retrieved 545: 536: 525:. Retrieved 523:. 2020-09-18 520: 511: 476: 464:file systems 461: 458:File systems 453: 428:<hour> 425:</day> 407:<year> 389:<datetime 345: 339: 323: 304: 299: 289: 275: 271: 265: 241: 224: 220:deliberately 219: 213: 197: 190: 166: 139: 133: 118: 109: 99: 92: 85: 78: 66: 54:Please help 49:verification 46: 29: 548:. Microsoft 487:Slack space 421:<day> 315:half-duplex 242:Invoking a 527:2024-07-04 503:References 468:fragmented 392:qualifier= 366:formatted 360:1310447927 319:collisions 262:CPU caches 177:data types 169:algorithms 82:newspapers 596:March 13, 350:Unix time 307:telephony 268:CPU cache 187:Tradeoffs 173:encodings 637:Category 552:22 March 481:See also 370:encoded 364:ISO 8601 342:encoding 272:capacity 252:inlining 248:minimize 244:function 233:Examples 140:overhead 472:journal 357:integer 292:payload 96:scholar 398:index= 372:string 354:signed 98:  91:  84:  77:  69:  591:(PDF) 368:UTF-8 326:bytes 276:cache 266:In a 103:JSTOR 89:books 598:2019 554:2024 409:2011 404:> 340:The 144:task 75:news 379:XML 305:In 296:TCP 202:or 191:In 179:or 134:In 58:by 639:: 571:. 544:. 519:. 444:47 437:18 430:07 423:12 416:07 258:. 175:, 171:, 138:, 600:. 556:. 530:. 125:) 119:( 114:) 110:( 100:· 93:· 86:· 79:· 52:. 20:)

Index

Computational overhead

verification
improve this article
adding citations to reliable sources
"Overhead" computing
news
newspapers
books
scholar
JSTOR
Learn how and when to remove this message
computer science
task
engineering overhead
functional programming
algorithms
encodings
data types
data structures
software engineering
implicit data structure
succinct data structure
Big O notation
algorithmic efficiency
function
minimize
inlining
function calls
CPU cache

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.