multithreaded cook that performs the following recipe, with each task being contained in a single Thread: 1. Task 1: Cut onions. a. Waits for none. b. Signals Task 4 2. Task 2: Mince meat. a. Waits for none b. Signals Task 4 3. Task 3: Slice aubergines. a. Waits for none b. Signals Task 6 4. Task 4: Make sauce. a. Waits for Task 1, and 2 b. Signals Task 6 5. Task 5: Finished Bechamel. a. Waits for none b. Signals Task 7 6. Task 6: Layout the layers. a. Waits for Task 3, and 4 b. Signals Task 7 7. Task 7: Put Bechamel and Cheese. a. Waits for Task 5, and 6 b. Signals Task 9 8. Task 8: Turn on oven. a. Waits for none b. Signals Task 9 9. Task 9: Cook. a. Waits for Task 7, and 8 b. Signals none At the start of each task (once all Semaphores have been acquired), print out a string of the task you are starting, sleep for 2-11 seconds, then print out a string saying that you have completed the task. Finally, signal all the tasks that are waiting for you to finish. Hint: You could store the semaphores in a 2D array.

multithreaded cook that performs the following recipe, with each task being contained in a single Thread: 1. Task 1: Cut onions. a. Waits for none. b. Signals Task 4 2. Task 2: Mince meat. a. Waits for none b. Signals Task 4 3. Task 3: Slice aubergines. a. Waits for none b. Signals Task 6 4. Task 4: Make sauce. a. Waits for Task 1, and 2 b. Signals Task 6 5. Task 5: Finished Bechamel. a. Waits for none b. Signals Task 7 6. Task 6: Layout the layers. a. Waits for Task 3, and 4 b. Signals Task 7 7. Task 7: Put Bechamel and Cheese. a. Waits for Task 5, and 6 b. Signals Task 9 8. Task 8: Turn on oven. a. Waits for none b. Signals Task 9 9. Task 9: Cook. a. Waits for Task 7, and 8 b. Signals none At the start of each task (once all Semaphores have been acquired), print out a string of the task you are starting, sleep for 2-11 seconds, then print out a string saying that you have completed the task. Finally, signal all the tasks that are waiting for you to finish. Hint: You could store the semaphores in a 2D array.

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

Implement a solution to the critical section problem with threads using semaphores. you must add a third counting thread which counts by 1 each time it enters its critical section to 3,000,000. Each counts to 3,000,000 for a total of 9,000,000.
You are instructed to print the numbers from 1 to n in the venerable puzzle FizzBuzz. Print ", though, if the number is divisible by 3 instead "izz". Print it if it is divisible by 5 "Buzz". Print it if it is divisible by 3 and 5 "izzBuzz". You are required to carry out this task using multiple threads in this problem.Implement a four-threaded multithreaded FizzBuzz implementation. One thread prints and checks the divisibility of three "izz". A different thread is in charge of the divisibility of 5 and printing "Buzz". Divisibility of 3 and 5 is handled by a third thread, which also prints " "izzBuzz". The computation is done by a fourth thread.
In this assignment, you are provided with working code that does the following: 1. You input a sentence (containing no more than 50 characters). 2. The program will read the sentence and put it into an array of characters. 3. Then, it creates one thread for each character in the sentence. 4. The goal of the program is to capitalize each letter that has an odd index. The given program actually does this, but lacks the synchronization of the threads, so the output is not correct. You will need to provide the synchronization using mutex locks. Specifically, you are to (1) declare the mutex lock, (2) initialize the mutex lock, (3) lock and unlock the mutex lock at an appropriate location that results in the code working as expected, and (4) destroy the mutex lock. Be sure to place the mutex locks so that your program works correctly every time. Do not remove code or functions – you are to add the synchronization pieces only. When compiling using the GNU C compiler, be sure to include the…
For programming tasks, we can use an Array or an Array List. Describe when using an Array would be a good choice, and Describe when using an Array List would be a better choice. You must start a thread before you can read and reply to other threads
Write a C program to implement threading.a. Use following two Arraysa. Student ID[]={101,102,103,104,105}b. Student Results[]={85,45,55,65,75}b. Thread1 prints the student IDs of those students who has 1st and 2nd highest marks.c. Thread 2 prints the IDs of failed studentsd. Thread3 prints avg marks of the class
Write a program that has a counter as a global variable. Spawn 10 threads in theprogram, and let each thread increment the counter 1000 times in a loop. Print the finalvalue of the counter after all the threads finish—the expected value of the counter is10000. Run this program first without using locking across threads and observe theincorrect updating of the counter due to race conditions (the final value will be slightly lessthan 10000). Next, use locks when accessing the shared counter and verify that the counteris now updated correctly
3. Implement mutual exclusion with multithreading in Java Build a Java program which simulates a communication between a server and clients. You must use a thread to represent each party (as server or client). (Hint: study about the Semaphore class to perform mutual exclusion between threads) Create three threads. One thread will act as a server, which always ready to receive a message from a client (ping) and then replies the message to the same client (pong). The other two threads will become the clients, where each client will send a message to the server (ping) and waits for the reply (pong). Define 2 different classes to represent the server and the client. To perform the communication, each thread will refer to a same variable/data structure for sending and receiving the message. Use mutual exclusion approach to ensure each client can send and receive the reply without interruption from any other client(s). For this simulation, your objective is to ensure that each client must…
10. Write a multi-threading JAVA program having four threads:- The “Generator” thread: it takes as argument (in the constructor) aninteger N and generates an array of N integers- The “Even” thread: it takes as argument (in the constructor) an array ofintegers and counts the number of even numbers in the array- The “Odd” thread: it takes as argument (in the constructor) an array ofintegers and count the number of odd numbers in the array- The main thread:o it asks the user to enter an integer No Then, it runs the “Generator” thread to create an array of integersand waits the end of “Generator”o Then, it run “Even” and “Odd” to count the number of even andodd numbers in the generated arrayo Finally, it prints if there is more even or odd numbersNote: the main thread should wait the end of “Even” and “Odd”threads before printing the final result.
A group of philosophers are seated around a circular table with one chopstick in between each of them in the classic dining philosophers conundrum. A philosopher usually takes up the left chopstick before the right one while using both chopsticks to eat. If all the philosophers reached for the left chopstick at once, there may be a deadlock. Implement a simulation of the dinner philosophers issue that avoids deadlocks using threads and locks.
Implement a program which gets the thread number and add it to a tsum variable. int tsum=0;#pragma omp paralleltsum += omp_get_thread_num();printf("Sum is %d\n", tsum); Compile and run it several times. Do you see something unexpected? what problem are you expecting? How can we solve it?
implement a bridge simulation using threads and semaphores. The bridge (the grey rectangle)should have 600kg capacity. Each person (you can draw them as circles) should have a random weight between 40 and 140kg.The radius of the circle should be proportional to its weight.Their speed must be same with other persons.Create 100 person and test your program in Java.
The Programming Language is; JAVA Please write comments in each part write a program about a e-shopping order menu. While doing this use OOP concepts. Implement a stocking program using threads. You have an e-store and customer side. In the frame: Number of Items (TextField): Number of items in the stock.() Create (Button): Creates items and adds them to frame. (Pen, paper, bag,etc.) Good (Button): Agents/Customer’s basket start to number of goods/items.(Customer wants to buy 3 pens) Number of Agents (TextField): How many customers at one time? (You can create an arbitrary maximum number if you explain.I.e maximum 4 customers because,...) Maximum Waiting Time (Text Field): Agents or customer’s basket will wait for some time after booking an item. The waiting time will be a random number between 0 and the number entered in this text field. Waiting times must be different for each agent. When waiting time is up, threads (baskets) will release their hold on items. So If your…