Utilize Python Multiprocessing module to perform non-locking parallel array summing on different paradigms. 1. One master thread aggregating and sum the result of n slave-threads that each process sums a different range of values in a given array of 1000 random integers. 2. Tree-reduction: Each thread will receive an segment of array of numbers, it will fork/spawn two new slaves each perform summing on different half of the received array segment, and the parent aggregate and return the total from its two slaves to its parent thread. Start with 7 nodes thread tree, when you are comfortable, you can extend it to a full thread tree . Test your code on different size of data What to submit: 1. Your python code 2. a screen (or video) capture of your code execution

Utilize Python Multiprocessing module to perform non-locking parallel array summing on different paradigms. 1. One master thread aggregating and sum the result of n slave-threads that each process sums a different range of values in a given array of 1000 random integers. 2. Tree-reduction: Each thread will receive an segment of array of numbers, it will fork/spawn two new slaves each perform summing on different half of the received array segment, and the parent aggregate and return the total from its two slaves to its parent thread. Start with 7 nodes thread tree, when you are comfortable, you can extend it to a full thread tree . Test your code on different size of data What to submit: 1. Your python code 2. a screen (or video) capture of your code execution

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

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.
The multi-threaded sieve of Eratosthenes program in C++ please Answer these questions Where do you think the “sweet spot” is for thread count? Alternatively, at what point does the addition of more threads result in diminishing returns? Where do you think the “sweet spot” is for workload size? Alternatively, at what maximum value (max value to search for prime numbers) does it become beneficial to run the sieve in parallel?
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…
OPERATING SYSTEM Consider the below algorithm: for (i=1;i < n;i++){ for (j=1;j < m;j++){ Alloc[i][j]=( 2i *( j+1 ) % 7) } } For n=13 and m=6 answer the following questions What value Alloc[2][2],Alloc[3][5],Alloc[6][2],Alloc[10][5] will store? This part of the problem involves in deriving the Allocation matrix for a set of threads for implementing Banker's algorithm. Consider the system has five threadts (T0~T4) and five resourses (A~E) [Remember all threads are in CAPITAL letter]. Currents allocation matrix follows the following rule: T0 has allocated resources equal to the value of row A[2] of Alloc[i][j] array, T1 has equal to row A[3], T2 has equal to row A[6], T3 has equal to row A[10] and T4 has equal to row A[12]. What is the allocated resource for thread T0,T1,T2,T3,T4 ? [Hints. answer only the values one after another starting with resourse A, then resource B without any space or anything in between. for example - if you insert 12345, that will mean the thread is…
This part of the problem involves in deriving the Allocation matrix for a set of threads for implementing Banker's algorithm. Consider the system has five threadts (T0~T4) and five resourses (A~E) [Remember all threads are in CAPITAL letter]. Currents allocation matrix follows the following rule: T0 has allocated resources equal to the value of row A[2] of Alloc[i][j] array, T1 has equal to row A[3], T2 has equal to row A[6], T3 has equal to row A[10] and T4 has equal to row A[12]. [Hints. if a row has a value 12345 then allocated resourses are A:1,B:2,and so on.] What is the allocated resource for thread T0 ? [Hints. input only the values one after another starting with resourse A, then resource B without any space or anything in between. for example - if you insert 12345, that will mean the thread is allocated 1 instance of resource A, 2 instance of resource B and so on. ]
Consider the below algorithm: for (i=1;i < n;i++){ for (j=1;j < m;j++){ Alloc[i][j]=( 2i *( j+1 ) % 7) } } For n=13 and m=6 answer the following questions This part of the problem involves in deriving the Allocation matrix for a set of threads for implementing Banker's algorithm. Consider the system has five threadts (T0~T4) and five resourses (A~E) [Remember all threads are in CAPITAL letter]. Currents allocation matrix follows the following rule: T0 has allocated resources equal to the value of row A[2] of Alloc[i][j] array, T1 has equal to row A[3], T2 has equal to row A[6], T3 has equal to row A[10] and T4 has equal to row A[12]. What is the allocated resource for thread T0
Write a 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)
Consider the below algorithm: for (i=1;i < n;i++){ for (j=1;j < m;j++){ Alloc[i][j]=( 2i *( j+1 ) % 7) } } For n=13 and m=6 answer the following questions What value Alloc[2][4] will store? What value Alloc[4][3] will store? What value Alloc[7][2] will store? What value Alloc[11][5] will store? This part of the problem involves in deriving the Allocation matrix for a set of threads for implementing Banker's algorithm. Consider the system has five threadts (T0~T4) and five resourses (A~E) [Remember all threads are in CAPITAL letter]. Currents allocation matrix follows the following rule: T0 has allocated resources equal to the value of row A[2] of Alloc[i][j] array, T1 has equal to row A[4], T2 has equal to row A[7], T3 has equal to row A[9] and T4 has equal to row A[11]. [Hints. if a row has a value 12345 then allocated resourses are A:1,B:2,and so on.] What is the allocated resource for thread T0 ? [Hints. input only the values one after another starting with resourse A, then…
The multi-threaded sieve of Eratosthenes program using MPI C++ plz Answer these questionsa. Where do you think the “sweet spot” is for thread count? Alternatively, at what pointdoes the addition of more threads result in diminishing returns?b. Where do you think the “sweet spot” is for workload size? Alternatively, at whatmaximum value (max value to search for prime numbers) does it become beneficial torun the sieve in parallel?
60. The circular wait condition can be prevented by a. defining a linear ordering of resource types b. using thread c. using pipes d. all of the mentioned
please choose only correct answer : 1) Tool for process synchronization is * a, Pipe b, Thread c, Semaphore d, B and C e, All of the given 2) term scheduler select processes from the pool and load them into the memory for execution. * a, Short b, Medium c, Middle d, None of the given 3) A ………………….. is used to hold processes waiting on the semaphore. * a, Tree b, Stack c, Queue d, Graph 4) The methods of Dynamic partitioning suffer from ___ * a, Internal fragmentation b, external fragmentation c, Internal segmentation d, external segmentation 5) __________ creating multiple fragments in the memory because of the processes moving in and out * a, Fragmentation b, Paging c, Segmentation d, Swapping 6) Run-time mapping is done through * a, Firmware b, Software c, MMU d, All of the given 7)To control the degree of multiprogramming ______ scheduler is used for swapping processes in and out of memory * a, Medium-term b, Long-term c, Short-term d, All of the given
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