Extending list scheduling to consider execution frequency
Document Type
Conference Proceeding
Publication Date
1-1-1996
Abstract
© 1996 IEEE Frequency-BasedListScheduling (FBLS)extendsstan-dardListSchedulingbyconsideringexecutionfrequencies within a schedule. This is usefulfor global instruction scheduling methods thatschedule groups ofbasic blocks, calledmeta-blocks,asthoughtheywerea singleblock Traditionallocalschedulersoperateontheptemisethat each instructionis executed the same number of times as everyotherinstructioninthe “block”,anunwarrentedas-sumptionformeta-blocks. Thisassumptioncan leadmeta-blocks schedulers toproduce ineficient code. FBLS pro-videsananswertothisproblembyconsideringthediflering executionfrequencieswithinmeta-blockswhenscheduling operations. To evaluate our contention that FBLS is a useful ex-tensiontostandard listscheduling,we implementedFBLS andcomparedittostandardlistschedulingwithinthecon-textofdominator-pathscheduling[l],a metu-blockglobal scheduling algorithm. Experimental results show overall run-timeimprovementof10.9%for livermoreloops.
Publication Title
Proceedings of the Annual Hawaii International Conference on System Sciences
Recommended Citation
Bourke, M.,
Sweany, P.,
&
Beaty, S.
(1996).
Extending list scheduling to consider execution frequency.
Proceedings of the Annual Hawaii International Conference on System Sciences,
1, 193-202.
http://doi.org/10.1109/HICSS.1996.495463
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/10522
