A Logical Framework for Scheduling Workflows Under Resource Allocation Constraints

Senkul, Pinar; Kifer, Michael; Toroslu, İsmail Hakkı

doi:10.1016/b978-155860869-6/50067-6

Cited by 48 publications

(37 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It uses constraint logic programming (CLP) integrating with Concurrent Transaction Logic (CTR) thus introducing a new logical formalism. Our work can be seen as an extension to [27] where a stable and reliable communication infrastructure is assumed. In addition, we propose strategies to cope with network dynamics and integrate them into the constraint solving process.…”

Section: State Of the Artmentioning

confidence: 99%

“…WfMSs using Constraint-Programming: An interesting approach can be found in [27] which deals with scheduling under resource allocation constraints. It uses constraint logic programming (CLP) integrating with Concurrent Transaction Logic (CTR) thus introducing a new logical formalism.…”

Section: State Of the Artmentioning

confidence: 99%

“…There are only few approaches that consider scheduling under resource allocation constraints [27,3]. However, these algorithms assume a stable infrastructure and do not provide robustness against topology changes.…”

Section: Introductionmentioning

confidence: 99%

“…To copy otherwise, or to republish, to post on servers or to redistribute to lists, requires a fee and/or special permission from the publisher, ACM. VLDB '08, August [24][25][26][27][28][29][30]2008, Auckland, New Zealand Copyright 2008 VLDB Endowment, ACM 000-0-00000-000-0/00/00. ble wired infrastructure.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Adaptive workflow scheduling under resource allocation constraints and network dynamics

Avanes

Freytag

2008

Proc. VLDB Endow.

View full text Add to dashboard Cite

Workflow concepts are well suited for scenarios where many distributed entities work collaboratively together to achieve a common goal. Today, workflows are mostly used as computerized model for business processes executed in instances in commercial Workflow Management Systems. However, there are many other application domains where computersupported cooperative work can be captured and organized by workflows. In this paper, we investigate the task of scheduling workflows in self-organizing wireless networks for disaster scenarios. Most research work in the field of workflow scheduling has been driven by temporal and causality constraints. We present an adaptive scheduling algorithm that finds a suitable execution sequence for workflow activities by additionally considering resource allocation constraints and dynamic topology changes. Our approach utilizes a multi-stage distribution algorithm which we extend with techniques to cope with network dynamics.

show abstract

Section: State Of the Artmentioning

confidence: 99%

Section: State Of the Artmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Adaptive workflow scheduling under resource allocation constraints and network dynamics

Avanes

Freytag

2008

Proc. VLDB Endow.

View full text Add to dashboard Cite

show abstract

“…It has been successfully applied to modeling and reasoning about workflows and services [5,19,6,15]. In this paper we show how CTR can model and extend WSMO choreography, including the ability to specify contract requirements.…”

Section: Ctr To the Rescuementioning

confidence: 99%

WSMO Choreography: From Abstract State Machines to Concurrent Transaction Logic

Roman

Kifer

Fensel

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Several approaches to semantic Web services, including OWL-S, SWSF, and WSMO, have been proposed in the literature with the aim to enable automation of various tasks related to Web services, including discovery, contracting, enactment, monitoring, and mediation. The ability to specify processes and to reason about them is central to these initiatives. In this paper we analyze the WSMO choreography model, which is based on Abstract State Machines (ASMs), and propose a methodology for generating WSMO choreography from visual specifications. We point out the limitations of the current WSMO model and propose a faithful extension that is based on Concurrent Transaction Logic (CTR). The advantage of a CTR-based model is that it uniformly captures a number of aspects that previously required separate mechanisms or were not captured at all. These include process specification, contracting for services, service enactment, and reasoning.

show abstract

Trust‐based workflow refactoring for concurrent scheduling in service‐oriented environment

Wang

Zhang

Zhu

et al. 2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYWorkflow scheduling has been extensively studied to improve the system performance. However, existing approaches are usually built on predefined workflow graph structure, neglecting the possibility that a workflow graph itself may be changeable when certain conditions are satisfied. Therefore, in this paper, we propose the concept of graph refactoring that transforms certain types of sequential tasks to run in parallel without changing system's functionality. We first provide a classification for task dependencies in workflows and identify that previously sequential task ordering in loose control dependency can be scheduled to run in parallel as long as supporting services are trustworthy. With this concept, we present a refactoring algorithm to traverse, restructure, and parallelize loose control dependencies in the graph when the reputations of related executing services are above certain threshold. In addition, refactoring effects on common sub‐graph structures are analyzed and discussed. In practice, our algorithm can be integrated into existing workflow management systems as a preprocessor to generate a new functionally equivalent working graph with more concurrent branches for further scheduling. Experiments and analysis show that graph refactoring can improve the system performance scalably because of concurrent execution of previously sequential tasks. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

A Logical Framework for Scheduling Workflows Under Resource Allocation Constraints

Cited by 48 publications

References 8 publications

Adaptive workflow scheduling under resource allocation constraints and network dynamics

Adaptive workflow scheduling under resource allocation constraints and network dynamics

WSMO Choreography: From Abstract State Machines to Concurrent Transaction Logic

Trust‐based workflow refactoring for concurrent scheduling in service‐oriented environment

Contact Info

Product

Resources

About