Parallel Processing Letters · 1994 · 13 citations · 0 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureHardware Description LanguagesSchedulingControl-flow AnalysisHardware Modeling For Digital SystemsMicroarchitecture DesignControl Flow Graph AnalysisControl-flow Graph ConstructionDynamic Scheduling AlgorithmsHardware SchedulingPath ExplosionPath Generation
This paper presents Dynamic Loop Scheduling (DLS), a loop-based algorithm that can efficiently schedule large, control-flow dominated designs. It compares favourably with results produced for traditional path-based approaches and at the same time requires much less overhead to implement. The high-performance of DLS is due mainly to the inclusion of loop feedback edges in the control-flow graph and the interruption of the path generation on the fly. The latter eliminates the generation of false paths thereby avoiding the path explosion problem.