Analysis
•What
resources does the algorithm use?
•Time =
2 log2 n
•Processors
P = n/2
•Space
= P memory cells for local sums
•Communications
2 (P-1) sends
The Ladner-Fischer algorithm requires twice as much time as standard global sum