Menu
Computer Architecture

Difference between Stack, Heap, and Queue
Stack, heap, and queue are ways that elements are stored in memory. Stack elements are added to the top of the stack, and removed from the top of the stack. The mnemonic LIFO is used to describe a stack (Last-In-First-Out). With a queue, the first one in is the first one out. The mnemonic FIFO is used to describe a queue. A heap is an area of memory where elements can be stored and removed in any order. More ...

CPU Process Memory Address Binding
For a program to run on a CPU it must be brought from files in long-term, non-volatile storage to main memory. Addresses in the source program must be mapped to addresses in main memory. More ...

Intel's Dual-Core Core i3 Processor
Core i3 is an entry-level 2-core processor using the 32nm Westmere micro-architecture. With a Thermal Design Power (TDP) of 73 watts, the i3-530 is a cool-running chip that doesn't gobble loads of electricity, so those looking for a power-efficient, quiet machine will be happy with it. More ...

First-Come, First-Served CPU Scheduling Algorithm
CPU Scheduling deals with the problem of deciding which of the processes in the ready queue is to be alocated the CPU. There are many different CPU scheduling algorithms. In this article we describe first-come, first-served scheduling. More ...

Electronic Circuits Basics
This article's main target is to teach the electronics language to readers that are not familiar with electronics by using a group of rules and simple equations that describe the behavior of every electronic component and the relationship between the components in the circuit. More ...

Direct Memory Access (DMA)
In early computers, all data transfers required the processor to read and write single words from memory until the entire transfer is complete. With DMA, the DMA controller takes control of the system buses to move data between the device and main memory. More ...

Operating System Boot
The procedure of starting a computer by loading the kernel is known as booting the system. On most computer systems, a small piece of code known as the bootstrap program or bootstrap loader locates the kernel loads it into main memory, and starts its execution. More ...

The Many Processes of Silicon Wafer Manufacturing
A silicon wafer is a thin, circular disc used in the manufacture of integrated circuits and semiconductors. The silicon wafer manufacturing process is interesting. More ...

Operating System Memory Paging Hardware Support
Paging is a memory management scheme that involves breaking physical memory into fixed-sized blocks and breaking logical memory into blocks of the same size called pages. When a process is to be executed, its pages are loaded into any available memory blocks. More ...

Multilevel Queue CPU Scheduling Algorithm
With many CPU scheduling algorithms, all processes are placed in a single queue, and the scheduler selects the process to run. In practice, it is often easier to have separate queues for each priority, and the scheduler simply selects the process in the highest-priority queue. More ...

Microcontroller Registers
Registers are special small memory locations where the microcontroller can write data to or read data from. Special function registers help point to main memory locations, indicate the result of a mathematical operation, hold parts of an instruction or indicate the status of some operation or hardware feature. Some registers are general purpose and may be used by the programmer at their own discretion. More ...

Virtual Memory and Memory Paging
In the early days of computers, memory chips were small capacity, scarce, and expensive. Because of this a memory management scheme called paging was invented. More ...


Learn more at amazon.com

Custom Search