Exam 18: Distributed Process Management
Exam 1: Computer Systems Overview45 Questions
Exam 2: Operating System Overview45 Questions
Exam 3: Process Description and Control45 Questions
Exam 4: Threads45 Questions
Exam 5: Concurrency: Mutual Exclusion and Synchronization45 Questions
Exam 6: Concurrency: Deadlock and Starvation45 Questions
Exam 7: Memory Management45 Questions
Exam 8: Virtual Memory45 Questions
Exam 9: Uniprocessor Scheduling45 Questions
Exam 10: Multiprocessor and Real-Time Scheduling45 Questions
Exam 11: Io Management and Disk Scheduling45 Questions
Exam 12: File Management45 Questions
Exam 13: Embedded Operating Systems45 Questions
Exam 14: Computer Security Threats45 Questions
Exam 15: Computer Security Techniques45 Questions
Exam 16: Distributed Processing, Clientserver, and Clusters45 Questions
Exam 17: Network Protocols45 Questions
Exam 18: Distributed Process Management45 Questions
Select questions type
The negotiation mechanism makes sure that the destination system does not refuse to accept the migration of a process to itself.
(True/False)
4.8/5
(38)
_________ is when only one process may use a resource at a time and no process may access a resource unit that has been allocated to another process.
(Short Answer)
4.9/5
(38)
The __________ method immediately grants the request of an older transaction by killing a younger transaction that is using the required resource.
(Short Answer)
4.9/5
(39)
It is the delay in communication, coupled with the lack of a common clock, which makes it much more difficult to develop mutual exclusion mechanisms in a distributed system compared to a centralized system.
(True/False)
4.8/5
(44)
A __________ is a special control message used by an algorithm.
(Short Answer)
4.8/5
(37)
Mutual exclusion, deadlock, and starvation are not issues that are faced in a distributed system.
(True/False)
4.8/5
(40)
With __________ a deadlock exists if there is a closed loop, or cycle, in the graph that depicts process dependencies.
(Multiple Choice)
4.8/5
(34)
With __________ , all processes cooperate in the deadlock detection function.
(Multiple Choice)
4.8/5
(44)
With the __________ strategy, the entire address space at the time of migration is transferred
(Multiple Choice)
4.9/5
(39)
When a process is migrated, it is necessary to destroy the process on the source system and create it on the target system.
(True/False)
4.9/5
(37)
__________ orders events in a distributed system without using physical clocks.
(Short Answer)
4.8/5
(39)
A _________ exists between two processes if they exchange messages.
(Multiple Choice)
4.8/5
(46)
When two or more processes compete for the use of system resources, there is a need for a mechanism to enforce __________ .
(Multiple Choice)
4.8/5
(46)
The transfer of a sufficient amount of the state of a process from one computer to another for the process to execute on the target machine is __________ .
(Short Answer)
4.8/5
(35)
A ________ is the path or means by which the message is transferred.
(Short Answer)
4.7/5
(30)
Interest in the concept of process migration grew out of research into methods of load balancing across multiple networked systems.
(True/False)
4.9/5
(32)
_________ is a technique in which a decision is made dynamically whether a given resource allocation request could, if granted, lead to a deadlock.
(Multiple Choice)
4.9/5
(30)
The decision to migrate must be reached jointly by two Starter processes, one on the source node and one on the destination node.
(True/False)
4.7/5
(36)
In a fully ___________ one node is designated as the control node and controls access to all shared objects.
(Multiple Choice)
4.8/5
(38)
Showing 21 - 40 of 45
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)