Software exhibits scalable parallelism if it can make use of added processors to solve larger problems, i.e., this term refers to software for which Gustafson's law holds. Consider a program which execution time is dominated by one or more loops, each of which updates every element of an array. For example, the following finite difference heat equation stencil calculation:for t := 0 to T do for i := 1 to N-1 do new(i) := * .25 // explicit forward-difference with R = 0.25 end for i := 1 to N-1 do A(i) := new(i) end end