The need of parallel computation, Computer Engineering

Assignment Help:

The Need Of Parallel Computation

With the advancement of computer science (CS), computational speed of the processors has also improved many a time. Moreover, there is certain limitation as we go upwards and face big complex problems. So we have to ready to look for alternatives. The answer denigration in parallel computing. There are two major reasons for using parallel computing: accumulate time and solve larger problems. It is clear that with the increase in amount of processors working in parallel, computation time is clear to reduce. Also, they're some scientific trouble that evens the best processor to takes months or even years to resolve. Moreover, with the application of parallelcomputing these troubles may be resolve in a few hours. Some Other reasons to accept parallel computing are:

i) Cost savings: We can use several cheap computing resources in its place of paying.

ii) It is heavily for a supercomputer.

iii) Overcoming memory constraints: one computer have very finite memory resources. For big problems, using the recollections of multiple computers may conquer this obstacle. So if we join the memory resources of multiple computers then we can simply fulfil the memory requirements of the mass problems.

iv) Limits to serial computing: Physical and practical factors both are pose significant constraints to only building ever quicker serial computers. The speed of a serial computer is totally dependent upon how quick data can travel through hardware. Total limits are the pace of light (3*108 m/sec) and the transmission boundary of copper wire (9*108 m/sec). Rising speeds necessitate increasing proximity of dealing out elements. Secondly, processor technology is allocating an increasing number of transistors to be located on a chip. However, even with atomic-level or molecular components, a limit will be reached on how little components can be made. It is increasingly costly to make a single processor quicker. Using a big number of moderately fast commodity processors to attain the same (or better) presentation is less expensive.

 


Related Discussions:- The need of parallel computation

Layered architecture of electronic data interchange, Illustrated about the ...

Illustrated about the layered architecture of Electronic Data Interchange? Layered Architecture of EDI: Electronic Data Interchange is most commonly applied into th

Message passing model, In the message-passing model, there exists a set of ...

In the message-passing model, there exists a set of tasks that use their own local memories during computation. Multiple tasks can reside on the similar physical machine as well ac

Instruction pipeline-level of processing, Classification according to level...

Classification according to level of processing According to this classification, computer operations are classified as arithmetic operations and instruction implementation. Ne

Define memory allocation functions, The various memory allocation functions...

The various memory allocation functions are described below: (i) malloc( ) : It is a memory allocation function that assigns requested size of bytes and returns a pointer to t

What is a pointer, What is a pointer? The register or memory location t...

What is a pointer? The register or memory location that having the address of an operand is known as a pointer.

Explain macro definition and call, Explain Macro definition and call. ...

Explain Macro definition and call. Macro: The assembly language programming frequently finds this necessary to repeat certain piece of code several times during the course of

Maximum number of nodes in a binary tree, The maximum number of nodes in a ...

The maximum number of nodes in a binary tree of depth 5 is 31 is the maximum number of nodes in a binary tree

What is a data class, What is a Data Class? The Data class verifies in ...

What is a Data Class? The Data class verifies in which table space the table is stored when it is formed in the database

Define deadlock, Define deadlock. A process requests resources; if the ...

Define deadlock. A process requests resources; if the resources are not available at that time, the method enters a wait state. Waiting processes might never again change state

What is the network service access policy, What is the Network Service Acce...

What is the Network Service Access Policy A high-level, issue-specific policy which defines those services that are allowed or denied from the restricted network. It also co

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