Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,199,059 papers from all fields of science
Search
Sign In
Create Free Account
Overhead (computing)
Known as:
Computational overhead
, Overhead
In computer science, overhead is any combination of excess or indirect computation time, memory, bandwidth, or other resources that are required to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Algorithm
Algorithmic efficiency
BareMetal
Block (data storage)
Expand
Broader (1)
Software engineering
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
BodyMAC: Energy efficient TDMA-based MAC protocol for Wireless Body Area Networks
Gengfa Fang
,
E. Dutkiewicz
9th International Symposium on Communications and…
2009
Corpus ID: 17838338
Wireless Body Area Networks (WBANs) enable placement of tiny biomedical sensors on or inside the human body to monitor vital body…
Expand
Highly Cited
2007
Highly Cited
2007
Shortcut Tree Routing in ZigBee Networks
Taehong Kim
,
Daeyoung Kim
,
Noseong Park
,
Seong-eun Yoo
,
T. López
International Symposium on Wireless Pervasive…
2007
Corpus ID: 9595553
ZigBee is the emerging industrial standard for ad hoc networks based on IEEE 802.15.4. Due to characteristics such as low data…
Expand
Highly Cited
2007
Highly Cited
2007
A mechanism for detection of gray hole attack in mobile Ad Hoc networks
Jaydip Sen
,
M. Chandra
,
G. HariharaS.
,
H. Reddy
,
P. Balamuralidhar
International Conference on Information…
2007
Corpus ID: 1712584
Protecting the network layer from malicious attacks is an important and challenging security issue in mobile ad hoc networks…
Expand
Highly Cited
2006
Highly Cited
2006
An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration
Jihoon Myung
,
Wonjun Lee
,
T. Shih
IEEE transactions on multimedia
2006
Corpus ID: 3125031
A radio frequency identification (RFID) reader recognizes objects through wireless communications with RFID tags. Tag collision…
Expand
Highly Cited
2005
Highly Cited
2005
REPLICA: a bitstream manipulation filter for module relocation in partial reconfigurable systems
Heiko Kalte
,
Gareth Lee
,
Mario Porrmann
,
U. Rückert
IEEE International Parallel and Distributed…
2005
Corpus ID: 18979639
The feature of partial reconfiguration provided by currently available field programmable gate arrays (FPGAs) makes it possible…
Expand
Highly Cited
2003
Highly Cited
2003
RTOS modeling for system level design
A. Gerstlauer
,
Haobo Yu
,
D. Gajski
Design, Automation and Test in Europe Conference…
2003
Corpus ID: 15638
System level synthesis is widely seen as the solution for closing the productivity gap in system design. High level system models…
Expand
Highly Cited
1999
Highly Cited
1999
Optimal Patching Schemes for Efficient Multimedia Streaming
S. Sen
,
Lixin Gao
,
J. Rexford
,
D. Towsley
1999
Corpus ID: 14263010
Multimedia streaming applications consume a significant amount of server and network resources due to the high bandwidth and long…
Expand
Highly Cited
1998
Highly Cited
1998
Using a single input to support multiple scan chains
Kuen-Jong Lee
,
Jih-Jeen Chen
,
Cheng-Hua Huang
International Conference on Computer Aided Design
1998
Corpus ID: 10563352
Single scan chain architectures suffer from long test application time, while multiple scan chain architectures require large pin…
Expand
Highly Cited
1990
Highly Cited
1990
Serial interfacing for embedded-memory testing
B. Nadeau-Dostie
,
A. Silburt
,
V. Agarwal
IEEE Design & Test of Computers
1990
Corpus ID: 21277283
A serial interfacing scheme in which several embedded memories share the built-in, self-test circuit is presented. For external…
Expand
Highly Cited
1982
Highly Cited
1982
A Practical Data Flow Computer
I. Watson
,
J. Gurd
Computer
1982
Corpus ID: 14883191
Based on a tagged dynamic data flow model, this prototype machine has eight unusual matching functions for handling incoming data…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE