Automatic algorithm recognition and replacement a new approach to program optimization
"This book describes a fundamentally new theoretical framework for finding poor algorithms in an application program and replacing them with ones that parallelize the code."--Jacket.
Saved in:
| Main Author | |
|---|---|
| Other Authors | |
| Format | Electronic eBook |
| Language | English |
| Published |
Cambridge, Mass. :
MIT Press,
2000.
|
| Subjects | |
| Online Access | Full text |
| ISBN | 9780262279703 |
| Physical Description | 1 online zdroj (viii, 219 pages) |
Cover
Table of Contents:
- 1. Introduction
- 2. The Problem and Its Complexity
- 3. Related Work
- 4. Reducing Program Variation
- 5. Internal Program Representation
- 6. Converting to a Canonical Form
- 7. Matching Subprograms and Patterns
- 8. Extracting Subprograms
- 9. Valid Algorithm Replacement
- 10. Selecting Algorithm Replacements
- 11. Performing Algorithm Replacements
- 12. Time Complexity and Performance
- 13. Conclusion
- App. A. System Architecture
- App. B. Module Design
- App. C. Input Definition
- App. D. Statistics on Heuristic Behavior.