Dybbuk runtime system

Ravi Ponnusamy*, Joel Saltz, Alok Choudhary, Raja Das, Dimitri Mavriplis

*Corresponding author for this work

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

1 Scopus citations

Abstract

Over the past few years, we have developed methods that make it possible for a compiler to efficiently map many sparse and unstructured scientific problems to scalable multiprocessor architectures. These methods are implemented using compiler embeddable runtime support procedures. These procedures can be thought of as supporting a type of weakly coherent distributed shared memory that can be closely coupled to distributed shared memory compilers. These procedures (1) coordinate inter-processor data movement, (2) manage the storage of and access to copies of off-processor data, (3) support a shared name space, and (4) couple run-time data and workload partitioners to compilers. We are in the process of implementing prototype High Performance Fortran compilers which use this runtime support to handle unstructured computations.

Original languageEnglish (US)
Title of host publication1993 IEEE Compcon Spring
PublisherPubl by IEEE
Pages205-212
Number of pages8
ISBN (Print)0780312945
StatePublished - Jan 1 1993
Event38th Annual IEEE Computer Society International Computer Conference - COMPCON SPRING '93 - San Francisco, CA, USA
Duration: Feb 22 1993Feb 26 1993

Publication series

Name1993 IEEE Compcon Spring

Other

Other38th Annual IEEE Computer Society International Computer Conference - COMPCON SPRING '93
CitySan Francisco, CA, USA
Period2/22/932/26/93

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Dybbuk runtime system'. Together they form a unique fingerprint.

  • Cite this

    Ponnusamy, R., Saltz, J., Choudhary, A., Das, R., & Mavriplis, D. (1993). Dybbuk runtime system. In 1993 IEEE Compcon Spring (pp. 205-212). (1993 IEEE Compcon Spring). Publ by IEEE.