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 ...
Operating System Process Scheduling Queues
The objective of multiprogramming is to have some process running at all times, to maximize CPU utilization. To meet these objectives, the process scheduler selects a process from a queue for execution on the CPU. More ...
Basic Computer Architecture
Basic computer architecture refers to the structure of a computer system and comprises its hardware, firmware, and software. Hardware consists of the physical components in computer architecture. The main hardware components of the computer architecture include the CPU, memory, and bus. More ...
Operating System Process Control Block
An Operating System Process is a program in execution. It includes the value in the program counter and in the processors registers. A process also includes a stack, data section, and a heap. Although two processes may be associated with the same program, they are considered two separate execution sequences. More ...
Basic Electronics for Computer Architecture
To understand computer architecture, it is necessary for you to have a basic understanding of electronics. This article explains how all the amazing things that can be done with electronics are the result of one simple thing - electric charge. More ...
Capacitors in DC Circuits
A capacitor is a component that can be used to store an electrical charge. A capacitor can be used to create a timer. This time delay can be used to smooth a changing current flow in a circuit, or it can be used to absorb spikes and prevent false triggering of other components. More ...
Real-Time CPU Scheduling
In a real-time systems, is one whose operation depends on timing. A task must be serviced within a specific time interval. The tasks and their execution times must all be known. More ...
Priority 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 priority CPU scheduling. More ...
Arduino Microcontroller Development Platform
The benefit of the open source Arduino Microcontroller Development Platform is that the software is free and the hardware is cheap. This makes it one of the cheapest platforms on which to develop prototypes. 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 ...
Challenges of Programming Multicore Systems
Operating system designers must write scheduling algorithms that use multiple processing cores and application programmers, mustmodify existing programs and design new programs that are multithreaded. More ...
Introduction to the Raspberry Pi
The Raspberry Pi is a tiny bare-bones computer motherboard. You can easily make it into a Linux PC by connecting your own keyboard, mouse, and display. More ...
