Difference between Sequential and Parallel Computing
Last Updated :
04 May, 2022
Sequential Computing is the type of computing where one instruction is given at a particular time and the next instruction has to wait for the first instruction to execute. It is also known as a traditional computing method because all the instructions are executed in a sequence. It is having a single processor with low performance and high work-load of the processor. The main disadvantage of using this computing is that it takes more time as a single instruction is getting executed at a given point of time.
To remove this disadvantage of sequential computing, parallel computing was introduced.
Parallel Computing is a type of computing where many calculations or the execution of the processes are carried out parallelly or simultaneously. The type of computing where processes can execute simultaneously at a time is known as parallel computing.
It saves time as the processes are executed simultaneously. It solves larger problems. There are multiple processors with high performance and low work-load per processor.
Difference between Sequential Computing and Parallel Computing:
|
Sequential Computing
|
Parallel Computing
|
1. |
All the instructions are executed in a sequence, one at a time. |
All the instructions are executed parallelly. |
2. |
It has a single processor. |
It is having multiple processors. |
3. |
It has low performance and the workload of the processor is high due to the single processor. |
It has high performance and the workload of the processor is low because multiple processors are working simultaneously. |
4. |
Bit-by-bit format is used for data transfer. |
Data transfers are in bytes. |
5. |
It requires more time to complete the whole process. |
It requires less time to complete the whole process. |
6. |
Cost is low |
Cost is high |
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...