Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Synthesising and Verifying Multi-Core Parallelism in Categories of Nested Code Graphs
 

Summary: Synthesising and Verifying Multi-Core Parallelism
in Categories of Nested Code Graphs
Christopher Kumar Anand
anandc@mcmaster.ca
Wolfram Kahl
kahl@cas.mcmaster.ca
Software Quality Research Laboratory
Department of Computing and Software, McMaster University
Hamilton, Ontario, Canada L8S 4K1
24 January 2008
Abstract
We present the Multi-Core layer of the larger Coconut project to support high-performance,
high-assurance scientific computation. Programs are represented by nested code graphs, using
domain specific languages.
At the Multi-Core level, the language is very restricted, in order to restrict control flow to non-
branching, synchronising control flow, which allows us to treat multi-core parallelism in essentially
the same way as instruction-level parallelism for pipelined multi-issue processors. The resulting
schedule is then presented as a "locally sequential program", which, like high-quality conventional
assembly code in the single-core case, is arranged for hiding latencies at execution time so that
peak performance can be reached, and can also be understood by programmers. We present an

  

Source: Anand, Christopher - Department of Computing and Software, McMaster University

 

Collections: Biology and Medicine; Computer Technologies and Information Sciences