Mapping realistic data sets on parallel computers

R. Ponnusamy, N. Mansour, Alok Nidhi Choudhary, G. C. Fox

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

3 Scopus citations

Abstract

Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the execution time of the application if the size of the problem is large. The authors propose reducing the problem size by a mapping-oriented graph contraction technique. They present a graph contraction (GC) heuristic algorithm that yields a smaller representation of the problem, to which mapping is then applied. The experimental results show that the GC algorithm still leads to good quality mapping solutions to the original problem, while producing remarkable reductions in mapping time. The GC algorithm allows large-scale mapping to become efficient, especially when slow but high-quality mappers are used.

Original languageEnglish (US)
Title of host publicationProceedings of 7th International Parallel Processing Symposium, IPPS 1993
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages123-128
Number of pages6
ISBN (Electronic)0818634421, 9780818634420
DOIs
StatePublished - 1993
Event7th International Parallel Processing Symposium, IPPS 1993 - Newport, United States
Duration: Apr 13 1993Apr 16 1993

Publication series

NameProceedings of 7th International Parallel Processing Symposium, IPPS 1993

Conference

Conference7th International Parallel Processing Symposium, IPPS 1993
Country/TerritoryUnited States
CityNewport
Period4/13/934/16/93

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Software
  • Computational Theory and Mathematics
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Mapping realistic data sets on parallel computers'. Together they form a unique fingerprint.

Cite this