Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
consider a parallel system containing p processing elements solving a problem consisting of w units of work prove that
super linear speedup consider the search tree shown in figure 510a in which the dark node represents the solutiona
consider cannons matrix-matrix multiplication algorithm our discussion of cannons algorithm has been limited to cases
consider the column-wise implementation of matrix-vector product program 65 an alternate implementation will be to use
write a threaded program for computing the sieve of eratosthenes think through the threading strategy carefully before
change the locks to read-write locks in the hash table and use write locks only when inserting an entry into the linked
implement a threaded hash table in which collisions are resolved by chaining implement the hash table so that there is
improve the binary tree search program further by using read-write locks a thread read-locks a node before reading it
estimate the time taken for each of the following in pthreadsmiddot thread creationmiddot thread
consider a sparse matrix stored in the compressed row format you may find a description of this format on the web or
assume that ts 10 and tw 1 in the expression of parallel execution time equation 814 of the matrix-multiplication
assuming that concurrent read accesses to a memory location are serialized on an erew pram derive the parallel run time
improve the binary tree search program by associating a lock with each node in the tree as opposed to a single lock
illustrate the use of recursive locks using a binary tree search algorithm the program takes in a large list of numbers
implement a producer-consumer framework in open mp using sections to create a single producer task and a single
consider a simple loop that calls a function dummy containing a programmable delay all invocations of the function are
consider the parallel algorithm given in algorithm 87 for multiplying two n x n matrices a and b to obtain the product
describe a pipelined algorithm for performing back-substitution to solve a triangular system of equations of the form
repeat problem 72 using condition variables in addition to mutex locks document the time for the same test case as
write a threaded program for solving a 15-puzzle the program takes an initial position and keeps an open list of
modify the above program so that you now have multiple open lists say k now each thread picks a random open list and
compute the parallel run time speedup and efficiency of floydamp39s all-pairs shortest paths algorithm using 2-d block
the parallel formulation for the connected-component problem presented in section 106 uses 1-d block mapping to
an alternative way of partitioning the matrix dk in floydamp39s all-pairs shortest paths algorithm is to use the 1-d
dijkstraamp39s single-source shortest paths algorithm section 103 requires nonnegative edge weights show how