Scheduling workflows by enforcing intertask dependencies

P. C. Attie, M. P. Singh, E. A. Emerson, A. Sheth, M. Rusinkiewicz

Research output: Contribution to journalArticle

Abstract

Workflows are composite activities that can be used to support and automate multisystem applications involving humans, heterogeneous databases and legacy systems. The traditional atomic transaction model, successful for centralized and homogeneous applications, is not suitable for supporting such workflows. Intertask dependencies, which are conditions involving events and dependencies among workflow tasks, are used to specify the coordination requirements among the workflow tasks and are a central component of most workflow models. They form a basis for developing a uniform formal framework for workflows, which is a key contribution of this work. In this paper, we formalize intertask dependencies using temporal logic. This involves event attributes, which are needed to determine whether a dependency is enforceable and to properly schedule events. Each dependency is represented internally as a finite state automaton that captures the computations that satisfy the given dependency. Sets of automata are combined into a scheduler that produces global computations satisfying all relevant dependencies, thus enacting the given workflow. This algorithm is rigorously proved correct; it has been implemented.

Original languageEnglish (US)
Pages (from-to)222-238
Number of pages17
JournalDistributed Systems Engineering
Volume3
Issue number4
DOIs
StatePublished - Dec 1 1996
Externally publishedYes

Fingerprint

Scheduling
Legacy systems
Temporal logic
Finite automata
Composite materials

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Attie, P. C., Singh, M. P., Emerson, E. A., Sheth, A., & Rusinkiewicz, M. (1996). Scheduling workflows by enforcing intertask dependencies. Distributed Systems Engineering, 3(4), 222-238. https://doi.org/10.1088/0967-1846/3/4/003

Scheduling workflows by enforcing intertask dependencies. / Attie, P. C.; Singh, M. P.; Emerson, E. A.; Sheth, A.; Rusinkiewicz, M.

In: Distributed Systems Engineering, Vol. 3, No. 4, 01.12.1996, p. 222-238.

Research output: Contribution to journalArticle

Attie, PC, Singh, MP, Emerson, EA, Sheth, A & Rusinkiewicz, M 1996, 'Scheduling workflows by enforcing intertask dependencies', Distributed Systems Engineering, vol. 3, no. 4, pp. 222-238. https://doi.org/10.1088/0967-1846/3/4/003
Attie PC, Singh MP, Emerson EA, Sheth A, Rusinkiewicz M. Scheduling workflows by enforcing intertask dependencies. Distributed Systems Engineering. 1996 Dec 1;3(4):222-238. https://doi.org/10.1088/0967-1846/3/4/003
Attie, P. C. ; Singh, M. P. ; Emerson, E. A. ; Sheth, A. ; Rusinkiewicz, M. / Scheduling workflows by enforcing intertask dependencies. In: Distributed Systems Engineering. 1996 ; Vol. 3, No. 4. pp. 222-238.
@article{484e9e3bd8104c5a9177eeeebcd93f6b,
title = "Scheduling workflows by enforcing intertask dependencies",
abstract = "Workflows are composite activities that can be used to support and automate multisystem applications involving humans, heterogeneous databases and legacy systems. The traditional atomic transaction model, successful for centralized and homogeneous applications, is not suitable for supporting such workflows. Intertask dependencies, which are conditions involving events and dependencies among workflow tasks, are used to specify the coordination requirements among the workflow tasks and are a central component of most workflow models. They form a basis for developing a uniform formal framework for workflows, which is a key contribution of this work. In this paper, we formalize intertask dependencies using temporal logic. This involves event attributes, which are needed to determine whether a dependency is enforceable and to properly schedule events. Each dependency is represented internally as a finite state automaton that captures the computations that satisfy the given dependency. Sets of automata are combined into a scheduler that produces global computations satisfying all relevant dependencies, thus enacting the given workflow. This algorithm is rigorously proved correct; it has been implemented.",
author = "Attie, {P. C.} and Singh, {M. P.} and Emerson, {E. A.} and A. Sheth and M. Rusinkiewicz",
year = "1996",
month = "12",
day = "1",
doi = "10.1088/0967-1846/3/4/003",
language = "English (US)",
volume = "3",
pages = "222--238",
journal = "Distributed Systems Engineering",
issn = "0967-1846",
number = "4",

}

TY - JOUR

T1 - Scheduling workflows by enforcing intertask dependencies

AU - Attie, P. C.

AU - Singh, M. P.

AU - Emerson, E. A.

AU - Sheth, A.

AU - Rusinkiewicz, M.

PY - 1996/12/1

Y1 - 1996/12/1

N2 - Workflows are composite activities that can be used to support and automate multisystem applications involving humans, heterogeneous databases and legacy systems. The traditional atomic transaction model, successful for centralized and homogeneous applications, is not suitable for supporting such workflows. Intertask dependencies, which are conditions involving events and dependencies among workflow tasks, are used to specify the coordination requirements among the workflow tasks and are a central component of most workflow models. They form a basis for developing a uniform formal framework for workflows, which is a key contribution of this work. In this paper, we formalize intertask dependencies using temporal logic. This involves event attributes, which are needed to determine whether a dependency is enforceable and to properly schedule events. Each dependency is represented internally as a finite state automaton that captures the computations that satisfy the given dependency. Sets of automata are combined into a scheduler that produces global computations satisfying all relevant dependencies, thus enacting the given workflow. This algorithm is rigorously proved correct; it has been implemented.

AB - Workflows are composite activities that can be used to support and automate multisystem applications involving humans, heterogeneous databases and legacy systems. The traditional atomic transaction model, successful for centralized and homogeneous applications, is not suitable for supporting such workflows. Intertask dependencies, which are conditions involving events and dependencies among workflow tasks, are used to specify the coordination requirements among the workflow tasks and are a central component of most workflow models. They form a basis for developing a uniform formal framework for workflows, which is a key contribution of this work. In this paper, we formalize intertask dependencies using temporal logic. This involves event attributes, which are needed to determine whether a dependency is enforceable and to properly schedule events. Each dependency is represented internally as a finite state automaton that captures the computations that satisfy the given dependency. Sets of automata are combined into a scheduler that produces global computations satisfying all relevant dependencies, thus enacting the given workflow. This algorithm is rigorously proved correct; it has been implemented.

UR - http://www.scopus.com/inward/record.url?scp=0006965228&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0006965228&partnerID=8YFLogxK

U2 - 10.1088/0967-1846/3/4/003

DO - 10.1088/0967-1846/3/4/003

M3 - Article

AN - SCOPUS:0006965228

VL - 3

SP - 222

EP - 238

JO - Distributed Systems Engineering

JF - Distributed Systems Engineering

SN - 0967-1846

IS - 4

ER -