Scalability -- Introduction

• If the ratio Mem(n)/p is held constant, then an algorithm is scalable if

  • E(p,u,n(p)) = constant.

• In other words, maintaining memory use per node constant allows efficiency to be maintained,

• In practice a slight degradation is acceptable.

Previous slide

Next slide

Back to first slide

View graphic version