The Community for Technology Leaders
Cluster Computing and the Grid, IEEE International Symposium on (2008)
May 19, 2008 to May 22, 2008
ISBN: 978-0-7695-3156-4
pp: 663-668
ABSTRACT
In this paper, the expressiveness of the simple Scufl data-flow language is studied by showing how it can be used to implement Turing machines. To do that, several non trivial Scufl patterns such as self-looping or sub-workflows are required and we precisely explicit them. The main result of this work is to show how a complex workflow can be implemented using a very simple data-flow language. Beyond that, it shows that Scufl is a Turing complete language, given some restrictions that we discuss.
INDEX TERMS
Scientific workflow, Scufl language, Turing machines
CITATION

J. Montagnat and T. Glatard, "Implementation of Turing Machines with the Scufl Data-Flow Language," 2008 8th International Symposium on Cluster Computing and the Grid (CCGRID '08)(CCGRID), Lyon, 2008, pp. 663-668.
doi:10.1109/CCGRID.2008.52
94 ms
(Ver 3.3 (11022016))