Can you help me with question 2 Consider the following multi-threaded C code.1: /* Waits until bar ->n threads have called barrier2: *before allowing any thread to continue3: */4: void barrier (barrier_t * bar ) {5: lock (& bar -> mutex);6: bar -> count ++;7: if (bar> count == bar ->n) {8: bar -> count = 0; // reset barrier9: cond_signal (& bar ->cv);10: unlock (& bar -> mutex);11: return;12:]13: while (bar -> count < bar ->n) {14: cond wait (& bar ->cv, &bar -> mutex);15: } Identify all bugs, if any exist.A. Lines 5, 10, and 16B. Line 9C. Lines 9 and 13D. Line 13E. No bugs

Bug: Lines 5, 10, and 16 (typo in resetting the barrier count).Bug: Line 13 (should be an if…

Answered: Consider the following multi-threaded C…

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

PLEASE USE PTHREADS Write a program in C using PTHREADSthat will simulate the operations of the following Batch scheduling algorithms: PLease use Pthreads First-Come, First-Served Shortest Job First Your Program will implement threads for each algorithm plus the main thread. A linked list will be used to represent the list of jobs available to run. Each node will represent a Job with the following information: int PID Process ID int time; The time needed on CPU to finish executing Main thread: Your main code will request the user to input a list of jobs, and to fill the information in each job node until a sentinel value is reached, each data item will be stored in a separate node. Starts the FCFS thread, followed by SJF thread. Wait for both threads to finish before exiting. FCFS thread: The thread will simulate the First-Come, First-Served algorithm. Displays the data in a list in the order they were inserted. SJF thread: The thread will simulate the Shortest…
Write a C code to perform vector arithmetic: Define 3 vectors A[100], B[100], C[100]. Get n from as a command line argument. Example if n=10, then (./vector 10), and create n processes. (n will be one of Divisors of 100). Get operation from user: add, sub. Each process will create a number of threads. Number of threads per process = 100/(10 number of processes). Perform the operation on a chunk of the vector, for example, if n = 10, each process will create (100/10*10=1) 1 thread to add\sub 10 elements. Use execl to run the add or sub programs Parent should print A.B.C in a file. (yourname.txt) For example, n=5, operation sub Partition work equally to each process: PO create (100/10*5=2) 2 threads → Thread00 will executes A[0:9] B[0:9]-C [0:9] = Thread01 will executes A[10:19] B[10:19]-C[10:19] = PI create (100/10*5=2) 2 threads → Thread 10 will executes A[20:29] = B[20:29]-C [20:29] Thread11 will executes A[30:39] B[30:39]- C[30:39] = and so on. no…
Const N = 50; Var Tally: integer; Procedure Total; Var Count:integer; Begin For Count := 1 to N do Tally := Tally + 1 End; End; Begin (* main program *) Tally := 0; Parabegin Total; Total; Paraend; Write (Tally) End. Compose a thread safe pseudocode version that guarantees the upper and lower bound of the shared variable Tally are the same value after execution.
#include <pthread.h>#include <stdio.h>#include <unistd.h>#include <stdlib.h> int count = 0; void *threadfunc(void *arg){ cout<<"Thread Complete\n"; count++; return NULL; } int main(){ count = 0; pthread_t A,B,C;pthread_create(&A, NULL, threadfunc, NULL); pthread_create(&B, NULL, threadfunc, NULL); pthread_create(&C, NULL, threadfunc, NULL); while(count<50) {pthread_join(A, NULL); if(count<50) pthread_join(B, NULL); if(count<50) pthread_join(C, NULL); } return 0; } What is wrong?
Implement a Multithreaded Sudoku Solution Validator using POSIX thread library in C Specifications This assignment consists of designing a multithreaded application that determines whether the solution to a Sudoku puzzle is valid. A Sudoku puzzle uses a 9×9 grid in which each column and row, as well as each of the nine 3×3 subgrids, must contain all of the digits 1 to 9. Following figure presents an example of a valid Sudoku puzzle solution. There are several different ways of multithreading this application. In this assignment, you need to implement the strategy to create multiple worker threads that check the following criteria: Nine threads to check that each of the 9 columns contains the digits 1 through 9 Nine threads to check that each of the 9 rows contains the digits 1 through 9 Nine threads to check that each of the 3×3 subgrids contains the digits 1 through 9 This would result in a total of 27 separate worker threads for validating a Sudoku puzzle solution.The parent…
Solve the producer and consumer problem with inter thread communication (join(), wait(), sleep() etc.) modifying the given C code. #include <pthread.h> #include <stdio.h> #include <string.h> #define MAX 10 //producers and consumers can produce and consume upto MAX #define BUFLEN 6 #define NUMTHREAD 2 /* number of threads */ void * consumer(int *id); void * producer(int *id); char buffer[BUFLEN]; char source[BUFLEN]; //from this array producer will store it's production into buffer int pCount = 0; int cCount = 0; int buflen; //initializing pthread mutex and condition variables pthread_mutex_t count_mutex = PTHREAD_MUTEX_INITIALIZER; pthread_cond_t nonEmpty = PTHREAD_COND_INITIALIZER; pthread_cond_t full = PTHREAD_COND_INITIALIZER; int thread_id[NUMTHREAD] = {0,1}; int i = 0; int j = 0; main(){ int i; /* define the type to be pthread */ pthread_t thread[NUMTHREAD]; strcpy(source,"abcdef"); buflen = strlen(source); /* create 2…
Consider the following program: const int n=10; int s; //shared variable between two processes (threads) void P1( ) { int i=0; for (i=0;i
1. Transform the following program into parallel program using openmp, and run your program. #include int main(int argc, char * argv[]) { int i, thread id; int glob nloops, priv nloops; glob nloops = 0; // parallelize this code { priv nloops 0; thread id = // parallelize this code for (i=0; i<100000; ++i) { ++priv_nloops; } // make this code critical { printf("Thread %d is adding its iterations (%d) to sum (%d), ", thread id, priv nloops, glob nloops); glob nloops += priv nloops; printf(" total nloops is now %d.\n", glob nloops); } printf("Total # loop iterations is %d\n", glob nloops); return 0; (priv nloops, thread id) simmon wwwmmmmmm
Complete the following code. The goal is to implement the producer-consumer problem. You are expected to extend the provided C code to synchronize the thread operations consumer() and producer() such that an underflow and overflow of the queue is prevented. You are not allowed to change the code for implementing the queue operations, that is the code between lines 25 and 126 as shown in the screenshot. You must complete the missing parts as shown in the screenshot as well as complete the missing codes of producer and consumer. #include <stdio.h> #include <stdlib.h> #include <unistd.h> #include <time.h> #include <pthread.h> #include <semaphore.h> #include <errno.h> #include <fcntl.h> #define MAX_LENGTH_CAP 100 #define INIT -127 #define UNDERFLOW (0x80 + 0x02) #define OVERFLOW 0x80 + 0x01 #define BADPTR (0x80 + 0x03) #define CONSUMER_TERMINATION_PROBABILITY 40 #define PRODUCER_TERMINATION_PROBABILITY 30 // ============= LOCKED…
Problem 0. a. Why does a pthread_cond_wait() take both a pthread_cond_t * and a pthread_mutex_t as arguments? b. What happens if a thread passes pthread_cond_wait() a pointer to a pthread_mutex_t for which it is not holding the lock?
Topic: OpenMP #pragma omp parallel for and #pragma omp master (Distributed and Parallel Computing Lab) The master construct denotes a block that is only executed by the master thread. Note that there is no synchronization (implicit barrier) for the master construct. The other threads will skip over this block and continue processing without waiting for the master thread. Write a program that computes the average of a large array using a parallel for construct. While it is running using #pragma omp parallel for construct, also use a master construct (outside the for loop) to keep track of how many iterations have been executed and prints out a progress report. Q. The following code is what I have written so far, but the ave(rage) value at the end comes as zero, and the number of iteration was only one, which I don't think it reflects what this program is supposed to do. Please, modify my current code to meet the criteria explained above. #include <omp.h>#include…
USE PYTHON MULTI THREADING TO COMPLETE DO NOT USE PROCESSES ONLY COMPLETE PART 2 using MULTI THREADING 1) Basic version with two levels of threads (master and slaves) One master thread aggregates and sums the result of n slave-threads where each slavethread sums a different range of values in an array of 1000 random integers (please program to generate 1000 random integers to populate the array). ************ONLY COMPLETE THIS PART BELOW*************** 2) Advanced version with more than two levels of threadsThe master thread creates two slave-threads where each slave-thread is responsible to sum half segment of the array. Each slave thread will fork/spawn two new slave-threads where each new slave-threadsums half of the array segment received by its parent. Each slave thread will return the subtotal to its parent thread and the parent thread aggregates and returns the total to its parent thread. Start with 7 nodes thread tree, when you are comfortable, you can extend it to a full…

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS