Filters
Question type
Study Flashcards

One of the earliest proposed approaches to providing distributed mutual exclusion is based on the concept of a distributed queue.

A) True
B) False

Correct Answer

verifed

verified

Algorithms for mutual exclusion may be either centralized or __________ .

Correct Answer

verifed

verified

Deadlock handling is not complicated in a distributed system because each node has accurate knowledge of the current state of the overall system and every message transfer between processes involves predictable delays.

A) True
B) False

Correct Answer

verifed

verified

The operating system knows the current state of all processes in the distributed system.

A) True
B) False

Correct Answer

verifed

verified

__________ process migration involves transferring a partially executed process, or at least a process whose creation has been completed.

Correct Answer

verifed

verified

Showing 41 - 45 of 45

Related Exams

Exam 1

Computer Systems Overview

45 Questions

Exam 2

Operating System Overview

45 Questions

Exam 3

Process Description and Control

45 Questions

Exam 4

Threads

45 Questions

Exam 5

Concurrency: Mutual Exclusion and Synchronization

45 Questions

Exam 6

Concurrency: Deadlock and Starvation

45 Questions

Exam 7

Memory Management

45 Questions

Exam 8

Virtual Memory

45 Questions

Exam 9

Uniprocessor Scheduling

45 Questions

Exam 10

Multiprocessor and Real-Time Scheduling

45 Questions

Exam 11

Io Management and Disk Scheduling

45 Questions

Exam 12

File Management

45 Questions

Exam 13

Embedded Operating Systems

45 Questions

Exam 14

Computer Security Threats

45 Questions

Exam 15

Computer Security Techniques

45 Questions

Exam 16

Distributed Processing, Clientserver, and Clusters

45 Questions

Exam 17

Network Protocols

45 Questions

Show Answer