Back to Results
First PageMeta Content
Computer programming / Loop optimization / Automatic parallelization / For loop / Loop scheduling / Parallel computing / CPU cache / Control flow / Loop fusion / Compiler optimizations / Computing / Software engineering


Fusion of Loops for Parallelism and Locality∗ Naraig Manjikian and Tarek S. Abdelrahman Department of Electrical and Computer Engineering
Add to Reading List

Document Date: 2001-12-23 06:53:26

Open Document

File Size: 104,80 KB

Share Result on Facebook

City

Berlin / Cambridge / Reading / Waltham / /

Company

MIT Press / /

Country

Canada / /

/

Facility

University of Michigan Center / University of Delaware / University of Toronto / College of Marine Studies / Rice University / University of California / Computer Systems Research Institute / Computer Engineering The University of Toronto Toronto / /

IndustryTerm

strip-mining / scientific applications / traversal algorithm / graph traversal algorithm / data-parallel applications / transformation algorithms / fusion algorithm / faster processors / computing / greedy layout algorithm / pmon performance monitoring hardware / /

OperatingSystem

L3 / /

Organization

Computer Science Division / University of Toronto Toronto / the University of Michigan Center for Parallel Computing / MIT / College of Marine Studies / University of California / Berkeley / Rice University / Locality∗ Naraig Manjikian and Tarek S. Abdelrahman Department of Electrical / University of Toronto / University of Delaware / /

Person

Tarek S. Abdelrahman / /

/

Position

guard / representative / /

ProvinceOrState

Delaware / California / Massachusetts / Ontario / /

Technology

traversal algorithm / 16 processors / KSR processor / 40 processors / one processor / graph traversal algorithm / transformation algorithms / 8 processors / 56 processors / 24 processors / Layout algorithm / fusion algorithm / same processor / 32 processors / graph-based algorithm / greedy layout algorithm / /

SocialTag