Explains the various levels of parallel processing, Computer Engineering

Assignment Help:

Levels of parallel processing

We could have parallel processing at four levels.

i)  Instruction Level: Most processors have numerous execution units and can execute numerous instructions (usually machine level) at the similar time. Good compilers can reorder instructions to capitalize on instruction throughput. Often the processor can do itself. Modern processors even parallelize implementation of micro-steps of instructions within the same tube.

ii)  Loop Level: Here, repeated loop iterations are candidates for parallel execution. Moreover, information between subsequent iterations may restrict parallel execution of orders at loop level. There is a lot of capacity for parallel execution at loop level.

iii) Procedure Level: Here parallelism is existing in the form of parallel executable measures. Here is the design of the algorithm plays a crucial role. For example each line in Java can be spawned to run a method or function.

iv) Program Level: This is usually the dependability of the OS, which runs processes concurrently. Different programs are apparently independent of each other. So parallelism can be removed by the operating system at this level.

 

 


Related Discussions:- Explains the various levels of parallel processing

Implement or, Q. Write a program to implement OR, NOR, AND and NAND gates ...

Q. Write a program to implement OR, NOR, AND and NAND gates using and without using Bit wise operator. The menu should be as follows: I. Using Bit Wise operator II. Withou

Vector, Explain the characteristics of vector processing

Explain the characteristics of vector processing

What is cache coherency, Cache coherence refers to the integrity of data st...

Cache coherence refers to the integrity of data stored in local caches of a shared resource. Cache coherence is a special case of memory coherence. When clients in a system, mainly

What is delayed branching, What is delayed branching? A method called d...

What is delayed branching? A method called delayed branching can minimize the penalty incurred as a result of conditional branch instructions. The idea is easy. The instruction

What decision has the highest expected value, The Prisoner's Dilemma is a w...

The Prisoner's Dilemma is a well-known problem in game theory. Two thieves are arrested and held in custody separately. The police offer each the same deal. Inform on your partn

What is base register addressing, Q. What is Base Register Addressing ? ...

Q. What is Base Register Addressing ? An addressing technique in which content of an instruction specifies base register is added to address field or displacement field of the

What are compilers and interpreters, What are compilers and interpreters? ...

What are compilers and interpreters? Compiler and Interpreter: These are two types of language translators. A compiler changes the source program (user-written program) int

Ia-32 support, In order to support IA-32, the Itanium can switch into 32-bi...

In order to support IA-32, the Itanium can switch into 32-bit mode with special jump escape instructions. The IA-32 instructions have been mapped to the Itanium's functional units.

Define dynamic linking, Define dynamic linking.  Dynamic linking is sam...

Define dynamic linking.  Dynamic linking is same to dynamic loading, rather that loading being postponed unless execution time, linking is postponed. This feature is usually us

What are disadvantages of eprom, What are disadvantages of EPROM? The c...

What are disadvantages of EPROM? The chip must be physically removed from the circuit for reprogramming and its whole contents are erased by the UV light.

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