Scribd
Upload
10 views4 pages

Shared Memory Model Message Passing Model: Types of Clock Synchronization

Uploaded by

Harini
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views4 pages

Shared Memory Model Message Passing Model: Types of Clock Synchronization

Uploaded by

Harini
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1.

Key components in RPC communication

There are five components in the RPC architecture. These are client, client stub, RPC runtime, server
stub, and server.

2.Message passing differs from shared memory communication

Shared Memory Model Message Passing Model


1. The shared memory A message passing
region is used for facility is used for
communication. communication.
2. It is used for It is typically used in a
communication between distributed environment
processes on a single where communicating
processor or processes reside on
multiprocessor systems remote machines
where the communicating connected through a
processes reside on the network
same machine as the
communicating processes
share a common address
space
3. The code for reading and No such code required
writing the data from the here as the message
shared memory should be passing facility provides
written explicitly by the mechanism for
Application programmer. communication and
synchronization of actions
performed by the
communicating processes.

3.types of clock synchronization

Types of Clock Synchronization


 Physical clock synchronization
 Logical clock synchronization
 Mutual exclusion synchronization

4.various features of distributed file system

User mobility
It will automatically bring the user’s home directory to the node where the user logs in.
Performance
Performance is based on the average amount of time needed to convince the client requests.
Simplicity and ease of use
The user interface of a file system should be simple and the number of commands in the file should be
small.
High availability
A Distributed File System should be able to continue in case of any partial failures like a link failure, a node
failure, or a storage drive crash.

5.performance of algorithms of mutual exclusion evaluated


Safety: At most one process may execute in the critical section (CS) at a time.

Liveness: Requests to enter and exit the critical section eventually succeed.
 Causal ordering: If one request to enter the CS happened-before another, then entry to the CS is granted
in that order

6.four fundamental properties that guarantee transactional integrity within distributed systems

7.locking mechanisms in distributed transactions is more complex than in centralized transactions

 Due to the distributed nature, locks must be coordinated among multiple nodes.
 Deadlocks and network partitioning must be handled carefully.
 Lock management and enforcement require communication overhead.

8.election algorithms ensure that only one node becomes the leader

Election algorithms ensure that only one node becomes the leader in distributed systems, preventing
conflicts and ensuring efficient coordination. By electing a single leader based on predefined criteria
like highest priority or ID, these algorithms establish a clear hierarchy within the system. This ensures
consistency and coordination, crucial for maintaining system integrity and reliability.

9.challenges with Distributed transactions and concurrency control


i Data may be accessed by multiple users at a number of distant sites. This may cause inconsistent
retrieval and update problems.
ii Database is fragmented and/or replicated across multiple sites.
iii Concurrency control techniques implemented at one location must ensure the consistency of the
database at all other sites.

10.timestamp ordering is considered an optimistic concurrency control

10. Timestamp ordering in distributed systems assigns unique timestamps to transactions,


allowing them to proceed independently without locking shared resources; conflicts
are resolved at commit time based on timestamps.

11.the message passing paradigm

Message passing in distributed systems refers to the communication medium used by nodes (computers
or processes) to commute information and coordinate their actions. It involves transferring and entering
messages between nodes to achieve various goals such as coordination, synchronization, and data
sharing.
12.various forms of group communication

13.architecture of the distributed file systems with diagram

A distributed file system (DFS) is a file system that enables clients to access file storage from multiple
hosts through a computer network as if the user was accessing local storage. Files are spread across
multiple storage servers and in multiple locations, which enables users to share data and storage
resources.

14.distributed mutual exclusion


10. Distributed mutual exclusion ensures only one process accesses a critical section at a
time across multiple nodes, preventing conflicts and maintaining data consistency in
distributed environments.

15.term global state refers to in the context of distributed systems

10. Global state in distributed systems refers to the collective status of all processes and
communication channels at a specific time, crucial for diagnosing system behavior,
ensuring consistency, and detecting faults.

16.the architecture of distributed web based system with its key

10. The architecture of distributed web-based systems consists of layers like presentation,
application logic, and data storage, leveraging technologies for scalability, fault
tolerance, and performance optimization.

17.define a transaction and importance of concurrency control

A Transaction consists of a series of read or write operation performed on a database. The read or write
operation performs a specific unit of work. A transaction is a collection of read/write operations
succeeding only if all contained operations succeed.

i Faster execution and response


ii Improved performance
iii It helps ensure serializability
iv Reliability

18. Flat and nested transactions differ in transactional structure

10. Flat transactions are single, independent units of work, while nested transactions
contain sub-transactions with hierarchical control over transaction boundaries and
error handling.

19. Key steps in 2pc protocol

10. In the two-phase commit (2PC) protocol, a coordinator asks participants to prepare for
committing a transaction; if all agree, the coordinator commits; otherwise, it aborts,
ensuring atomicity across distributed nodes.

20. Locks utilised in distributed transactions and contribution

10. Locks in distributed transactions, including distributed lock managers and timestamp-
based protocols, coordinate access to shared resources, ensuring data integrity and
transactional correctness.

You might also like