Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
q collective communications - broadcastbroadcast broadcasting can be done in two ways one of them is one to all and another one is all to all in the
q explain about barrierbarrier no actual transfer of data takes place in this mode unless all the processors involved in the communication execute a
q collective communicationsa number of message-passing systems allow communication involving more than two processors such type of communication can
q define point-to-point communicationthe simplest form of message is a point to point communication a message is sent from the transmitting processor
q concurrently read exclusively writeits one of the models based on pram in this model processors access the memory location simultaneously for
q concurrently read concurrently writeit is one of the models derived from pram in this model the processors access the memory locations
q show matrix multiplication problemlet there be 2 matrices m1 and m2 of sizes a x b and b x c correspondingly if we multiply m1 and m2 product
q design odd-even transposition algorithmalgorithm odd-even transpositionfor i1 to n if i2 0 ie
q sorting circuit along with odd-even merging circuitthe merge sort algorithm needs two circuits which imply that one circuit for merging and another
q explain about merge sort circuitfirst split the given sequence of n numbers in two parts every part comprising of n2 numbers afterwards recursively
analysis of sortbitonicxthe bitonic sorting network needs log n number of phases for performing task of sorting the numbers the first n-1 phases of
q demonstration of sorting problemthe term sorting implies organising elements of a provided set of elements in a specific order ie descending order
as in pram there was not any direct communication medium between processors so a different model called as interconnection networks have been
q in pram model steps required for executing an algorithmsubsequent steps are performed by a pram model whenever executing an algorithm iread phase
factor which helps in analysis of parallel algorithms is the total number of processors needed to deliver a solution to a provided problem so for a
q example of asymptotic notationsthe function f n belongs to the set gn if there exists positive constants c such that for satisfactorily large
q describe big notationbig o notation the set o gn comprises all functions fn for that there exists positive constants c such that for
q explain about theta notationtheta theta notation the set theta gn comprises all functions fn for that there exist positive constants c1c2 such that
asymptotic notations these notations are used for evaluating functions assume we have two functions fn and gn defined on real numberstheta
q computation step in time complexity of an algorithmso first in the computation step the local processor executes an arithmetic and logic operation
q explain time complexity in parallel algorithmsas it takes place nearly everyone who implement algorithms wish to know how much of an individual
a generic algorithm is mostly analysed on basis of subsequent parameters the space complexity amount of space required and the time complexity
q design issues of multi-threaded processorsto accomplish the maximum processor utilization in a multithreaded architecture the subsequent design
q multithreaded architectureit is clear at the moment if we provide a lot of contexts to multiple threads then processors with numerous contexts are
concept of multithreading this problem rises in design of large scale multiprocessors like mpp so a solution for optimizing this latency must be