Adapting optimal code generation for arithmetic expressions to the instruction sets available on present-day computers

bo t tom before moving on to the next. The shaded areas in the figure show d rum latency. The record label indicates the period during which a record is being accessed. Figure 3(b) shows an SLTF schedule for the same collection. It is not difficult to show that this is the unique SLTF schedule for this example since no two records share a starting point. In general, however, when two or more distinct SErF schedules exist, they may not all be o f the same length. No te that the SeTF schedule in Figure 3(b) has less latency time than the schedule in Figure 3(a).