Loading...
Please wait, while we are loading the content...
Similar Documents
The Minimal Number of Communication Startups when Tiling Space-Time Mapped Programs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Griebl, Martin |
| Copyright Year | 2001 |
| Abstract | Tiling is a well-known te hnique for sequential ompiler optimization, as well as for automati program parallelization. However, in the ontext of parallelization, tiling should not be onsidered as a stand-alone te hnique, but should be applied after a dedi ated parallelization phase, in our ase after spa e-time mapping [17℄. We show how tiling an bene t from spa e-time mapping, and we derive an algorithm for omputing tiles whi h an minimize the number of ommuni ation startups, taking the number of physi ally available pro essors into a ount. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.icsa.informatics.ed.ac.uk/cpc2001/Proceedings/griebl.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |