Scribd
Upload
121 views

(AP CSP) (The Internet) Sequential vs. Parallel and Distributed (Student)

Sequential computing processes tasks one at a time, while parallel and distributed computing processes multiple tasks simultaneously. Parallel and distributed computing can be faster but is more complex to set up and harder to debug when issues arise. The document then provides an exercise where the reader searches data sets sequentially alone, in pairs, and in groups to compare the efficiency and challenges of each approach.

Uploaded by

Nguyen Quan Ha
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
121 views

(AP CSP) (The Internet) Sequential vs. Parallel and Distributed (Student)

Sequential computing processes tasks one at a time, while parallel and distributed computing processes multiple tasks simultaneously. Parallel and distributed computing can be faster but is more complex to set up and harder to debug when issues arise. The document then provides an exercise where the reader searches data sets sequentially alone, in pairs, and in groups to compare the efficiency and challenges of each approach.

Uploaded by

Nguyen Quan Ha
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Sequential vs.

Parallel & Distributed

Corresponding Material
The Internet, Computer Processing Operations

Discussion
Sequential computing takes one task at a time to process and complete before it moves to the
next task. Parallel & distributed computing completes multiple tasks at the same time to speed
up the process. Parallel & distributed computing can definitely be faster but it comes with
challenges. It can be pretty complex and difficult to set up. It is also harder to find errors or
bugs when parallel & distributed processing is used.

Let’s consider the task of searching for a number in a small data set. In the exercise that
follows, you will search data sets in several ways. Think about the efficiency and challenges that
come with each method for searching (which is one type of data processing) and storing data in
the types of computer setups we have discussed.

Exercise

1. Task One: Complete this task by yourself. Find the smallest number in the list of numbers
below.

46 24 40 30
36 52 29 77
26 84 48 53
43 41 55 30
25 98 31 22

2. Task Two: This time, pair up with a friend. Split up the workload and search for the smallest
number in the list of numbers below.

99 31 33 92
43 64 52 63
41 63 91 55
53 84 43 54
39 42 38 28

3. Task Three: For this last task - find a group of 4. Split up the workload and search for the
smallest number in the list of numbers below.

87 38 93 93
93 48 81 65
67 39 78 46
80 48 33 56
45 52 47 91

4. Which task was completed the fastest? Why?

5. Were there any challenges faced in Task Two and Task Three? What were those challenges?

6. How would larger datasets impact each of the 3 methods for searching? How do your own
searches relate to how a computer would search for something in a data set in a sequential vs.
parallel and distributed set up? How would the complexity, efficiency and scalability be impacted
in processing (sorting, searching, etc.) and storing large data sets?

7. Make a Connection: How were these tasks connected to sequential and parallel & distributed
computing?

8. The “speedup” of a parallel solution is measured in the time it took to complete the task
sequentially divided by the time it took to complete the task when done in parallel. How did your
task “speedup” in number 2 and number 3?

You might also like