Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Call stack

Known as: Runtime stack, Function stack, Display register 
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

Related topics

Related topics

50 relations
Aliasing (computing)C dynamic memory allocationC standard libraryCHICKEN Scheme
Expand

Broader (1)

Memory management

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
A Temporal Logic of Nested Calls and Returns
Model checking of linear temporal logic (LTL) specifications with respect to pushdown systems has been shown to be a useful tool… Expand
  • figure 1
Highly Cited
2004
Highly Cited
2004
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
Stack-based scheduling of realtime processes
  • T. Baker
  • Real-Time Systems
  • 2004
    • Corpus ID: 10100563
The Priority Ceiling Protocol (PCP) of Sha, Rajkumar and Lehoczky is a policy for locking binary semaphores that bounds priority… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 8
Highly Cited
2004
Highly Cited
2004
End-to-end performance and fairness in multihop wireless backhaul networks
Wireless IEEE 802.11 networks in residences, small businesses, and public "hot spots" typically encounter the wireline access… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Highly Cited
2003
Highly Cited
2003
Anomaly detection using call stack information
The call stack of a program execution can be a very good information source for intrusion detection. There is no prior work on… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1999
Highly Cited
1999
Scheduling multithreaded computations by work stealing
This paper studies the problem of efficiently schedulling fully strict (i.e., well-structured) multithreaded computations on… Expand
  • figure 1
  • figure 2
Highly Cited
1997
Highly Cited
1997
Region-based Memory Management
This paper describes a memory management discipline for programs that perform dynamic memory allocation and de-allocation. At… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Highly Cited
1996
Highly Cited
1996
Characterizing reference locality in the WWW
The authors propose models for both temporal and spatial locality of reference in streams of requests arriving at Web servers… Expand
  • table 1
  • figure 1
  • figure 3
  • figure 2
  • table 2
Highly Cited
1994
Highly Cited
1994
Scheduling multithreaded computations by work stealing
  • R. Blumofe
  • Proceedings 35th Annual Symposium on Foundations…
  • 1994
    • Corpus ID: 40566370
This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on… Expand
  • figure 1
  • figure 2
Highly Cited
1987
Highly Cited
1987
Morphological filters-Part II: Their relations to median, order-statistic, and stack filters
This paper extends the theory of median, order-statistic (OS), and stack filters by using mathematical morphology to analyze them… Expand
  • figure 1
  • figure 2
  • figure 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE