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 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 taxonomy uses categories such as MIMD to describe this property’s (-5[1])presence at the data and/or instruction levels. Unlike concurrency, this property involves multiple processes running simultaneously, such as (10[1])in pipelining. For 10 points, name this property contrasted with sequential computing. ■END■ (10[5])