Diksha Patro has Published 123 Articles

Lottery Process Scheduling in Operating System

Diksha Patro

Diksha Patro

Updated on 04-May-2023 12:26:08

1K+ Views

Introduction Lottery scheduling is a process scheduling algorithm used in operating systems that assign processes a fixed number of "lottery tickets" based on their priority, determining their likelihood of execution. In this article, we will talk about the lottery process scheduling algorithm, and how can manipulate tickets using the same. ... Read More

Longest Remaining Time First (LRTF) or Preemptive Longest Job First CPU Scheduling Algorithm

Diksha Patro

Diksha Patro

Updated on 04-May-2023 12:23:47

3K+ Views

The Longest Remaining Time First (LRTF) scheduling algorithm is a variant of the Longest Job First (LJF) algorithm and is used by the operating system to schedule incoming processes. In LRTF, the process with the highest remaining execution time is given the highest priority and scheduled to be executed first. ... Read More

Longest Job First (LJF) CPU Scheduling Algorithm

Diksha Patro

Diksha Patro

Updated on 04-May-2023 12:20:58

3K+ Views

Longest Job First (LJF) is a CPU scheduling algorithm that prioritizes processes based on their burst time. In LJF, the processes with the largest burst time are given priority over the shorter ones. This algorithm works on a non-preemptive basis, meaning once a process is started, it will continue to ... Read More

Logical Clock in Distributed System

Diksha Patro

Diksha Patro

Updated on 03-May-2023 18:13:29

9K+ Views

In a distributed system, multiple machines are working together, and each machine may have its own clock. still, these clocks may not be accompanied with each other, and there's no single clock that can be used to order events globally. Logical clocks give a way to handle this by assigning ... Read More

Lock Variable Mechanism

Diksha Patro

Diksha Patro

Updated on 03-May-2023 17:30:20

2K+ Views

Introduction A lock variable is a mechanism in computer science that allows multiple threads or processes to mutually exclude each other and synchronize access to shared resources. The lock variable has become a simple data structure that typically takes the form of a boolean or integer and is employed to ... Read More

Livelock in Operating System

Diksha Patro

Diksha Patro

Updated on 03-May-2023 17:29:29

2K+ Views

Introduction Livelock is a phenomenon that may happen in distributed systems, such as Linux and Windows, when multiple processes or strings constantly alter their states in reaction to changes in the state of other threads or processes, but neither of them may advance toward their goal. Livelock and deadlock are ... Read More

List scheduling in Operating System

Diksha Patro

Diksha Patro

Updated on 03-May-2023 17:27:18

406 Views

Introduction List scheduling is an operating system technique for managing the execution of processes in a computer system. It entails making a list of processes to be carried out and then scheduling them based on their priority or other criteria. In this article, we will explore the necessary things to ... Read More

Linux System Call in Detail

Diksha Patro

Diksha Patro

Updated on 03-May-2023 17:20:49

8K+ Views

Introduction The system call is a mechanism in Linux that allows user-space applications to connect with the kernel, which is also a component of what makes up the operating system's core. A user-space application needs to send a system call to the kernel that is used to have a privileged ... Read More

Linked List for Dynamic Partitioning

Diksha Patro

Diksha Patro

Updated on 03-May-2023 17:20:02

523 Views

A linked list is made up of nodes, each of which has a data element and a pointer (or reference) to the node after it in the list. Each node in dynamic partitioning represents a memory block that can be assigned to a process. The linked list initially reflects the ... Read More

Linked List Allocation

Diksha Patro

Diksha Patro

Updated on 03-May-2023 17:03:06

9K+ Views

A dynamic memory allocation method used in computer programming is called linked list allocation. In this method, a linked list data structure is used to distribute memory. Memory is divided into a number of blocks of similar size when allocating a linked list. In the linked list, each block is ... Read More

Previous 1 ... 5 6 7 8 9 ... 13 Next
Advertisements