I'm interested in studying different region formation algorithms for the interblock scheduling code. Can someone please tell me the restrictions on the form of these regions? (i.e., what does the Haifa scheduler expect?) Specifically, I am interested in forming treegions (tree regions).
If interested see this reference: W. A. Havanki, S. Banerjia and T. M. Conte, "Treegion scheduling for wide-issue processors," Proceedings of the 4th International Symposium on High-Performance Computer Architecture (HPCA-4), (Las Vegas), Feb. 1998. or H. Zhou and T.M. Conte, "Code Size Efficiency in Global Scheduling for ILP Processors," Proceedings of the 6th Annual Workshop on the Interaction between Compilers and Computer Architectures, February 2002. Thanks, Chad
