An Algorithm for Adaptive Maximization of Speedup [PDF]
V. Wojcik and J. Martin, September 2003.
We describe an algorithm for workload evaluation and auto-adaptive maximization of speedup. Emphasis is put on exploitation of medium- and fine-grain algorithmic parallelism. The simulation results suggest that significant speedups are achievable for communications-bound algorithms. The implications for design of programming languages and supercomputer design are suggested.