Skip to main content

Ypnos: declarative, parallel structured grid programming

Orchard, Dominic A., Bolingbroke, Max, Mycroft, Alan (2010) Ypnos: declarative, parallel structured grid programming. . pp. 15-24. (doi:10.1145/1708046.1708053) (KAR id:57499)

PDF Author's Accepted Manuscript
Language: English
Download (189kB)
[thumbnail of ypnos-damp10.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:
http://dx.doi.org/10.1145/1708046.1708053

Abstract

A fully automatic, compiler-driven approach to parallelisation can result in unpredictable time and space costs for compiled code. On the other hand, a fully manual approach to parallelisation can be long, tedious, prone to errors, hard to debug, and often architecture-specific. We present a declarative domain-specific language, Ypnos, for expressing structured grid computations which encourages manual specification of causally sequential operations but then allows a simple, predictable, static analysis to generate optimised, parallel implementations. We introduce the language and provide some discussion on the theoretical aspects of the language semantics, particularly the structuring of computations around the category theoretic notion of a comonad.

Item Type: Article
DOI/Identification number: 10.1145/1708046.1708053
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Dominic Orchard
Date Deposited: 05 May 2017 13:35 UTC
Last Modified: 24 Nov 2021 10:40 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/57499 (The current URI for this page, for reference purposes)
Orchard, Dominic A.: https://orcid.org/0000-0002-7058-7842
  • Depositors only (login required):

Downloads

Downloads per month over past year