Dominator-Path Scheduling - A Global Scheduling Method Steven J. Beaty Department of Mechanical Engineering Colorado State University Fort Collins, Colorado 80523 beaty@longs.lance.colostate.edu Philip H. Sweany Computer Science Department Michigan Technological University 1400 Townsend Drive Houghton MI 49931-1295 (906) 487-3392 sweany@cs.mtu.edu Abstract Dominator-path scheduling performs global instruction scheduling of paths in the dominator tree. Unlike other global scheduling methods, dominator-path scheduling does not require copies of operations to preserve program semantics. In a limited test suite for a typical superscalar architecture, dominator-path scheduling produces schedules requiring 8.3% fewer cycles than local scheduling alone. Introduction Architectures exhibiting instruction-level parallelism (ILP), such as superscalar and superpipelined maTo best exploit chines, are currently popular. instruction-level parallelism in these machines, an instruction scheduling phase is required during compilation. Instruction scheduling is typically classified as local if it considers code only within a basic block and global if it schedules multiple basic blocks at once. Local scheduling methods are well known (see [BeaSl] for one summary.) Local instruction scheduling s largest impediment is its inability to consider context from surrounding blocks. While local scheduling can find parallelism within a basic block, it can do nothing to exploit parallelism between basic blocks. Trace scKedzlling [El1861
/lp/association-for-computing-machinery/dominator-path-scheduling-a-global-scheduling-method-HSaTDGnU9v