Talk:Karp–Flatt metric

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Plagiarism[edit]

The last two sentences of "Use" are paraphrases of Parallel Programming in C with MPI and OpenMP. I know, because I looked up this article while reading the text, and was immediately struck by deja vu -- revealed to be incredibly justified. 74.70.124.27 (talk) 03:19, 9 May 2008 (UTC) [Edit: The user who added the material was subsequently banned. Someone should rewrite or remove.][reply]

Circular[edit]

This sentence: "While the Karp-Flatt metric is mentioned frequently in computer science literature, it was rarely used as a diagnostic tool the way speedup and efficiency are. Karp and Flatt hoped to correct this by proposing this metric."

Is circular and does not make much sense. They hoped to remedy the fact that their metric is not used much in computer science literature by proposing their metric? 69.204.209.103 (talk) 07:11, 4 June 2009 (UTC)[reply]

Psi[edit]

Why using $\psi$ for the speedup?

I can see in Speedup that they use $S_{p}$ , and the Article from Karp and Flatt used s for the speedup (and $T_{s}$ for the time taken for the serial part).

I would use "s" or " $S_{p}$ " for the speedup since $\psi$ adds some unneeded complexity (just a suggestion). — Preceding unsigned comment added by 188.79.44.234 (talk) 17:06, 5 February 2014 (UTC)[reply]