stack memory

基本解釋

This will save the old stack pointer and allocate stack memory atomically.
這會保存原來的堆棧指針，并自動分配堆棧內(nèi)存。
In Greg's tests, using Continuations cuts thread consumption, and concomitantly stack memory consumption, by a factor of more than 10.
在 Greg 的測試中，使用 Continuations 能夠減少線程消耗，并同時減少了超過 10 倍的棧內(nèi)存消耗。
Therefore, subsequent, uninitialized stack variables that happen to use the same stack area can return values left over from the prior use of this stack memory.
因此，恰好在隨后使用相同堆棧區(qū)域的未初始化堆棧變量就可能返回上次使用該堆棧內(nèi)存時留下的值。

It turns out that slightly before the stack, slightly before this conceptual chunk of memory, there's other things called environment variables that we may see over time but elsewhere in memory are other things.
結(jié)果是稍微在堆之前，稍微在這個內(nèi)存塊概念之前，另外還一個東西叫做環(huán)境變量,我們之后可能看到，內(nèi)存中的其他地方,是其他的東西。
哈佛公開課 - 計算機科學(xué)課程節(jié)選
Well, if you want to call a function, it's like putting another tray on that stack of trays and that tray represents a chunk of memory that, that function can use.
嗯，如果你想調(diào)用一個函數(shù)，這就像把一個托盤放到另一個托盤上,托盤代表一塊，函數(shù)可以使用的內(nèi)存。
哈佛公開課 - 計算機科學(xué)課程節(jié)選
But as soon as the most recently called function finishes executing, you have to take that tray off the stack in order to get at the previous function's memory, and once he's done executing, you have to take that one off and then what's left well then main.
但是，一旦新的調(diào)用函數(shù)結(jié)束了執(zhí)行,你必須從堆中把托盤拿掉,用來獲得先前函數(shù)的內(nèi)存，一旦他完成執(zhí)行，你必須把那一塊拿下來,然后剩下的是main函數(shù)。
哈佛公開課 - 計算機科學(xué)課程節(jié)選

In addition, as useful amounts of flash memory storage are now affordable, the ruggedness of flash memory and the ability to stack chips to provide slim package designs have made NAND flash the choice non-volatile storage technology for mobile devices.
FORBES: Are Fat Tablets in Your Future?