Understanding Distributed Systems

What is a deadlock in distributed systems?

• A method for optimizing resource allocation in distributed systems.

• A scenario where all processes are running efficiently without any waiting.

• A condition where resources are released automatically after a timeout.

• A situation in distributed systems where processes are unable to proceed due to mutual resource waiting.

Explain the concept of processor allocation algorithms.

• Processor allocation algorithms only focus on memory management.

• Processor allocation algorithms are irrelevant in modern computing.

• These algorithms are used exclusively for network resource allocation.

• Processor allocation algorithms manage CPU resource distribution among processes to optimize performance and fairness.

What is the significance of graph-theoretic approaches in deadlock detection?

• Graph-theoretic approaches provide a systematic method for detecting deadlocks by modeling resource allocation and process states as a graph, enabling cycle detection.

• Graph-theoretic methods complicate the process of resource management.

• Graph-theoretic approaches are only useful for optimizing resource allocation.

• Deadlock detection is primarily based on timeouts rather than graph models.

Describe the centralized processor allocation algorithm.

• Centralized processor allocation algorithm manages CPU resource allocation through a central authority that schedules processes based on criteria like priority and fairness.

• The centralized processor allocation algorithm distributes CPU resources equally among all processes without considering priority.

• The centralized processor allocation algorithm is a decentralized method that relies on multiple authorities to manage CPU allocation.

• The centralized processor allocation algorithm allows each process to allocate its own CPU resources independently.

What are the advantages of hierarchical processor allocation?

• Advantages of hierarchical processor allocation include improved scalability, better resource utilization, enhanced performance, and easier fault isolation.

• Limited flexibility in processor allocation

• Increased complexity in resource management

• Higher costs for implementation

Differentiate between sender-initiated and receiver-initiated deadlock detection.

• Both methods rely on a third party to detect deadlocks.

• Sender-initiated deadlock detection relies on the sender to check for deadlocks, while receiver-initiated deadlock detection relies on the receiver to monitor and detect deadlocks.

• Sender-initiated deadlock detection is faster than receiver-initiated.

• Receiver-initiated deadlock detection requires more resources than sender-initiated.

What is the bidding algorithm in processor allocation?

• The bidding algorithm assigns processor time equally to all processes.

• The bidding algorithm allocates processor time based on bids from processes.

• The bidding algorithm randomly allocates processor time.

• The bidding algorithm prioritizes processes based on their memory usage.

How does scheduling work in distributed systems?

• Distributed systems do not require any scheduling mechanisms.

• Scheduling in distributed systems involves allocating resources and managing tasks across multiple nodes to ensure efficient execution.

• Tasks are executed in a random order without resource allocation.

• Scheduling is only done on a single machine.

What are the common types of faults in distributed systems?

• Network faults

• Software bugs

• Crash faults, omission faults, timing faults, arbitrary faults.

• Hardware faults

Explain the difference between component faults and system failures.

• Component faults are issues in individual parts, while system failures are when the entire system fails to function.

• Component faults affect the entire system, while system failures are minor issues.

• System failures are always caused by component faults.

• Component faults are temporary issues, while system failures are permanent problems.