Back to Results
First PageMeta Content



Beyond Reuse Distance Analysis: Dynamic Analysis for Characterization of Data Locality Potential NAZNIN FAUZIA, VENMUGIL ELANGO, and MAHESH RAVISHANKAR, The Ohio State University J. RAMANUJAM, Louisiana State University
Add to Reading List

Document Date: 2014-05-20 09:21:53


Open Document

File Size: 3,92 MB

Share Result on Facebook

City

New York / /

Company

ACM Inc. / Patterson / /

Currency

USD / /

/

Facility

Penn Plaza / Boelter Hall / University of California Los Angeles LOUIS-NOEL P. SADAYAPPAN / University of California Los Angeles / Louisiana State University / The Ohio State University / Patrick Taylor Hall / /

/

IndustryTerm

shortest-paths algorithm / communication avoiding algorithms / details on our algorithm / energy cost / hierarchical memory systems / alternate algorithms / tileable algorithm / peak processing rate / i7 processor / graph algorithms / equivalent algorithms / energy / /

Organization

U.S. Department of Energy / United States Army / University of California Los Angeles LOUIS-NOEL P. SADAYAPPAN / Louisiana State University / U.S. National Science Foundation / University of California Los Angeles / The Ohio State University / /

Person

Wolf / VENMUGIL ELANGO / Atanas Rountev / Lam / MAHESH RAVISHANKAR / LOUIS-NOEL P. SADAYAPPAN / NAZNIN FAUZIA / /

/

Position

Author / Optimization General / compiler writer / model data locality / /

ProvinceOrState

New York / /

Technology

implemented algorithm / 80286 processor / using graph algorithms / base algorithm / shortest-paths algorithm / two processors / Floyd-Warshall algorithm / effective algorithms / so-called communication avoiding algorithms / simulation / virtual memory / tileable algorithm / i7 processor / /

URL

http /

SocialTag