Optimal automatic multi-pass shader partitioning by dynamic programming

Proceedings of the SIGGRAPH/Eurographics Workshop on Graphics Hardware

Volumn 2005, Issue , 2005, Pages 91-98

  Heirich, Alan ^a  

^a Sony Computer Entertainment Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER GRAPHICS; COMPUTER HARDWARE; PROBLEM SOLVING; SCHEDULING;

AUTOMATIC PARTITIONING; COMPLEX SHADERS; GPU; OPTIMAL AUTOMATIC MULTIPASS SHADERS;

DYNAMIC PROGRAMMING;

EID: 33750917418     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1071866.1071881     Document Type: Conference Paper

References (12)

1. [AK02] ALLEN R., KENNEDY K.: Optimizing Compilers for Modern Architectures. Morgan-Kaufmann, 2002.
2. [Bel57] BELLMAN R. E.: Dynamic Programming. Dover, 1957.
3. [CNS*02] CHAN E., NG R., SEN P., PROUDFOOT K., HANRAHAN P.: Efficient partitioning of fragment shaders for multipass rendering on programmable graphics hardware. In Graphics Hardware 2002 (Sept. 2002), pp. 69-78.
4. [Dav85] DAVIS L.: Job shop scheduling with genetic algorithms. In Proceedings of the 1st International Confer ence on Genetic Algorithms (Mahwah, NJ, USA, 1985), Lawrence Erlbaum Associates, Inc., pp. 136-140.
5. [Die96] DIEFENBACH P. J.: Multi-pass pipeline rendering: interaction and realism through hardware provisions. PhD thesis, Dept. Computer and Information Science, Univ. Pennsylvania, 1996. MS-CIS-96-26.
6. [FHH04] FOLEY T., HOUSTON M., HANRAHAN P.: Efficient partitioning of fragment shaders for multiple-output hardware. In Graphics Hardware 2004 (Aug. 2004), pp. 45-54.
7. [GJ75] GAREY M. R., JOHNSON D. S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4 (1975), 397-411.
8. [HD98] HARTMANN S., DREXL A.: Project scheduling with multiple modes: A comparison of exact algorithms. Networks 32 (1998), 283-297.
9. [MSSU02] MÖHRING R. H., SCHULZ A. S., STORK F., UETZ M.: Solving project scheduling problems by minimum cut computations. Management Science 49, 3 (2002), 330-350.
10. [POAU00] PEERCY M. S., OLANO M., AIREY J., UNGAR P. J.: Interactive multi-pass programmable shading. In Proceedings of ACM SIGGRAPH 2000 (July 2000), Computer Graphics Proceedings, Annual Conference Series, pp. 425-432.
11. [RLV*04] RIFFEL A. T., LEFOHN A. E., VIDIMCE K., LEONE M., OWENS J. D.: Mio: Fast multipass partitioning via priority-based instruction scheduling. In Graphics Hardware 2004 (Aug. 2004), pp. 35-44.
12. [SU70] SETHI R., ULLMAN J.: The generation of optimal code for arithmetic expresssions. J. ACM 17, 4 (1970), 715-728.