Predicting resource consumption of higher-order workflows

Markus Klinik; J. Hage; Jan Martin Jansen; Rinus Plasmeijer

doi:10.1145/3018882.3018885

Predicting resource consumption of higher-order workflows

Markus Klinik, J. Hage, Jan Martin Jansen, Rinus Plasmeijer

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

We present a type and effect system for static analysis of programs written in a simplified version of iTasks. iTasks is a workflow specification language embedded in Clean, a general-purpose functional programming language. Given costs for basic tasks, our analysis calculates an upper bound of the total cost of a workflow. The analysis has to deal with the domain-specific features of iTasks, in particular parallel and sequential composition of tasks, as well as the general-purpose features of Clean, in particular let-polymorphism, higher-order functions, recursion and lazy evaluation. Costs are vectors of natural numbers where every element represents some resource, either consumable or reusable.

Original language	English
Title of host publication	Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
Subtitle of host publication	PEPM 2017
Publisher	Association for Computing Machinery
Pages	99-110
Number of pages	12
ISBN (Print)	9781450347211
DOIs	https://doi.org/10.1145/3018882.3018885
Publication status	Published - 2 Jan 2017

Access to Document

10.1145/3018882.3018885

Cite this

@inproceedings{29e903fdfab648ac98db23b9435bc1b9,

title = "Predicting resource consumption of higher-order workflows",

abstract = "We present a type and effect system for static analysis of programs written in a simplified version of iTasks. iTasks is a workflow specification language embedded in Clean, a general-purpose functional programming language. Given costs for basic tasks, our analysis calculates an upper bound of the total cost of a workflow. The analysis has to deal with the domain-specific features of iTasks, in particular parallel and sequential composition of tasks, as well as the general-purpose features of Clean, in particular let-polymorphism, higher-order functions, recursion and lazy evaluation. Costs are vectors of natural numbers where every element represents some resource, either consumable or reusable.",

author = "Markus Klinik and J. Hage and Jansen, {Jan Martin} and Rinus Plasmeijer",

year = "2017",

month = jan,

day = "2",

doi = "10.1145/3018882.3018885",

language = "English",

isbn = "9781450347211",

pages = "99--110",

booktitle = "Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation",

publisher = "Association for Computing Machinery",

address = "United States",

}

TY - GEN

T1 - Predicting resource consumption of higher-order workflows

AU - Klinik, Markus

AU - Hage, J.

AU - Jansen, Jan Martin

AU - Plasmeijer, Rinus

PY - 2017/1/2

Y1 - 2017/1/2

N2 - We present a type and effect system for static analysis of programs written in a simplified version of iTasks. iTasks is a workflow specification language embedded in Clean, a general-purpose functional programming language. Given costs for basic tasks, our analysis calculates an upper bound of the total cost of a workflow. The analysis has to deal with the domain-specific features of iTasks, in particular parallel and sequential composition of tasks, as well as the general-purpose features of Clean, in particular let-polymorphism, higher-order functions, recursion and lazy evaluation. Costs are vectors of natural numbers where every element represents some resource, either consumable or reusable.

AB - We present a type and effect system for static analysis of programs written in a simplified version of iTasks. iTasks is a workflow specification language embedded in Clean, a general-purpose functional programming language. Given costs for basic tasks, our analysis calculates an upper bound of the total cost of a workflow. The analysis has to deal with the domain-specific features of iTasks, in particular parallel and sequential composition of tasks, as well as the general-purpose features of Clean, in particular let-polymorphism, higher-order functions, recursion and lazy evaluation. Costs are vectors of natural numbers where every element represents some resource, either consumable or reusable.

U2 - 10.1145/3018882.3018885

DO - 10.1145/3018882.3018885

M3 - Conference contribution

SN - 9781450347211

SP - 99

EP - 110

BT - Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

PB - Association for Computing Machinery

ER -

Predicting resource consumption of higher-order workflows

Abstract

Access to Document

Fingerprint

Cite this