SequenceL: transparency and multi-core parallelisms

Authors:
Brad Nemanich;Daniel Cooke;J. Nelson Rushtom
Affiliations:
Texas Tech University, Lubbock, TX, USA;Texas Tech University, Abilene, TX, USA;Texas Tech University, Lubbock, TX, USA
Venue:
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
Year:
2010

Citing 10
Cited 0

Report on the programming language Haskell: a non-strict, purely functional language version 1.2

ACM SIGPLAN Notices - Haskell special issue
Programming by multiset transformation

Communications of the ACM
Programming parallel algorithms

Communications of the ACM
An introduction to SequenceL: a language to experiment with constructs for processing nonscalars

Software—Practice & Experience
The emperor's old clothes

Communications of the ACM
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Automatic parallel control structures in SequenceL

Software—Practice & Experience
NASA's Exploration Agenda and Capability Engineering

Computer
Normalize, transpose, and distribute: An automatic approach for handling nonscalars

ACM Transactions on Programming Languages and Systems (TOPLAS)
Taking Parnas's Principles to the Next Level: Declarative Language Design

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we review the computational laws upon which SequenceL is based, give evidence of the transparency of SequenceL code, and compare performance results of Parallel Haskell and SequenceL codes running on multi-core processors. For the comparisons with Haskell we employ a recently developed SequenceL compiler that generates multi-threaded C++ and has a runtime system that manages threads for multi-core processors.