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 that this property provides improvements equal to “one over the quantity ‘one minus p plus p over s.’” Register 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. Flynn’s (10[1])taxonomy uses categories such as MIMD to describe this property’s presence at the data and/or instruction levels. Unlike concurrency, this property involves multiple processes (10[2])running simultaneously, (10[1])such as in pipelining. (10[1])For 10 points, name this property contrasted with sequential computing. ■END■ (10[2]0[2])