Marshalling in Distributed System
Last Updated :
31 Jul, 2024
A Distributed system consists of numerous components located on different machines that communicate and coordinate operations to seem like a single system to the end-user.
External Data Representation:
Data structures are used to represent the information held in running applications. The information consists of a sequence of bytes in messages that are moving between components in a distributed system. So, conversion is required from the data structure to a sequence of bytes before the transmission of data. On the arrival of the message, data should also be able to be converted back into its original data structure.
Different types of data are handled in computers, and these types are not the same in every position where data must be transmitted. Individual primitive data items can have a variety of data values, and not all computers store primitive values like integers in the same order. Different architectures also represent floating-point numbers differently. Integers are ordered in two ways, big-endian order, in which the Most Significant Byte (MSB) is placed first, and little-endian order, in which the Most Significant Byte (MSB) is placed last or the Least Significant Byte (LSB) is placed first. Furthermore, one more issue is the set of codes used to represent characters. Most applications on UNIX systems use ASCII character coding, which uses one byte per character, whereas the Unicode standard uses two bytes per character and allows for the representation of texts in many different languages.
There should be a means to convert all of this data to a standard format so that it can be sent successfully between computers. If the two computers are known to be of the same type, the external format conversion can be skipped otherwise before transmission, the values are converted to an agreed-upon external format, which is then converted to the local format on receiving. For that, values are sent in the sender’s format, along with a description of the format, and the recipient converts them if necessary. It’s worth noting, though, that bytes are never changed during transmission. Any data type that can be supplied as a parameter or returned, as a result, must be able to be converted and the individual primitive data values expressed in an accepted format to support Remote Procedure Call (RPC) or Remote Method Invocation (RMI) mechanisms. So, an external data representation is a standard for representing data structures and primitive values that have been agreed upon.
- Marshalling: Marshalling is the process of transferring and formatting a collection of data structures into an external data representation type appropriate for transmission in a message.
- Unmarshalling: The converse of this process is unmarshalling, which involves reformatting the transferred data upon arrival to recreate the original data structures at the destination.
Approaches:
There are three ways to successfully communicate between various sorts of data between computers.
1. Common Object Request Broker Architecture (CORBA):
CORBA is a specification defined by the Object Management Group (OMG) that is currently the most widely used middleware in most distributed systems. It allows systems with diverse architectures, operating systems, programming languages, and computer hardware to work together. It allows software applications and their objects to communicate with one another. It is a standard for creating and using distributed objects. It is made up of five major components. Components and their function are given below:
- Object Request Broker (ORB): It provides a communication infrastructure for the objects to communicate across a network.
- Interface Definition Language (IDL): It is a specification language used to provide an interface in a software component. To exemplify, it allows communication between software components written in C++ and Java.
- Dynamic Invocation Interface (DII): Using DII, client applications are permitted to use server objects without even knowing their types at compile time. Here client obtains an instance of a CORBA object and then invocation requests can be made dynamically on the corresponding object.
- Interface Repository (IR): As the name implies, interfaces can be added to the interface repository. The purpose of IR is that a client should be able to find an object which is not known at compile-time and information about its interface then request is made to be sent to ORB.
- Object Adapter (OA): It is used to access ORB services like object reference generation.

Data Representation in CORBA:
Common Data Representation (CDR) is used to describe structured or primitive data types that are supplied as arguments or results during remote invocations on CORBA distributed objects. It allows clients and servers’ built-in computer languages to communicate with one another. To exemplify, it converts little-endian to big-endian.
There are 15 primitive types: short (16-bit), long (32-bit), unsigned short, unsigned long, float (32-bit), double (64-bit), char, boolean (TRUE, FALSE), octet (8-bit), and any (which can represent any basic or constructed type), as well as a variety of composite types.
CORBA CDR Constructed Types:
Let’s have a look at Types with their representation:
- sequence: It refers to length (unsigned long) to be followed by elements in order
- string: It refers to length (unsigned long) followed by characters in order (can also have wide characters)
- array: The elements of the array follow order and length is fixed so not specified.
- struct: in the order of declaration of components
- enumerated: It is unsigned long and here, the values are specified by the order declared.
- union: type tag followed by the selected member
Example:
struct Person {
string name;
string place;
long year;
};
Marshalling CORBA:
From the specification of the categories of data items to be transmitted in a message, Marshalling CORBA operations can be produced automatically. CORBA IDL describes the types of data structures and fundamental data items and provides a language/notation for specifying the types of arguments and results of RMI methods.
2. Java’s Object Serialization:
Java Remote Method Invocation (RMI) allows you to pass both objects and primitive data values as arguments and method calls. In Java, the term serialization refers to the activity of putting an object (an instance of a class) or a set of related objects into a serial format suitable for saving to disk or sending in a message.
Java provides a mechanism called object serialization. This allows an object to be represented as a sequence of bytes containing information about the object’s data and the type of object and the type of data stored in the object. After the serialized object is written to the file, it can be read from the file and deserialized. You can recreate an object in memory with type information and bytes that represent the object and its data.
Moreover, objects can be serialized on one platform and deserialized on completely different platforms as the whole process is JVM independent.
For example, the Java class equivalent to the Person struct defined in CORBA IDL might be:
Java
import java.io.*;
public class Person implements Serializable {
public String name;
public String place;
public int phonenumber;
public void letter() {
System.out.println("Issue a letter to " + name + " " + place);
}
}
3. Extensible Markup Language (XML):
Clients communicate with web services using XML, which is also used to define the interfaces and other aspects of web services. However, XML is utilized in a variety of different applications, including archiving and retrieval systems; while an XML archive is larger than a binary archive, it has the advantage of being readable on any machine. Other XML applications include the design of user interfaces and the encoding of operating system configuration files.
In contrast to HTML, which employs a fixed set of tags, XML is extensible in the sense that users can construct their tags. If an XML document is meant to be utilized by several applications, the tag names must be unique.
Clients, for example, typically interface with web servers via SOAP messages. SOAP is an XML standard with tags that web services and their customers can utilize. Because it is expected that the client and server sharing a message have prior knowledge of the order and types of information it contains, some external data representations (such as CORBA CDR) do not need to be self-describing. On the other hand, XML was designed to be utilized by a variety of applications for a variety of reasons. This has been made possible by the inclusion of tags and the usage of namespaces to specify the meaning of the tags. Furthermore, the usage of tags allows applications to pick only the portions of a document that they need to process.
Example:
XML definition of the Person struct:
<person id="9865">
<name>John</name>
<place>England</place>
<year>1876</year>
<!-- comment -->
</person>
Usage:
Marshalling is used to create various remote procedure call (RPC) protocols, where separate processes and threads often have distinct data formats, necessitating the need for marshalling between them.
To transmit data across COM object boundaries, the Microsoft Component Object Model (COM) interface pointers employ marshalling. When a common-language-runtime-based type has to connect with other unmanaged types via marshalling, the same thing happens in the.NET framework. DCOM stands for Distributed Component Object Model.

Scripts and applications based on the Cross-Platform Component Object Model (XPCOM) technology are two further examples where marshalling is crucial. The Mozilla Application Framework makes heavy use of XPCOM, which makes considerable use of marshalling.
So, XML (Extensible Markup Language) is a text-based format for expressing structured data. It was designed to represent data sent in messages exchanged by clients and servers in web services
The primitive data types are marshalled into a binary form in the first two ways- CORBA and Java’s object serialization. The primitive data types are expressed textually in the third technique (XML). A data value’s textual representation will typically be longer than its binary representation. The HTTP protocol is another example of the textual approach.
On the other hand, type information is included in both Java serialization and XML, but in distinct ways. Although Java serializes all of the essential type information, XML documents can refer to namespaces, which are externally specified groups of names (with types).
Similar Reads
Distributed Systems Tutorial
A distributed system is a system of multiple nodes that are physically separated but linked together using the network. Each of these nodes includes a small amount of the distributed operating system software. Every node in this system communicates and shares resources with each other and handles pr
8 min read
Introduction to Distributed System
What is a Distributed System?
A distributed system is a collection of independent computers that appear to the users of the system as a single coherent system. These computers or nodes work together, communicate over a network, and coordinate their activities to achieve a common goal by sharing resources, data, and tasks. Table
7 min read
Features of Distributed Operating System
A Distributed Operating System manages a network of independent computers as a unified system, providing transparency, fault tolerance, and efficient resource management. It integrates multiple machines to appear as a single coherent entity, handling complex communication, coordination, and scalabil
9 min read
Evolution of Distributed Computing Systems
In this article, we will see the history of distributed computing systems from the mainframe era to the current day to the best of my knowledge. It is important to understand the history of anything in order to track how far we progressed. The distributed computing system is all about evolution from
8 min read
Types of Transparency in Distributed System
In distributed systems, transparency plays a pivotal role in abstracting complexities and enhancing user experience by hiding system intricacies. This article explores various types of transparencyâranging from location and access to failure and securityâessential for seamless operation and efficien
6 min read
What is Scalable System in Distributed System?
In distributed systems, a scalable system refers to the ability of a networked architecture to handle increasing amounts of work or expand to accommodate growth without compromising performance or reliability. Scalability ensures that as demand growsâwhether in terms of user load, data volume, or tr
10 min read
Middleware in Distributed System
In distributed systems, middleware is a software component that provides services between two or more applications and can be used by them. Middleware can be thought of as an application that sits between two separate applications and provides service to both. In this article, we will see a role of
7 min read
Difference between Hardware and Middleware
Hardware and Middleware are both parts of a Computer. Hardware is the combination of physical components in a computer system that perform various tasks such as input, output, processing, and many more. Middleware is the part of software that is the communication medium between application and opera
4 min read
What is Groupware in Distributed System?
Groupware in distributed systems refers to software designed to support collaborative activities among geographically dispersed users, enhancing communication, coordination, and productivity across diverse and distributed environments. Important Topics for Groupware in Distributed System What is Gro
6 min read
Difference between Parallel Computing and Distributed Computing
IntroductionParallel Computing and Distributed Computing are two important models of computing that have important roles in todayâs high-performance computing. Both are designed to perform a large number of calculations breaking down the processes into several parallel tasks; however, they differ in
5 min read
Difference between Loosely Coupled and Tightly Coupled Multiprocessor System
When it comes to multiprocessor system architecture, there is a very fine line between loosely coupled and tightly coupled systems, and this is why that difference is very important when choosing an architecture for a specific system. A multiprocessor system is a system in which there are two or mor
6 min read
Design Issues of Distributed System
A distributed System is a collection of autonomous computer systems that are physically separated but are connected by a centralized computer network that is equipped with distributed system software. These are used in numerous applications, such as online gaming, web applications and cloud computin
7 min read
Introduction to Distributed Computing Environment (DCE)
The Benefits of Distributed Systems have been widely recognized. They are due to their ability to Scale, Reliability, Performance, Flexibility, Transparency, Resource-sharing, Geo-distribution, etc. In order to use the advantages of Distributed Systems, appropriate support and environment are needed
3 min read
Limitations of Distributed Systems
Distributed systems are essential for modern computing, providing scalability and resource sharing. However, they face limitations such as complexity in management, performance bottlenecks, consistency issues, and security vulnerabilities. Understanding these challenges is crucial for designing robu
9 min read
Various Failures in Distributed System
DSM implements distributed systems shared memory model in an exceedingly distributed system, that hasnât any physically shared memory. The shared model provides a virtual address space shared between any numbers of nodes. The DSM system hides the remote communication mechanism from the appliance aut
3 min read
Types of Operating Systems
Operating Systems can be categorized according to different criteria like whether an operating system is for mobile devices (examples Android and iOS) or desktop (examples Windows and Linux). Here, we are going to classify based on functionalities an operating system provides. 8 Main Operating Syste
11 min read
Types of Distributed System
Pre-requisites: Distributed System A Distributed System is a Network of Machines that can exchange information with each other through Message-passing. It can be very useful as it helps in resource sharing. It enables computers to coordinate their activities and to share the resources of the system
8 min read
Centralized vs. Decentralized vs. Distributed Systems
Understanding the architecture of systems is crucial for designing efficient and effective solutions. Centralized, decentralized, and distributed systems each offer unique advantages and challenges. Centralized systems rely on a single point of control, providing simplicity but risking a single poin
8 min read
Three-Tier Client Server Architecture in Distributed System
The Three-Tier Client-Server Architecture divides systems into presentation, application, and data layers, increasing scalability, maintainability, and efficiency. By separating the concerns, this model optimizes resource management and allows for independent scaling and updates, making it a popular
7 min read
Communication in Distributed Systems
Remote Procedure Calls in Distributed System
What is Remote Procedural Call (RPC) Mechanism in Distributed System?
A remote Procedure Call (RPC) is a protocol in distributed systems that allows a client to execute functions on a remote server as if they were local. RPC simplifies network communication by abstracting the complexities, making it easier to develop and integrate distributed applications efficiently.
9 min read
Distributed System - Transparency of RPC
RPC is an effective mechanism for building client-server systems that are distributed. RPC enhances the power and ease of programming of the client/server computing concept. A transparent RPC is one in which programmers can not tell the difference between local and remote procedure calls. The most d
3 min read
Stub Generation in Distributed System
A stub is a piece of code that translates parameters sent between the client and server during a remote procedure call in distributed computing. An RPC's main purpose is to allow a local computer (client) to call procedures on another computer remotely (server) because the client and server utilize
3 min read
Marshalling in Distributed System
A Distributed system consists of numerous components located on different machines that communicate and coordinate operations to seem like a single system to the end-user. External Data Representation: Data structures are used to represent the information held in running applications. The informatio
9 min read
Server Management in Distributed System
Effective server management in distributed systems is crucial for ensuring performance, reliability, and scalability. This article explores strategies and best practices for managing servers across diverse environments, focusing on configuration, monitoring, and maintenance to optimize the operation
12 min read
Distributed System - Parameter Passing Semantics in RPC
A Distributed System is a Network of Machines that can exchange information with each other through Message-passing. It can be very useful as it helps in resource sharing. In this article, we will go through the various Parameter Passing Semantics in RPC in distributed Systems in detail. Parameter P
4 min read
Distributed System - Call Semantics in RPC
This article will go through the Call Semantics, its types, and the issues in RPC in distributed systems in detail. RPC has the same semantics as a local procedure call, the calling process calls the procedure, gives inputs to it, and then waits while it executes. When the procedure is finished, it
3 min read
Communication Protocols For RPCs
This article will go through the concept of Communication protocols for Remote Procedure Calls (RPCs) in Distributed Systems in detail. Communication Protocols for Remote Procedure Calls:The following are the communication protocols that are used: Request ProtocolRequest/Reply ProtocolThe Request/Re
5 min read
Client-Server Model
The Client-server model is a distributed application structure that partitions tasks or workloads between the providers of a resource or service, called servers, and service requesters called clients. In the client-server architecture, when the client computer sends a request for data to the server
4 min read
Lightweight Remote Procedure Call in Distributed System
Lightweight Remote Procedure Call is a communication facility designed and optimized for cross-domain communications in microkernel operating systems. For achieving better performance than conventional RPC systems, LRPC uses the following four techniques: simple control transfer, simple data transfe
5 min read
Difference Between RMI and DCOM
In this article, we will see differences between Remote Method Invocation(RMI) and Distributed Component Object Model(DCOM). Before getting into the differences, let us first understand what each of them actually means. RMI applications offer two separate programs, a server, and a client. There are
2 min read
Difference between RPC and RMI
RPC stands for Remote Procedure Call which supports procedural programming. It's almost like an IPC mechanism wherever the software permits the processes to manage shared information Associated with an environment wherever completely different processes area unit death penalty on separate systems an
2 min read
Synchronization in Distributed System
Synchronization in Distributed Systems
Synchronization in distributed systems is crucial for ensuring consistency, coordination, and cooperation among distributed components. It addresses the challenges of maintaining data consistency, managing concurrent processes, and achieving coherent system behavior across different nodes in a netwo
11 min read
Logical Clock in Distributed System
In distributed systems, ensuring synchronized events across multiple nodes is crucial for consistency and reliability. Enter logical clocks, a fundamental concept that orchestrates event ordering without relying on physical time. By assigning logical timestamps to events, these clocks enable systems
10 min read
Lamport's Algorithm for Mutual Exclusion in Distributed System
Prerequisite: Mutual exclusion in distributed systems Lamport's Distributed Mutual Exclusion Algorithm is a permission based algorithm proposed by Lamport as an illustration of his synchronization scheme for distributed systems. In permission based timestamp is used to order critical section request
5 min read
Vector Clocks in Distributed Systems
Vector clocks are a basic idea in distributed systems to track the partial ordering of events and preserve causality across various nodes. Vector clocks, in contrast to conventional timestamps, offer a means of establishing the sequence of events even when there is no world clock, which makes them e
10 min read
Event Ordering in Distributed System
In this article, we will look at how we can analyze the ordering of events in a distributed system. As we know a distributed system is a collection of processes that are separated in space and which can communicate with each other only by exchanging messages this could be processed on separate compu
4 min read
Mutual exclusion in distributed system
Mutual exclusion is a concurrency control property which is introduced to prevent race conditions. It is the requirement that a process can not enter its critical section while another concurrent process is currently present or executing in its critical section i.e only one process is allowed to exe
5 min read
Performance Metrics For Mutual Exclusion Algorithm
Mutual exclusion is a program object that refers to the requirement of satisfying that no two concurrent processes are in a critical section at the same time. It is presented to intercept the race condition. If a current process is accessing the critical section then it prevents entering another con
4 min read
Cristian's Algorithm
Cristian's Algorithm is a clock synchronization algorithm is used to synchronize time with a time server by client processes. This algorithm works well with low-latency networks where Round Trip Time is short as compared to accuracy while redundancy-prone distributed systems/applications do not go h
8 min read
Berkeley's Algorithm
Berkeley's Algorithm is a clock synchronization technique used in distributed systems. The algorithm assumes that each machine node in the network either doesn't have an accurate time source or doesn't possess a UTC server.Algorithm 1) An individual node is chosen as the master node from a pool node
6 min read
Difference between Token based and Non-Token based Algorithms in Distributed System
A distributed system is a system in which components are situated in distinct places, these distinct places refer to networked computers which can easily communicate and coordinate their tasks by just exchanging asynchronous messages with each other. These components can communicate with each other
3 min read
RicartâAgrawala Algorithm in Mutual Exclusion in Distributed System
Prerequisite: Mutual exclusion in distributed systems RicartâAgrawala algorithm is an algorithm for mutual exclusion in a distributed system proposed by Glenn Ricart and Ashok Agrawala. This algorithm is an extension and optimization of Lamport's Distributed Mutual Exclusion Algorithm. Like Lamport'
3 min read
SuzukiâKasami Algorithm for Mutual Exclusion in Distributed System
Prerequisite: Mutual exclusion in distributed systems SuzukiâKasami algorithm is a token-based algorithm for achieving mutual exclusion in distributed systems.This is modification of RicartâAgrawala algorithm, a permission based (Non-token based) algorithm which uses REQUEST and REPLY messages to en
3 min read
Source Management and Process Management
Distributed File System and Distributed shared memory
What is DFS (Distributed File System)?
A Distributed File System (DFS) is a file system that is distributed on multiple file servers or multiple locations. It allows programs to access or store isolated files as they do with the local ones, allowing programmers to access files from any network or computer. In this article, we will discus
8 min read
Andrew File System
The Andrew File System (AFS) is a distributed file system that allows multiple computers to share files and data seamlessly. It was developed by Morris ET AL. in 1986 at Carnegie Mellon University in collaboration with IBM. AFS was designed to make it easier for people working on different computers
5 min read
File Service Architecture in Distributed System
File service architecture in distributed systems manages and provides access to files across multiple servers or locations. It ensures efficient storage, retrieval, and sharing of files while maintaining consistency, availability, and reliability. By using techniques like replication, caching, and l
12 min read
File Models in Distributed System
File Models in Distributed Systems" explores how data organization and access methods impact efficiency across networked nodes. This article examines structured and unstructured models, their performance implications, and the importance of scalability and security in modern distributed architectures
7 min read
File Accessing Models in Distributed System
In Distributed File Systems (DFS), multiple machines are used to provide the file systemâs facility. Different file system utilize different conceptual models of a file. The two most usually involved standards for file modeling are structure and modifiability. File models in view of these standards
4 min read
File Caching in Distributed File Systems
File caching enhances I/O performance because previously read files are kept in the main memory. Because the files are available locally, the network transfer is zeroed when requests for these files are repeated. Performance improvement of the file system is based on the locality of the file access
12 min read
What is Replication in Distributed System?
Replication in distributed systems involves creating duplicate copies of data or services across multiple nodes. This redundancy enhances system reliability, availability, and performance by ensuring continuous access to resources despite failures or increased demand. Important Topics for Replicatio
9 min read
Atomic Commit Protocol in Distributed System
In distributed systems, transactional consistency is guaranteed by the Atomic Commit Protocol. It coordinates two phasesâvoting and decisionâto ensure that a transaction is either fully committed or completely canceled on several nodes. Distributed TransactionsDistributed transaction refers to a tra
4 min read
Design Principles of Distributed File System
A distributed file system is a computer system that allows users to store and access data from multiple computers in a network. It is a way to share information between different computers and is used in data centers, corporate networks, and cloud computing. Despite their importance, the design of d
6 min read
What is Distributed Shared Memory and its Advantages?
Distributed shared memory can be achieved via both software and hardware. Hardware examples include cache coherence circuits and network interface controllers. In contrast, software DSM systems implemented at the library or language level are not transparent and developers usually have to program th
4 min read
Architecture of Distributed Shared Memory(DSM)
Distributed Shared Memory (DSM) implements the distributed systems shared memory model in a distributed system, that hasnât any physically shared memory. Shared model provides a virtual address area shared between any or all nodes. To beat the high forged of communication in distributed system. DSM
3 min read
Difference between Uniform Memory Access (UMA) and Non-uniform Memory Access (NUMA)
In computer architecture, and especially in Multiprocessors systems, memory access models play a critical role that determines performance, scalability, and generally, efficiency of the system. The two shared-memory models most frequently used are UMA and NUMA. This paper deals with these shared-mem
5 min read
Algorithm for implementing Distributed Shared Memory
Distributed shared memory(DSM) system is a resource management component of distributed operating system that implements shared memory model in distributed system which have no physically shared memory. The shared memory model provides a virtual address space which is shared by all nodes in a distri
3 min read
Consistency Model in Distributed System
It might be difficult to guarantee that all data copies in a distributed system stay consistent over several nodes. The guidelines for when and how data updates are displayed throughout the system are established by consistency models. Various approaches, including strict consistency or eventual con
6 min read
Distributed System - Thrashing in Distributed Shared Memory
In this article, we are going to understand Thrashing in a distributed system. But before that let us understand what a distributed system is and why thrashing occurs. In naive terms, a distributed system is a network of computers or devices which are at different places and linked together. Each on
4 min read
Distributed Scheduling and Deadlock
Scheduling and Load Balancing in Distributed System
In this article, we will go through the concept of scheduling and load balancing in distributed systems in detail. Scheduling in Distributed Systems:The techniques that are used for scheduling the processes in distributed systems are as follows: Task Assignment Approach: In the Task Assignment Appro
7 min read
Issues Related to Load Balancing in Distributed System
This article explores critical challenges and considerations in load balancing within distributed systems. Addressing factors like workload variability, network constraints, scalability needs, and algorithmic complexities are essential for optimizing performance and resource utilization across distr
6 min read
Components of Load Distributing Algorithm - Distributed Systems
In distributed systems, efficient load distribution is crucial for maintaining performance, reliability, and scalability. Load-distributing algorithms play a vital role in ensuring that workloads are evenly spread across available resources, preventing bottlenecks, and optimizing resource utilizatio
6 min read
Distributed System - Types of Distributed Deadlock
A Deadlock is a situation where a set of processes are blocked because each process is holding a resource and waiting for another resource occupied by some other process. When this situation arises, it is known as Deadlock. A Distributed System is a Network of Machines that can exchange information
4 min read
Deadlock Detection in Distributed Systems
Prerequisite - Deadlock Introduction, deadlock detection In the centralized approach of deadlock detection, two techniques are used namely: Completely centralized algorithm and Ho Ramamurthy algorithm (One phase and Two-phase). Completely Centralized Algorithm - In a network of n sites, one site is
2 min read
Conditions for Deadlock in Distributed System
This article will go through the concept of conditions for deadlock in distributed systems. Deadlock refers to the state when two processes compete for the same resource and end up locking the resource by one of the processes and the other one is prevented from acquiring that resource. Consider the
7 min read
Deadlock Handling Strategies in Distributed System
Deadlocks in distributed systems can severely disrupt operations by halting processes that are waiting for resources held by each other. Effective handling strategiesâdetection, prevention, avoidance, and recoveryâare essential for maintaining system performance and reliability. This article explore
11 min read
Deadlock Prevention Policies in Distributed System
A Deadlock is a situation where a set of processes are blocked because each process is holding a resource and waiting for a resource that is held by some other process. There are four necessary conditions for a Deadlock to happen which are: Mutual Exclusion: There is at least one resource that is no
4 min read
Chandy-Misra-Haas's Distributed Deadlock Detection Algorithm
Chandy-Misra-Haas's distributed deadlock detection algorithm is an edge chasing algorithm to detect deadlock in distributed systems. In edge chasing algorithm, a special message called probe is used in deadlock detection. A probe is a triplet (i, j, k) which denotes that process Pi has initiated the
4 min read
Security in Distributed System
Security in Distributed System
Securing distributed systems is crucial for ensuring data integrity, confidentiality, and availability across interconnected networks. Key measures include implementing strong authentication mechanisms, like multi-factor authentication (MFA), and robust authorization controls such as role-based acce
9 min read
Types of Cyber Attacks
Cyber Security is a procedure and strategy associated with ensuring the safety of sensitive information, PC frameworks, systems, and programming applications from digital assaults. Cyber assaults is general phrasing that covers an enormous number of themes, however, some of the common types of assau
10 min read
Cryptography and its Types
Cryptography is a technique of securing information and communications through the use of codes so that only those persons for whom the information is intended can understand and process it. Thus, preventing unauthorized access to information. The prefix "crypt" means "hidden" and the suffix "graphy
6 min read
Implementation of Access Matrix in Distributed OS
As earlier discussed access matrix is likely to be very sparse and takes up a large chunk of memory. Therefore direct implementation of access matrix for access control is storage inefficient. The inefficiency can be removed by decomposing the access matrix into rows or columns.Rows can be collapsed
5 min read
Digital Signatures and Certificates
Digital signatures and certificates are two key technologies that play an important role in ensuring the security and authenticity of online activities. They are essential for activities such as online banking, secure email communication, software distribution, and electronic document signing. By pr
10 min read
Design Principles of Security in Distributed System
Design Principles of Security in Distributed Systems explores essential strategies to safeguard data integrity, confidentiality, and availability across interconnected nodes. This article addresses the complexities and critical considerations for implementing robust security measures in distributed
11 min read
Distributed Multimedia and Database System
Distributed Database System
A distributed database is basically a database that is not limited to one system, it is spread over different sites, i.e, on multiple computers or over a network of computers. A distributed database system is located on various sites that don't share physical components. This may be required when a
5 min read
Functions of Distributed Database System
Distributed database systems play an important role in modern data management by distributing data across multiple nodes. This article explores their functions, including data distribution, replication, query processing, and security, highlighting how these systems optimize performance, ensure avail
10 min read
Multimedia Database
A Multimedia database is a collection of interrelated multimedia data that includes text, graphics (sketches, drawings), images, animations, video, audio etc and have vast amounts of multisource multimedia data. The framework that manages different types of multimedia data which can be stored, deliv
5 min read