Difference between scalability and speedup?

Viewed 986

I'm reading the textbook for my parallel system course and I found these two popular notions:

enter image description here

Can someone tell me the difference? For me, Tseq is semantically (and pratically) equal to Tpar(1)

Update after answers:

I think that I understood the difference, but I have still a question: I'm optimizing this code. In order to make my parallel version well-balanced, an approximate result is used. The difference is very small and be considered negligible, but the workload is greatly balanced and scalability greatly improves from that.

In addition, I did some optimizations, like using raw-pointers instead of data structures built upon them (e.g. cv::Mat) used in the original code.

So my question is: to measure speedup should I use the original code (the one that I linked) or would be like cheating?

2 Answers
Related