Why we need the need of parallel computation, Computer Engineering

Assignment Help:

THE NEED OF PARALLEL COMPUTATION

 With the growth of computer science, computational pace of the processors has also increased many a times. Though, there are definite constraints as we go upwards and face large complicated problems. So we would have to look for alternatives. The answer lies in the parallel computing. There are two main reasons for using parallel computing: solve larger problems and save time. It is clear that with the raise in some processors working in parallel, computation time is bound to decrease. In addition, they're some scientific problems which even the fastest processor to takes months or even years to solve. On the other hand, with the application of parallel computing these problems can be solved in a few hours. Other reasons to approve parallel computing are: 

i)  Cost savings: We can make use of multiple cheap computing resources instead of paying heavily for a supercomputer. 

 ii) Overcoming memory constraints: Single computers have exceptionally finite memory resources. For big problems, using the memories of multiple computers may overcome this obstacle. So if we merge the memory resources of multiple computers then we may effortlessly fulfill the memory requirements of the large size problems.

iii) Limits to serial computing: Both practical and physical factors pose important constraints to basically building ever quicker serial computers. The pace of a serial computer is straightforwardly dependent upon how fast data can move through hardware. Absolute limits are speed of light (3*108 m/sec) plus transmission limit of copper wire (9*108 m/sec). Ever-increasing speeds necessitate increasing proximity of processing elements.  Secondly, processor technology is permitting an increasing number of transistors to be positioned on a chip. Though, even with molecular or atomic-level components, a limit would be reached on how small components can be made. It is increasingly costly to create a single processor faster. Using a larger number of moderately rapid commodity processors to get the same (or better) performance is less expensive. 

 


Related Discussions:- Why we need the need of parallel computation

Explain a macro, Explain a macro Macro is a preprocessor directive, als...

Explain a macro Macro is a preprocessor directive, also called as macro definition takes the following general form:  #define identifier string

Recursion, Ask qurecurrion for short noteestion

Ask qurecurrion for short noteestion

What is block scope, What is Block scope Block scope: The variables w...

What is Block scope Block scope: The variables with block scope appear in a block or within the list of formal parameter declarations in a function definition. It is visible

How is recursion handled internally, How is recursion handled internally? ...

How is recursion handled internally? Internally, every recursive call to a function requires storing the intermediate values of the parameters and local variables in a run time

What is the benefit of using linq on dataset, The main aim of using LINQ to...

The main aim of using LINQ to Dataset is to run strongly typed queries on Dataset. Assume we want to combine the results from two Datasets, or we need to take a distinct value f

Design a memory buffer of limited size, Extend task 1 so that it now suppor...

Extend task 1 so that it now supports a memory buffer of limited size. Provide the same functionality as task 1 except now make the server work with a limited buffer size. Like

Explain direct addressing mode with example, Q. Explain Direct Addressing M...

Q. Explain Direct Addressing Mode with example? Direct Addressing Mode A direct operand signifies to contents of memory at an address referred by the name of the variable.

What is electronic data interchange, What is Electronic Data Interchange? ...

What is Electronic Data Interchange? Electronic Data Interchange (EDI): It is used by organizations for transactions which arise on regular basis to a pre-found format.

Time complexity in the worst case, Speicified the following piece of code: ...

Speicified the following piece of code: int i = 1; int j = 4; while (i     {      if (i%3 == 0) i+=3;      else i+=4;        if (j%2 == 0) j*=4;      els

Subsequent step in karnaugh map, The subsequent step in Karnaugh map is to ...

The subsequent step in Karnaugh map is to map truth table in the map. Mapping is done by putting a 1 in respective square belonging to 1 value in truth table. This mapped map is us

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