Recommended Free Tools
A stored-program computer keeps its instructions in memory, where the processor can fetch and execute them. Load a different program and the same hardware can do a different job. The basic von Neumann model is a common way to organize this idea, but its use of shared memory for instructions and data is not part of the definition of stored-program computing.
What does “stored-program” mean?
In a stored-program computer, a program’s instructions are represented in memory rather than being embodied solely in fixed wiring or a manual machine setup. The processor fetches instructions from memory and executes them. A program is therefore something the machine can load and run.
As an Amazon Associate I earn from qualifying purchases.
For example, the same computer can run a calculator program and later a text editor. The hardware remains in place; the instructions loaded for execution change. This ability to change a computer’s task by changing its program is the central idea.
What’s actually slowing this PC down?
Pick the symptom - the matching free tool is one click away.
How does a stored-program computer work?
- Instructions are placed in memory. A program is represented as instructions the processor can read.
- The processor fetches an instruction. It obtains the next instruction from memory.
- The processor executes it. It carries out the operation specified by the instruction, then continues through the program.
- A different program changes the task. Loading different instructions lets the same machine perform different work without physically rebuilding or rewiring it.
Is the stored-program concept the same as von Neumann architecture?
No. Stored-program describes the principle of keeping instructions in memory for the processor to fetch and execute. Von Neumann architecture describes a particular organization commonly used to teach and implement that principle. In the basic von Neumann model, instructions and data share memory. That shared-memory arrangement is a feature of the model, not a requirement of every stored-program computer. Kansas State University’s introductory architecture text and MIT’s computation-structures lecture notes explain the concept through this familiar model.
#1 Best Overall
What is the shared-memory tradeoff?
In the basic von Neumann arrangement, instructions and data use the same memory system. Their transfers can therefore compete for access, constraining how they move through the system. This is a tradeoff associated with the shared-memory model—not a limitation inherent in the broader stored-program concept. Other memory organizations are possible. The University of Vermont’s course material distinguishes the stored-program paradigm from this particular organization.
Independent reader supportYour contribution helps us test, update, and keep practical guides available for everyone.When did the idea develop?
Course materials place the development of stored-program architectures in the 1940s: the University of Florida’s computer-organization text describes practical architecture work in the mid-1940s, while MIT’s lecture notes frame the von Neumann model as proposed in the late 1940s. These sources support a broad historical timeframe, not a claim that one person alone invented the concept. Its development involved multiple contributors, proposals, and machines.
Quick Recap
Rank #3
Rank #2
Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply.
