A Note on Parallel Algorithmic Speedup Bounds

Details A Note on Parallel Algorithmic Speedup Bounds A Note on Parallel Algorithmic Speedup Bounds

2011-04-20

arxiv.org/abs/1104.4078v1

Computer Science

Distributed, Parallel, and Cluster Computing

5 pages, 1 figure

Scientific paper

A parallel program can be represented as a directed acyclic graph. An
important performance bound is the time to execute the critical path through
the graph. We show how this performance metric is related to Amdahl speedup and
the degree of average parallelism. These bounds formally exclude superlinear
performance.

Affiliated with

Also associated with

No associations

Rating

A Note on Parallel Algorithmic Speedup Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Note on Parallel Algorithmic Speedup Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Parallel Algorithmic Speedup Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-433538