CS498 DHP Program Optimization. Fall 2005. Course organization. Instructors: Mar í a Garzar á n ( [email protected] ) David Padua ( [email protected] ) Time and location: 1111SC -- WF 11-12:15 Course website: http://polaris.cs.uiuc.edu/~padua/cs498DHP Evaluation: 2 midterms 25% each
PowerPoint Slideshow about ' CS498 DHP Program Optimization' - kin
An Image/Link below is provided (as is) to download presentation
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Program optimization is difficult for many reasons:
Machine features may interact in ways that are difficult to analyze. Explaining/predicting behavior is difficult and has become more difficult with increasing machine complexity.
There many ways to solve a problem and in many cases it is not clear which one is better. It depends on the class of machine, and the characteristics of the input data. For example, it is difficult to know when is quicksort better than radix sort.
In general, a “proof” of optimality is unrealistic. Usually difficult to know how much more could be done.