Algorithms with this property are often expressed in terms of the relationships between T-sub-one, T-sub-p, and T-sub-infinity under the work-span or work-time frameworks. Gustafson’s (10[1])law generalizes an earlier statement (10[1])that this property provides improvements equal to “one over the quantity ‘one minus p plus p over s.’” Register (10[1])renaming and a common data bus are among the innovations that Tomasulo’s algorithm uses to improve this property, whose gains are also described by Amdahl’s law. (10[1])Flynn’s (10[2]-5[1])taxonomy uses categories such as MIMD to describe this property’s (10[1]-5[1])presence at the data and/or instruction levels. (-5[1])Unlike concurrency, this property involves multiple (10[1])processes (10[2])running simultaneously, (10[5])such as (10[1])in (10[1])pipelining. (10[4]-5[1])For 10 points, name (-5[1])this property contrasted (10[1])with sequential (10[2])computing. (10[2])■END■ (10[10]0[6])