Traditional Culture Encyclopedia - Traditional customs - I have never been able to tell the difference between parallel computing and distributed computing. I hope Da Xia can give me some advice.

.

.

I have never been able to tell the difference between parallel computing and distributed computing. I hope Da Xia can give me some advice.

.

.

1. Parallel Computing refers to the process of using multiple computing resources to solve computing problems at the same time.

To perform parallel computations, computing resources should include a computer equipped with a multiprocessor (parallel processing), a dedicated number of computers connected to a network, or a combination of both.

The main purpose of parallel computing is to quickly solve large and complex computing problems.

2. Distributed computing is a computer science that studies how to divide a problem that requires huge computing power into many small parts, then allocate these parts to many computers for processing, and finally combine the results of these calculations.

Get the final result.

3. The specific process is: Divide the project data that requires a large amount of calculations into small pieces, calculate them separately on multiple computers, upload the calculation results, and then merge them together to draw data conclusions.

The feature of extended information is the use of parallel computing. Usually computing problems have the following characteristics: 1. Separating work into discrete parts helps to solve it simultaneously; 2. Execute multiple program instructions at any time and in a timely manner; 3. Solve with multiple computing resources.

The problem takes less time than it would take on a single computing resource.

Basic terminology 1. Node degree: the number of edges entering or exiting a node.

In a unidirectional network, the sum of the incoming and outgoing edges is called the node degree.

2. Network diameter: the longest distance between any two nodes in the network, that is, the maximum number of paths.

3. Bisection width: the minimum number of edges that must be removed to bisect the network into halves.