About: Stack-based memory allocation     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org:8891 associated with source document(s)
QRcode icon
http://dbpedia.org:8891/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.

AttributesValues
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
  • http://commons.wikimedia.org/wiki/Special:FilePath/ProgramCallStack2_en.svg
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
thumbnail
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
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is rdfs:seeAlso of
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 44 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software