Program level-parallelism based on granularity size, Computer Engineering

Assignment Help:

Program Level:

It is the next level consisting of independent programs for parallelism. Coarse Granularity  size is used at this level containing ten thousands of instructions. Time sharing is get at this level of parallelism. Parallelism at this level has been exploited through the operating system.

                             The relation between parallelism and grain sizes levels has been given in Table 1.

                               1676_Program Level.png

Coarse grain parallelism is traditionally executed in tightly shared memory or coupled multiprocessors like the Cray Y-MP. Loosely coupled systems are used to implemented medium grain program segments. Fine grain parallelism has been considered  in SIMD organization of computers.

 


Related Discussions:- Program level-parallelism based on granularity size

How is a multidimensional array defined pointer, How is a multidimensional ...

How is a multidimensional array defined in terms of a pointer to a collection of contiguous arrays of lower dimensionality ? C does not have true multidimensional arrays. Howev

Dynamic programming, Given: • A sequence of n arrival times t0, t1, ..., ...

Given: • A sequence of n arrival times t0, t1, ..., tn-1, • a library of mlogically equivalent gates {(d0, c0), (d1, c1), ..., (dm-1,cm-1)} where d is delay and c is cost • a

Explain the ccitt hierarchical structure of routing, Explain the CCITT hier...

Explain the CCITT hierarchical structure of routing using block schematic. In right-through routing the originating exchange finds the whole route from source to destination. N

The color and plot style, Write a script that will make x and y vectors.  T...

Write a script that will make x and y vectors.  Then, it will ask the user for a color ('red', 'blue', or 'green') and for a plot style ('o', '*').  It will then make a string "pst

Student, Suppose we have an array-based list A[0..N - 1] and we want to del...

Suppose we have an array-based list A[0..N - 1] and we want to delete all duplicates. LastPosition is initially N - 1, but gets smaller as elements are deleted. Consider the pseudo

The files in tif format, Image Capturing Download the following grey lev...

Image Capturing Download the following grey level 512x512 standard images in TIF format: a-Lena       b-Baboon     c-Bridge       d-Airfield Use Matlab to decrease the siz

What are the functions of virtual file system, What are the functions of vi...

What are the functions of virtual file system (VFS)? a. It splits file-system-generic operations from their implementation explaining a clean VFS interface. It allows transpare

Determine reduced boolean equation and the karnaugh map, Determine reduced ...

Determine reduced Boolean equation and the Karnaugh Map? Illustration : Determine reduced Boolean equation and the Karnaugh Map for the truth table shown below:

Remote-load latency problem, Remote-load Latency Problem:  When one process...

Remote-load Latency Problem:  When one processor requires some remote loading of data by other nodes, then the processor need to wait for these two remote load operations. The long

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd