Code Generation for Multiple Mappings
| dc.contributor.author | Kelly, Wayne | en_US |
| dc.contributor.author | Pugh, William | en_US |
| dc.contributor.author | Rosser, Evan | en_US |
| dc.date.accessioned | 2004-05-31T22:27:15Z | |
| dc.date.available | 2004-05-31T22:27:15Z | |
| dc.date.created | 1994-12 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | There has been a great amount of recent work toward unifying iteration reordering transformations. Many of these approaches represent transformations as affine mappings from the original iteration space to a new iteration space. These approaches show a great deal of promise, but they all rely on the ability to generate code that iterates over the points in these new iteration spaces in the appropriate order. This problem has been fairly well-studied in the case where all statements use the same mapping. We have developed an algorithm for the less well-studied case where each statement uses a potentially different mapping. Unlike many other approaches, our algorithm can also generate code from mappings corresponding to loop blocking. We address the important trade-off between reducing control overhead and duplicating code. (Also cross-referenced as UMIACS-TR-94-87.1) | en_US |
| dc.format.extent | 217377 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/651 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3317.1 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-94-87.1 | en_US |
| dc.title | Code Generation for Multiple Mappings | en_US |
| dc.type | Technical Report | en_US |