METHOD FOR SERIALIZING ORDER SO AS TO MINIMIZE COLLISION IMPACTS
Original Publication Date: 1999-Oct-01
Included in the Prior Art Database: 2003-Jun-19
At times it is advantageous to order a group of events relative to each other so as to enhance their combined inter-relationships. For example, consider the case where I/O performance is to be measured. Suppose that a total of four different files are to be included as a part of two different measurements, each involving a different two of the four files. Further suppose that two of the files are on the same disk drive. In such a situation the I/O performance results will not be maximized should we measure the two files on the same disk drive at the same time and then subsequently measure the other two files. We would do better to measure each of the two files individually, albeit paired with one of the other four files in the measurement group. This problem becomes more acute when we consider a variety of overlapping physical constraints, such as internal pathing constraints, shared adapter cards, control units as well as a variety of other possible shared resources. Of course this problem is not limited to measuring I/O performance results, however it does serve our purposes here of providing an illustrative example. The purpose of this paper is to describe an algorithm such that overlapping constraints can be accounted for and thus avoided (or sought after (by reversing the 'goodness' measure)) thereby providing a serialization order that is near-optimal for the problem domain.