Write the parallelism type (task parallelism OR data paralldlism) for éach of the following: NOTE Copy all sentences and write your answer inside the brackets [ ?] 1- Using a separate thread to generate a thumbnail for each photo in a collection [ ?1 2- Transposing a numeric matrix in parallel [?] 3- Summing the contents of an array of size N[?] 4- Calculating the maximum of an array of size N[ ?]

Write the parallelism type (task parallelism OR data paralldlism) for éach of the following: NOTE Copy all sentences and write your answer inside the brackets [ ?] 1- Using a separate thread to generate a thumbnail for each photo in a collection [ ?1 2- Transposing a numeric matrix in parallel [?] 3- Summing the contents of an array of size N[?] 4- Calculating the maximum of an array of size N[ ?]

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 3VE

See similar textbooks

Similar questions

Write a program using pthreads, which calculates the sum of elements in a hard-coded integer array in parallel using 4 threads. The program must divide the work between 4 threads which run simultaneously. For simplicity, you can assume that the size of the array is 100. Note that the integer array must be declared as a global data structure. Initially code your solution so that the sum of elements is maintained in a global shared variable. Each thread modifies the same shared variable as it sums up elements from the array. Use a suitable synchronization primitive (mutex) to ensure safe access to the global variable. (A sample code of Mutex is attached for your reference)...also put screenshot of output.
Is it even feasible to have a deadlock if there is just one process that is using a single thread? Please elaborate on your response.
Write program for the following Create a child thread class for sorting an array of 10000 size string values Create a child class for calculating factorial of 50 Create a child thread class for calculating base b to the power p Create a single object of each thread in the main thread, and stop the execution of main thread until the termination of all child threads using join method
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.
Write a C program using pthreads, which calculates the sum of elements in a hard-coded integer array in parallel using 4 threads. The program must divide the work between 4 threads which run simultaneously. For simplicity, you can assume that the size of the array is 100. Note that the integer array must be declared as a global data structure. Initially code your solution so that the sum of elements is maintained in a global shared variable. Each thread modifies the same shared variable as it sums up elements from the array. Use a suitable synchronization primitive (mutex) to ensure safe access to the global variable.
Question 3: [9 marks]Suppose we have an array of size n which stores random numbers. Also, we have n threads each of which should sum the numbers stored in the array positions from 0 to m-1 where m is the number of that thread, then stores the result in the position m-1.215, 25 ,17 ,1001, … ,5, -150 0 , 1 , 2 , 3 , … , n-2, n-1Apparently the threads can run independently, but when the array inspected after execution the results were incorrect.a) Why the results were incorrect? What is this problem called? ( 4 marks)b) How can such case be handled in order to always guarantee correct results? Suggest the most appropriate solution for this case and justify your choice. (5 marks)Note: No code or mathematical examples or solutions required in your answer.
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…
Write a C program using pthreads, which calculates the sum of elements in a hard-codedinteger array in parallel using 4 threads. The program must divide the work between 4threads which run simultaneously. For simplicity, you can assume that the size of thearray is 100. Note that the integer array must be declared as a global data structure.Initially code your solution so that the sum of elements is maintained in a global shared variable. Each thread modifies the same shared variable as it sums up elements fromthe array. Use a suitable synchronization primitive (mutex) to ensure safe access to theglobal variable. (A sample code of Mutex is attached for your reference) write program in C language
Write a C program using pthreads, which calculates the sum of elements in a hard-codedinteger array in parallel using 4 threads. The program must divide the work between 4threads which run simultaneously. For simplicity, you can assume that the size of thearray is 100. Note that the integer array must be declared as a global data structure.Initially code your solution so that the sum of elements is maintained in a global shared variable. Each thread modifies the same shared variable as it sums up elements fromthe array. Use a suitable synchronization primitive (mutex) to ensure safe access to theglobal variable. (A sample code of Mutex is attached for your reference)
Use both Mutex lock and Semaphore to address the racing problem in the following program (example_thread.c). Please make sure that your output is always equal to 6,000,000. ====================================== example_thread.c ====================================== #include <stdio.h>#include <stdlib.h>#include <pthread.h>int shared= 0;void race(void);int main(){ pthread_t player1, player2, player3; pthread_create(&player1, NULL, (void *)race, NULL); pthread_create(&player2, NULL, (void *)race, NULL); pthread_create(&player3, NULL, (void *)race, NULL); pthread_join(player1, NULL); pthread_join(player2, NULL); pthread_join(player3, NULL); printf("Total Number = %d\n", shared); return 0;}void race(void) { long i,tmp; for(i=1; i<=2000000; i++) { tmp = shared; tmp = tmp + 1; shared = tmp; }}
Modify this threading example to use, exclusively, multiprocessing, instead of threading. import threadingimport time class BankAccount(): def __init__(self, name, balance): self.name = name self.balance = balance def __str__(self): return self.name # These accounts are our shared resourcesaccount1 = BankAccount("account1", 100)account2 = BankAccount("account2", 0) class BankTransferThread(threading.Thread): def __init__(self, sender, receiver, amount): threading.Thread.__init__(self) self.sender = sender self.receiver = receiver self.amount = amount def run(self): sender_initial_balance = self.sender.balance sender_initial_balance -= self.amount # Inserting delay to allow switch between threads time.sleep(0.001) self.sender.balance = sender_initial_balance receiver_initial_balance = self.receiver.balance receiver_initial_balance += self.amount # Inserting delay to allow switch between threads time.sleep(0.001)…
Describe the concept of thread safety and techniques like locks, semaphores, and monitors to achieve it in multithreaded programs.