| 摘要 |
A method of identifying a string or chain of efficient or“good enough”disc operations for processing (a pseudo optimal chain) is provided. A“pseudo optimal chain”comprises a string or chain of operations that, while not necessarily the optimal string or chain, provides an efficient sequence of operations that can be determined by comparing individual operations to predetermined selection criteria. In contrast to a true optimization technique that can require computing up to N! combinations for N operations, the string or chain of efficient or“good enough”disc operations allows for relatively simpler computations.
|
