Now showing items 21-27 of 27

    • Space exploration using parallel orbits : a study in parallel symbolic computing 

      Janjic, Vladimir; Brown, Christopher Mark; Neunhoeffer, Max; Hammond, Kevin; Linton, Stephen Alexander; Loidl, Hans-Wolfgang (IOS Press, 2013-09) - Conference item
      Orbit enumerations represent an important class of mathematical algorithms which is widely used in computational discrete mathematics. In this paper, we present a new shared-memory implementation of a generic Orbit skeleton ...
    • Structured arrows : a type-based framework for structured parallelism 

      Castro, David (University of St Andrews, 2018-06-27) - Thesis
      This thesis deals with the important problem of parallelising sequential code. Despite the importance of parallelism in modern computing, writing parallel software still relies on many low-level and often error-prone ...
    • Timing properties and correctness for structured parallel programs on x86-64 multicores 

      Hammond, Kevin; Brown, Christopher Mark; Sarkar, Susmit (Springer, 2016) - Conference item
      This paper determines correctness and timing properties for structured parallel programs on x86-64 multicores. Multicore architectures are increasingly common, but real architectures have unpredictable timing properties, ...
    • Towards semi-automatic data-type translation for parallelism in Erlang 

      Barwell, Adam David; Brown, Christopher Mark; Castro, David; Hammond, Kevin (ACM, 2016-09-23) - Conference item
      As part of our ongoing research programme into programmer-in-the-loop parallelisation, we are studying the problem of introducing alternative data structures to support parallelism. Automated support for data structure ...
    • Towards ‘Metaheuristics in the Large’ 

      Swann, Jerry; Hammond, Kevin (2015-06-07) - Conference paper
      There is a pressing need for a higher-level architectural per- spective in metaheuristics research. This article proposes a purely functional collection of component signatures as a basis for the scalable and automatic ...
    • Type-based allocation analysis for co-recursion in lazy functional languages 

      Vasconcelos, Pedro Baltazar; Jost, Steffen; Florido, Mario; Hammond, Kevin (Springer-Verlag, 2015) - Conference item
      This paper presents a novel type-and-effect analysis for pre-dicting upper-bounds on memory allocation costs for co-recursive def-initions in a simple lazily-evaluated functional language. We show thesoundness of this ...
    • Type-based cost analysis for lazy functional languages 

      Jost, Steffen; Vasconcelos, Pedro; Florido, Mário; Hammond, Kevin (2017-06) - Journal article
      We present a static analysis for determining the execution costs of lazily evaluated functional languages, such as Haskell. Time- and space-behaviour of lazy functional languages can be hard to predict, creating a significant ...