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

Compare memory mapped i/o with i/o mapped i/o, Compare memory mapped I/O wi...

Compare memory mapped I/O with I/O mapped I/O. Memory Mapped I/O Scheme: In this scheme there is only one address space. Address space is stated as all possible addresses tha

Define the karnaugh maps (k maps), Define The Karnaugh Maps (K Maps) Th...

Define The Karnaugh Maps (K Maps) The Karnaugh map (K map) provides the systematic method for simplifying a Boolean expression or a truth table function when used properly the

What are the benefits of electronic data interchange process, What are the ...

What are the benefits of electronic data interchange process? Advantages of Electronic Data Interchange: a. EDI replaces paper transactions along with electronic transac

Explain the configuration of a step-by-step switching system, With neat dia...

With neat diagrams explains the configuration of a step-by-step switching system. The schematic diagram for an exchange is specified in figure. Each subscriber is associated to

Explain with the help of examples fifo algorithms, Explain with the help of...

Explain with the help of examples FIFO algorithms? FIFO policy: This policy easy removes pages in the order they arrived into the main memory. By using this policy we easily

Cg transformations, magnify a triangle a(0,0), b(1,1), c(5,2) twice its siz...

magnify a triangle a(0,0), b(1,1), c(5,2) twice its size hile keeping c as fix

Features of mpi-1, Features of MPI-1 Binding for FORTRAN and C ...

Features of MPI-1 Binding for FORTRAN and C Collective communication Communication domains and Process groups Point-to-point communication Virtual process

Write a short note on mmx technology, Write a short note on MMX technology....

Write a short note on MMX technology. MMX (Multimedia extensions) technology adds 57 new instructions to instruction set of the Pentium - 4 microprocessors. MMX technology also

Types of addressing modes in assembly language, Types of Addressing Modes: ...

Types of Addressing Modes: Each instruction of a computer mentions an operation on certain data. There are many ways of specifying address of the data to be operated on. These

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