| Home | Week 01 | Week 02 | Week 03 | Week 04 | Week 05 | Week 06 | Week 07 | Week 08 | Github | Log | Rank | Key |
Scheduling in Real Time Systems
Real-time systems are systems that carry real-time tasks. These tasks need to be performed immediately with a certain degree of urgency. This website will tell you the details about real time scheduling in general and specific also the classification of scheduling algorithm.
CFS: Completely fair process scheduling in Linux
Completely fair scheduling (CFS), which became part of the Linux 2.6.23 kernel in 2007, is the scheduling class for normal (as opposed to real-time) processes and therefore is named SCHED_NORMAL. If you want to dig more about CFS, this website will help you to understand it because it contains the detail meaning of CFS, some core concepts, classic preemptive scheduling vs CFS, special features, and CFS implementation.
Difference between Preemptive and Cooperative Multitasking
Multitasking is the methodology of executing multiple tasks or processes concurrently over a period of time. Preemptive and cooperative multitasking are two types of multitasking. Many people still counfused about the difference between Preemptive and Cooperative Multitasking. But, don’t worry because this website will help you guys to know exactly the difference between two of them because it will discuss about definition of preemptive multitasking and cooperative multitasking, and difference between preemptive multitasking and cooperative multitasking in many aspects.
Explore load balancing
Load balancing is defined as the methodical and efficient distribution of network or application traffic across multiple servers in a server farm. Each load balancer sits between client devices and backend servers. This website contains the discussion about load balancers definition and how do they work, hardware- vs software-based load balancers, common load balancing algorithms, and why load balancing is necessary.
An Overview of Non-Uniform Memory Access
Non-uniform memory access (NUMA) is the phenomenon that memory at various points in the address space of a processor have different performance characteristics. If you are interested in NUMA, this website is a perfect way to learn because it will help you understand about NUMA specifically, how operating systems handle NUMA memory, and how does linux handle NUMA.
Multiple-Processor Scheduling in Operating System
Multiple processor scheduling or multiprocessor scheduling focuses on designing the scheduling function for the system which is consist of more than one processor. With multiple processors in the system, the load sharing becomes feasible but it makes scheduling more complex. This website will discuss about definition, keynotes, and techniques of of multiprocessor scheduling.
States of a Process
A process is a program in execution which then forms the basis of all computation. A process is an ‘active’ entity as opposed to the program which is considered to be a ‘passive’ entity. Attributes held by the process include hardware state, memory, CPU, etc. To undertanding the details of process states, this website will help you a lot because it contains about the different type of process states, CPU and IO bound processes, types of schedulers, multiprogramming, and degree of multiprogramming.
Understanding Thread Scheduling
Many computers have only one CPU, so threads must share the CPU with other threads. The execution of multiple threads on a single CPU, in some order, is called scheduling. If you still counfused about this topic, this website will guide you to understand more about it because it will discuss about two boundary scheduling involved by threads, Leightweight Process (LWP), contention scope, and allocation domain including each process of those two controls.
CPU Scheduling in Operating Systems
CPU scheduling is a process that allows one process to use the CPU while the execution of another process is on hold(in waiting state) due to unavailability of any resource like I/O etc, thereby making full use of CPU. For those who are interested in this topic, this website will help you to learn deaply about CPU scheduling because it contains about different time with respect to a process, wWhy we need scheduling, objectives of process scheduling algorithm, different scheduling algorithms, and many more.
What is Big O Notation Explained: Space and Time Complexity
Big O notation is a convenient way to describe how fast a function is growing. This website will dig more about what is Big O Notation and why does it matter, formal definition of Big O notation, Big O, Little O, Omega & Theta, complexity comparison between typical Big Os, time & space complexity, and best, average, worst, expected complexity.