About: Stack-based memory allocation

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Stack-based memory allocation Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FStack-based_memory_allocation

Stacks in computing architectures are regions of memory where data is added or removed in a last-in-first-out (LIFO) manner. In most modern computer systems, each thread has a reserved region of memory referred to as its stack. When a function executes, it may add some of its local state data to the top of the stack; when the function exits it is responsible for removing that data from the stack. At a minimum, a thread's stack is used to store the location of a return address provided by the caller in order to allow return statements to return to the correct location.

Attributes	Values
rdfs:label	Stack-based memory allocation (en) 基于堆栈的内存分配 (zh)
rdfs:comment	計算機中的堆栈是電腦記憶體区域，其中以后进先出 (LIFO)方式添加或删除数据。在大多数现代计算机系统中，每个线程都會被分配一定的内存区域，称为堆栈。当一个函数执行时，它可能会将一些数据添加到栈顶；当函数準備停止執行時，它负责从堆栈中删除该数据。线程的堆栈用于存储调用者提供的返回地址的位置，以便让返回语句返回到正确的位置。此外堆栈還會用于存储当前活动函数的固定长度变量。程序员也可以使用堆栈来存储可变长度的数据。 (zh) Stacks in computing architectures are regions of memory where data is added or removed in a last-in-first-out (LIFO) manner. In most modern computer systems, each thread has a reserved region of memory referred to as its stack. When a function executes, it may add some of its local state data to the top of the stack; when the function exits it is responsible for removing that data from the stack. At a minimum, a thread's stack is used to store the location of a return address provided by the caller in order to allow return statements to return to the correct location. (en)
foaf:depiction
dcterms:subject	Memory management
Wikipage page ID	1836265 (xsd:integer)
Wikipage revision ID	1123167859 (xsd:integer)
Link from a Wikipage to another Wikipage	PowerPC Application binary interface Unix-like LIFO (computing) Memory management MIPS architecture Call stack Stack (abstract data type) Stack machine Stack overflow Static variable Automatic variable C (programming language) UNIX/32V Heap-based memory allocation Dynamic memory allocation POSIX Gnulib Crash (computing) Microsoft Windows X86 Variable-length array Setjmp.h Stack buffer overflow Thread (computer science) Memory (computers) Standard C
sameAs	Stack-based memory allocation Stack-based memory allocation Stack-based memory allocation Stack-based memory allocation
dbp:wikiPageUsesTemplate	dbt:Code dbt:More_citations_needed dbt:Multiple_issues dbt:Original_research dbt:Other_uses dbt:Reflist dbt:Short_description
thumbnail	wiki-commons:Special:FilePath/ProgramCallStack2_en.svg?width=300
has abstract	Stacks in computing architectures are regions of memory where data is added or removed in a last-in-first-out (LIFO) manner. In most modern computer systems, each thread has a reserved region of memory referred to as its stack. When a function executes, it may add some of its local state data to the top of the stack; when the function exits it is responsible for removing that data from the stack. At a minimum, a thread's stack is used to store the location of a return address provided by the caller in order to allow return statements to return to the correct location. The stack is often used to store variables of fixed length local to the currently active functions. Programmers may further choose to explicitly use the stack to store local data of variable length. If a region of memory lies on the thread's stack, that memory is said to have been allocated on the stack, i.e. stack-based memory allocation (SBMA). This is contrasted with a heap-based memory allocation (HBMA). The SBMA is often closely coupled with a function call stack. (en) 計算機中的堆栈是電腦記憶體区域，其中以后进先出 (LIFO)方式添加或删除数据。在大多数现代计算机系统中，每个线程都會被分配一定的内存区域，称为堆栈。当一个函数执行时，它可能会将一些数据添加到栈顶；当函数準備停止執行時，它负责从堆栈中删除该数据。线程的堆栈用于存储调用者提供的返回地址的位置，以便让返回语句返回到正确的位置。此外堆栈還會用于存储当前活动函数的固定长度变量。程序员也可以使用堆栈来存储可变长度的数据。 (zh)
prov:wasDerivedFrom	wikipedia-en:Stack-based_memory_allocation?oldid=1123167859&ns=0
page length (characters) of wiki page	8446 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Stack-based_memory_allocation
is rdfs:seeAlso of	Call stack
is Link from a Wikipage to another Wikipage of	MOS Technology 6508 Memory architecture Index of object-oriented programming articles Intel 8085 Intel 8086 Substructural type system Comparison of Java and C++ Rust (programming language) Ershov Number Escape analysis Separation logic MIPS architecture Call stack Stack (abstract data type) Closure (computer programming) Funarg problem Macintosh 128K/512K technical details Stack Automatic variable C++ Address space layout randomization Transaction Processing Facility Garbage collection (computer science) Alloca Fairchild 9440 PDP-10 Page replacement algorithm HP-35 Higher-order function Java (programming language) Java (software platform) Java version history Abstract machine Stack-Based Memory Allocation Memory stack Intel 8080 Microsoft-specific exception handling mechanisms Buddy memory allocation Recursion (computer science) Magic number (programming) Variable-length array Nokia DX 200 X86 memory segmentation Stack allocation Stack memory
is Wikipage redirect of	Alloca

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software