Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles by Diksha Patro
Page 5 of 10
Maekawa\'s Algorithm for Mutual Exclusion in Distributed System
Multiple processes may require concurrent access to common resources in a distributed system. Concurrent access to a shared resource, however, may result in mistakes and inconsistencies. A distributed mutual exclusion algorithm must be employed to manage access to shared resources in order to guarantee mutual exclusion. A distributed mutual exclusion technique, such as Maekawa's algorithm, ensures mutual exclusion between running processes in a distributed system. Only one process at a time can access a shared resource thanks to the algorithm, which is based on a voting system. Maekawa's algorithm A distributed mutual exclusion algorithm, such as Maekawa's algorithm, makes sure ...
Read MoreDifference between MacOS and OpenBSD
MacOS and OpenBSD are two independent operating systems with contrasting objectives and layout views. the firm's operating system, MacOS, has become confidential, though OpenBSD is an unrestricted open-source operating system that emphasizes privacy and software truthfulness. The choice across MacOS and OpenBSD is based on your specific needs and preferences. If you appreciate confidentiality and code preciseness and are comfortable with interacting with commands, OpenBSD could be a better choice. Below are a few of the beneficial effects of using MacOS and OpenBSD − Advantages of MacOS Simple-to-use graphical user interface − the operating system for Mac has ...
Read MoreLRU Cache implementation using Double Linked Lists
Caching is a technique to improve a computer's performance by storing frequently accessed data in a cache. The cache is a high-speed storage area in a computer. In this, data can be quickly retrieved from the cache rather than from slower main memory or disc storage whenever needed. Caching can be accomplished in a number of ways. This includes the use of a hash table, an array, or a linked list. In this article, we will explore the LRU Cache implementation using Double Linked Lists in detail. What is LRU Cache implementation? The Least Recently Used (LRU) algorithm is a ...
Read MoreLRU Approximation (Second Chance Algorithm)
Introduction In computer operating systems, the LRU (Least Recently Used) approximation algorithm, commonly called the Second Chance algorithm, is a page replacement algorithm. It is based on the principle that pages that haven't been used in a while are more likely to be replaced than pages that have. In this article, we will discuss the details, advantages, and disadvantages of this article. LRU Approximation Algorithm To keep track of which pages are currently in memory, the LRU approximation algorithm employs a circular buffer. Each page receives a reference bit, which is initially set to 0. When a page is accessed, ...
Read MoreLongest Job First (LJF) CPU Scheduling Algorithm
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 run until it completes, and no other process can preempt it. To implement the LJF algorithm, processes are sorted in the ready queue based on their burst times in descending order. The process with the largest burst time among all the processes that have arrived until that time is selected ...
Read MoreLogical Clock in Distributed System
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 each event a logical timestamp, which can be used to order events and establish reason between them, indeed if they do on different machines. In substance, logical clocks give a way to produce a virtual global timepiece that's consistent across all machines in a distributed system. Scalar Time Implementation There ...
Read MoreLock Variable Mechanism
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 denote the present condition of a resource. In this article, we will explore about Lock Variable Mechanism, how it occurs, and its various advantages and disadvantages. What is Lock Variable Mechanism? When an operating system or process needs to access a particular resource, it appears at the value of the ...
Read MoreLinux System Call in Detail
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 functioning performed on its behalf, including writing or reading information to a file or beginning a new process. In this article, we will be discussing the Linux System Call in detail along with its various types. How Linux System Calls Work? The system calls are carried out in the kernel ...
Read MoreLinked List for Dynamic Partitioning
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 whole memory block that is accessible. In this article, we will explore the Linked List for Dynamic Partitioning, what Dynamic Partitioning is in Memory Management, and also the implementation of Linked List in Dynamic Partitioning. Dynamic Partitioning in Memory Management Computer systems employ the memory management approach known as "dynamic ...
Read MoreLinked List Allocation
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 symbolized by a node. A pointer to the following piece of memory is present at each node in the linked list. The final node in the linked list has a null pointer that serves as a marker for the list's conclusion. Linked list data structure and its implementation in memory ...
Read More