Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,794,444 papers from all fields of science
Search
Sign In
Create Free Account
Call stack
Known as:
Runtime stack
, Function stack
, Display register
Expand
In computer science, a call stack is a stack data structure that stores information about the active subroutines of a computer program. This kind of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Aliasing (computing)
C dynamic memory allocation
C standard library
CHICKEN Scheme
Expand
Broader (1)
Memory management
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Growth Performance, Digestibility, N-balance and Rumen Fermentation of Lambs Fed Different Levels of Deep-stack Broiler Litter
M. Elemam
,
A. Fadelelseed
,
A. M. Salih
2011
Corpus ID: 55807449
Sixteen lambs ranging in a ge between 9-12 m onths with l ive body weight 30-32 kg were u sed in a n e xperiment with 12-week…
Expand
2009
2009
The Effect of Input Data on Program Vulnerability
Vilas Sridharan
,
D. Kaeli
2009
Corpus ID: 15920811
The System Vulnerability Stack is a novel method to compute a system’s vulnerability to transient faults (see Figure 1). The…
Expand
2008
2008
On the Sum-Capacity of Degraded Gaussian Multiaccess Relay Channels
L. Sankar
,
N. Mandayam
,
H. Poor
arXiv.org
2008
Corpus ID: 7898895
The sum-capacity is studied for a K-user degraded Gaussian multiaccess relay channel (MARC) where the multiaccess signal received…
Expand
Highly Cited
2006
Highly Cited
2006
Measured TCP Performance in CDMA 1x EV-DO Network?
Youngseok Lee
2006
Corpus ID: 16278666
A horn antenna is disclosed having a built-in circular polarizer and a cross polarization attenuator. A square-apertured horn…
Expand
2006
2006
Avoiding Infinite Recursion with Stratified Aspects
E. Bodden
,
Florian Forster
,
F. Steimann
NODe/GSEM
2006
Corpus ID: 11533450
Abstract: Infinite recursion is a known problem of aspect-oriented programming with AspectJ: if no special precautions are taken…
Expand
2005
2005
Stack filter design using selection probabilities
M. K. Prasad
IEEE Transactions on Signal Processing
2005
Corpus ID: 15069021
Selection probabilities, viz. rank and sample selection probabilities, quantify the impulse suppression, robustness, lowpass…
Expand
2005
2005
Automated Correctness Analysis of MPI Programs with Intel(r) Message Checker
V. Samofalov
,
V. Krukov
,
B. Kuhn
,
S. Zheltov
,
Alexander V. Konovalov
,
J. Desouza
International Conference on Parallel Computing
2005
Corpus ID: 11121917
c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for…
Expand
2001
2001
ANALYTICAL MODEL FOR TCP FILE TRANSFERS OVER UMTS
J. Peisa
,
M. Meyer
2001
Corpus ID: 129939560
This paper proposes a fairly complex model to analyze the performance of TCP file transfers over UMTS. Our approach is based on…
Expand
1998
1998
Distributed Cactus Stacks: Runtime Stack-Sharing Support for Distributed Parallel Programs
D. Mclaughlin
,
P. Dasgupta
1998
Corpus ID: 18439152
Parallel Programming Systems based on the Distributed Shared Memory technique has been promoted as easy to program, natural and…
Expand
1967
1967
The IBM system/360 model 91: storage system
L. Boland
,
G. Granito
,
A. Marcotte
,
B. Messina
,
J. W. Smith
1967
Corpus ID: 56580626
This paper discusses the design concepts employed in the development of the IBM System/360 Model 91 storage system. Particular…
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