On the automatic parallelization of sparse and irregular fortran programs

Yuan Lin, David Padua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Automatic parallelization is usually believed to be less effective at exploiting implicit parallelism in sparse/irregular programs than in their dense/regular counterparts. However, not much is really known because there have been few research reports on this topic. In this work, we have studied the possibility of using an automatic parallelizing compiler to detect the parallelism in sparse/irregular programs. The study with a collection of sparse/irregular programs led us to some common loop patterns. Based on these patterns three new techniques were derived that produced good speedups when manually applied to our benchmark codes. More importantly, these parallelization methods can be implemented in a parallelizing compiler and can be applied automatically.

Original languageEnglish (US)
Title of host publicationLanguages, Compilers, and Run-Time Systems for Scalable Computers - 4th International Workshop, LCR 1998, Selected Papers
PublisherSpringer
Pages41-56
Number of pages16
ISBN (Print)3540651721, 9783540651727
DOIs
StatePublished - 1998
Event4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, LCR 1998 - Pittsburgh, PA, United States
Duration: May 28 1998May 30 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1511 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, LCR 1998
Country/TerritoryUnited States
CityPittsburgh, PA
Period5/28/985/30/98

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On the automatic parallelization of sparse and irregular fortran programs'. Together they form a unique fingerprint.

Cite this