2026-09-19T02:38:08Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81759 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Padua, David A. Bikshandi, Ganesh 2015-09-25T20:20:19Z 2015-09-25T20:20:19Z 10000-01-01 2007 2007 To prove these claims, two popular languages, C++ and MATLAB, have been extended with HTA. In addition, the NAS benchmark suite, a set of complex computation intensive parallel programs, have been re-written using HTAs. We compare the lines of code and execution times of HTA programs with that of FORTRAN versions. Our results show that the codes written using HTAs are very readable and at the same efficient. We also show several sample code snippets to demonstrate the clarity of the HTA programs. All the experiments indicate that the explicit notion of tiles makes HTA a powerful language construct for writing a wide range of high performance programs. Made available in DSpace on 2015-09-25T20:20:19Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3269842.pdf: 4806125 bytes, checksum: 52b128f3904edf8661e1bb672e13dd04 (MD5) Previous issue date: 2007 Embargo set by: Seth Robbins for item 83040 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 153 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007. http://hdl.handle.net/2142/81759 (MiAaPQ)AAI3269842 eng Computer Science Parallel Programming With Hierarchically Tiled Arrays text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.