Consider a multithreaded process that delivers messages from a durable queue of persistent messages. Different threads may run concurrently, attempting to deliver different messages. In case of a delivery failure, the message must be restored in the queue. Model the actions that each thread carries out as a multilevel transaction, so that locks on the queue need not be held until a message is delivered.

Consider a multithreaded process that delivers messages from a durable queue of persistent messages. Different threads may run concurrently, attempting to deliver different messages. In case of a delivery failure, the message must be restored in the queue. Model the actions that each thread carries out as a multilevel transaction, so that locks on the queue need not be held until a message is delivered.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

For mutual exclusion with a preemptive scheduler, it is necessary to introduce explicit locks, and machinery that makes requesting processes wait when a lock is unavailable. We considered casting our locks as semaphores, but decided that, compared with monitors, they exert too little structuring discipline on concurrent programs." How do semaphores "exert too little structuring discipline" and how is this remedied by monitors? Construct an example to show how the structuring discipline exerted by monitors could be useful.
20 Suppose there are four processes (P1 - P4) with respective arrival times of 0, 10, 30, and 40, and burst times of 30, 20, 50, and 20 ms. These processes are scheduled from a ready queue on first come first served. The average waiting time is: None of the answers 30 25 20
Consider the parameter A used to define the working-set window in the working-set model. What is the effect of setting A to a small value on the page fault frequency and the number of active (non-suspended) processes currently executing in the system? What is the effect when A is set to a very high value?
Please attach a picture，I need downloadable images as an answer. The RL can be implemented without dynamically managed linked lists by creating a new field, next, in each PCB, which points to the next PCB on the same list. Each entry of the RL then points to the first PCB on the list. Assume that RL contains 3 processes at level 5 and 1 process at level 0. Draw a diagram showing the RL and the modified PCBs.
Explore the concept of adaptive thread management in dynamic multithreading. How can adaptive algorithms be used to dynamically adjust the number of threads based on workload and resource availability?
Brieefly explains the multi-threading idea in Java. Please provide an execution diagram demonstrating the context switching mechanism between the main thread and the peer thread.
Suppose there are four processes (P1 - P4) with respective arrival times of 0, 10, 30, and 40, and burst times of 30, 20, 50, and 20 ms. These processes are scheduled from a ready queue on first come first served. The average waiting time is?
2 Recall the various deadlock detection and prevention algorithms we've discussed in class and consider the following snapshot of a system with five processes (P10, P11, P12, P13, P14) and four resources (R1, R2, R3, R4). R1, R2, R3, and R4 have a total of 11, 13, 7, and 9 resources, respectively. There are no current outstanding queued unsatisfied requests. Table 1: Allocation Table 2: Max R3 R4 PID R.1 R2 R3 R4 PID R1 10 4 11 3 12 1 215 2 1 3 10 13 0 5 0 14 1 3012 4 11 12 012 1 13 1 14 231323 75524 R2 5 5 432300 36373 8 Is the system currently in a safe or unsafe state? If safe, provide the process execution order. If unsafe explain your answer.
Problem 0. Write a version of hello.c that creates and reaps (joins) n threads, each of which prints "Hello, world" and its thread id, where n is a command-line argument, and the thread function is passed a pointer to its thread ID as its argument.
If you are working with scheduling policies, you are requested to investigate the variation of round robin in which a process that has used its full time quantum is returned to the end of the READY queue, while one that has used half of its time quantum is returned to the middle of the queue and one that has used one-fourth of its time quantum goes to a place one-fourth of the distance away from the beginning of the queue. 5.1 Explain the advantages and disadvantages of this scheduling policy. 5.2 Identify the user group that would find this most advantageous. 5.3 Describe the unique threats to a data centre posed by disgruntled employees. Describe how you would identify such people, if possible, and how you would protect your system from these threats. 5.4 What are the parameters that affect the efficiency of the round robin?
Write a C program with N threads. Thread i must print number i in a continuous loop. Without any synchronization between the threads, the threads will print their numbers in any order. Now, add synchronization to your code such that the numbers are printed in the order 1, 2, ..., N, 1, 2, ..., N, and so on. You may want to start with N = 2 and then move on to larger values of N
A distributed system may have multiple, independent resources. Imagine that process 0 wants to access resource A and process I wants to access resource B. Can Ricart and Agrawala's algorithm lead to deadlocks? Explain your answer.