Iterative and Parallel Algorithm Design from High Level Language Traces

  • Daniel E. Cooke
  • J. Nelson Rushton
Conference paper

DOI: 10.1007/11428862_132

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3516)
Cite this paper as:
Cooke D.E., Rushton J.N. (2005) Iterative and Parallel Algorithm Design from High Level Language Traces. In: Sunderam V.S., van Albada G.D., Sloot P.M.A., Dongarra J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3516. Springer, Berlin, Heidelberg

Abstract

We present a high level language called SequenceL. The language allows a programmer to describe functions in terms of abstract relationships between their inputs and outputs, and the semantics of the language are capable of automatically discovering and implementing the required algorithms, including iterative and parallel control structures in many cases. Current implementations do not produce code of comparable efficiency to that of a good human programmer. Current implementations can, however, be used as a tool to guide human programmers in discovering and comparing options for parallelizing their solutions. This paper describes the language and approach, and illustrates this kind of guidance with a simple example.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Daniel E. Cooke
    • 1
  • J. Nelson Rushton
    • 1
  1. 1.Computer Science DepartmentTexas Tech UniversityLubbockU.S.A.

Personalised recommendations