1977ComputerRequires access

Stack Computers: An Introduction

D.M. Bulman

Open publisher page 15 citations

Abstract

Basic idea. The stack, or last-in first-out store, has become more familiar recently because many microprocessors have incorporated a stack in some form. In some microprocessors, the stack can only contain return addresses for subroutines; in others there are provisions for holding temporary data in the stack. The stack derives its name from the idea that items are placed on the "top," thus "pushing down" those items already on the stack. Items are removed from the top, "popping up" those items remaining on the stack.

About this research paper

What this paper is about

Basic idea. The stack, or last-in first-out store, has become more familiar recently because many microprocessors have incorporated a stack in some form. In some microprocessors, the stack can only contain return addresses for subroutines; in others there are provisions for holding temporary data in the stack. The stack derives its name from the idea that items are placed on the "top," thus "pushing down" those items already on the stack. Items are removed from the top, "popping up" those items remaining on the stack.

Why it matters

OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Basic idea. The stack, or last-in first-out store, has become more familiar recently because many microprocessors have incorporated a stack in some form. In some microprocessors, the stack can only contain return addresses for subroutines; in others there are provisions for holding temporary data in the stack. The stack derives its name from the idea that items are placed on the "top," thus "pushing down" those items already on the stack. Items are removed from the top, "popping up" those items remaining on the stack.

Key concepts: Stack (abstract data type), Call stack, Subroutine, Computer science, Operating system, Parallel computing

Related papers

Back to paper searchBrowse research topicsOriginal source
Stack Computers: An Introduction — Research Paper | ScholarLens