Consider the following code (with line numbers): ! typedef struct lock_t (int flag; ) lock_t; void init (lock_t mutex) ( 11 12 13 15 // 0-> lock is available, 1 -> held mutex->flag = 0; void lock (lock_t *mutex) ( while (mutex->flag == 1) // TEST the flag ; // spin-wait (do nothing) mutex->flag = 1; // now SET it! } void unlock (lock_t mutex) ( mutex->flag = 0; This code is defective in that it allows two threads to enter a critical section at the same time. Please give me a sequence of operations where this might occur.

Consider the following code (with line numbers): ! typedef struct lock_t (int flag; ) lock_t; void init (lock_t mutex) ( 11 12 13 15 // 0-> lock is available, 1 -> held mutex->flag = 0; void lock (lock_t *mutex) ( while (mutex->flag == 1) // TEST the flag ; // spin-wait (do nothing) mutex->flag = 1; // now SET it! } void unlock (lock_t mutex) ( mutex->flag = 0; This code is defective in that it allows two threads to enter a critical section at the same time. Please give me a sequence of operations where this might occur.

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

In terms of concurrency, how do function objects play a role in facilitating parallel processing and task distribution?
How does a decimal value waste memory space? What are the arguments for and against Java's implicit heap storagerecovery compared with the explicit heap storage recovery required in C++? Consider real-timesystems.
Elaborate a C program of a circular static queue, where you can add an element, remove an element, show the queue, check if the queue is full, check if the queue is empty, and exit the program. Specify what is the structure of the queue, what are the function prototypes and what is the main function.
Explain what a deadlock is in the context of concurrent programming.
How can "optimistic concurrency control" benefit systems with low conflict rates?
What are your thoughts on the idea of concurrent control, and where do you stand with it?
Answer the following questions about activation records (stack frames). i. What information do activation records (stack frames) typically contain? ii. Suppose that the program only contains two functions f and g. Can we use only one activation record for each of f and g? Why?