DOS Quiz 2

What is a deadlock in distributed systems?

• A deadlock is a situation where resources are released automatically.

• A deadlock occurs when all processes are actively running without waiting.

• A deadlock happens when processes are able to communicate freely without restrictions.

• A deadlock is a situation in distributed systems where processes are stuck waiting for each other to release resources.

Name two methods for deadlock detection.

• Semaphore signals

• Thread priorities

• Mutex locks

• Resource allocation graphs, Wait-for graphs

What is the difference between user space and kernel space threads?

• User space threads require more system resources than kernel space threads.

• User space threads are faster than kernel space threads.

• User space threads are managed by user-level libraries, while kernel space threads are managed by the operating system kernel.

• Kernel space threads can only run in user mode.

Explain the concept of process in the context of threads.

• A process is a type of thread that cannot run concurrently.

• Threads are separate processes that do not share resources.

• A process is a single thread that executes independently.

• In the context of threads, a process is a container that holds multiple threads, sharing resources while executing concurrently.

What are the advantages of implementing threads in user space?

• Slower context switching

• Less control over scheduling

• Increased overhead in thread management

• Advantages of implementing threads in user space include faster context switching, greater control over scheduling, and reduced overhead in thread management.

Describe the graph-theoretic approach to processor allocation.

• The approach uses a tree structure to manage processor allocation.

• Tasks are assigned randomly without any graph representation.

• The graph-theoretic approach models processors and tasks as a bipartite graph to optimize allocation.

• Processors are allocated based on a linear programming model.

What is a centralized processor allocation algorithm?

• A method for managing and allocating processing resources from a single central point.

• A framework for real-time data processing in cloud environments.

• A technique for distributing processing tasks across multiple servers.

• A strategy for optimizing memory usage in distributed systems.

How does a hierarchical processor allocation algorithm work?

• It assigns tasks randomly to processors.

• It prioritizes tasks based on their execution time.

• It distributes tasks evenly across all processors.

• It allocates tasks to processors based on a hierarchy of priority levels.

What is the difference between sender-initiated and receiver-initiated deadlock detection?

• Sender-initiated deadlock detection involves the sender checking for deadlocks, while receiver-initiated detection involves the receiver monitoring for deadlocks.

• Sender-initiated detection is only used in distributed systems.

• Receiver-initiated detection is faster than sender-initiated detection.

• Sender-initiated detection requires both sender and receiver to check for deadlocks.

What is a bidding algorithm in processor allocation?

• A bidding algorithm allocates processors to tasks based on bids submitted by the tasks for resource allocation.

• A bidding algorithm is used to auction off processors to the highest bidder.

• A bidding algorithm randomly assigns processors to tasks without any criteria.

• A bidding algorithm allocates processors based on a fixed priority system without bids.