Compiler Analysis of Sparse and Irregular Computations
Lin, Yuan
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81980
Description
Title
Compiler Analysis of Sparse and Irregular Computations
Author(s)
Lin, Yuan
Issue Date
2000
Doctoral Committee Chair(s)
Padua, David A.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Language
eng
Abstract
We have studied five different possible parallelization methods for irregular reduction loops, all of which can be applied automatically by a compiler. We compared their ease of use, applicability, supporting compiler techniques required, run-time resource requirement, and, most importantly, run-time performance. From our analysis and experiments, we developed a general guideline for choosing an efficient parallel irregular reduction method for given programs and input data sets.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
