A logical framework for scheduling workflows under resource allocation constraints

2002-08-22
This chapter presents a framework for workflows whose correctness is given by a set of resource allocation constraints and develops techniques for scheduling such systems. A workflow consists of a collection of coordinated tasks designed to carry out a well-defined complex process, such as catalog ordering, trip planning, or a business process in an enterprise. Scheduling of workflows is a problem of finding a correct execution sequence for the workflow tasks, that is, execution that obeys the constraints that embody the business logic of the workflow. Research on workflow scheduling has largely concentrated on temporal constraints, which specify correct ordering of tasks. Another important class of constraints—those that arise from resource allocation—has received relatively little attention in workflow modeling. Because resources are typically not limitless and cannot be shared, scheduling of a workflow execution involves decisions as to which resources to use and when.

Suggestions

An architecture for workflow scheduling under resource allocation constraints
Karagöz, Pınar; Toroslu, İsmail Hakkı (Elsevier BV, 2005-07-01)
Research on specification and scheduling of workflows has concentrated on temporal and causality constraints, which specify existence and order dependencies among tasks. However, another set of constraints that specify resource allocation is also equally important. The resources in a workflow environment are agents such as person, machine, software, etc. that execute the task. Execution of a task has a cost and this may vary depending on the resources allocated in order to execute that task. Resource alloca...
A genetic algorithm for the resource constrained project scheduling problem
Özleyen, Erdem; Sönmez, Rifat; Department of Civil Engineering (2011)
The resource-constrained project scheduling problem (RCPSP) aims to find a schedule of minimum makespan by starting each activity such that resource constraints and precedence constraints are respected. However, as the problem is NP-hard (Non-Deterministic Polynomial-Time Hard) in the strong sense, the performance of exact procedures is limited and can only solve small-sized project networks. In this study a genetic algorithm is proposed for the RCPSP. The proposed genetic algorithm (GA) aims to find near-o...
A C++ implementation and evoluation of alternative plan generation methods for multiple query optimization
Abudula, Dilixiati; Coşar, Ahmet; Department of Computer Engineering (2006)
In this thesis, alternative plan generation methods for multiple query optimization(MQO) are introduced and an implementation in the C++ programming.language has been developed. Multiple query optimization, aims to minimize the total cost of executing a set of relational database queries. In traditional single query optimization only the cost of execution of a single relational database query is minimized. In single query optimization a search is performed to investigate possible alternative methods of acce...
A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations
Sozat, MI; Yazıcı, Adnan (Elsevier BV, 2001-01-15)
This paper first introduces the formal definitions of fuzzy functional and multivalued dependencies which are given on the basis of the conformance values presented here. Second, the inference rules are listed after both fuzzy functional and multivalued dependencies are shown to be consistent, that is, they reduce to those of the classic functional and multivalued dependencies when crisp attributes are involved. Finally, the inference rules presented here are shown to be sound and complete for the family of...
A Display Processing Software Application Framework for Mission Computer Systems
Kilinc, Ismail; Gezici, Görkem; Er, Emre; Baykal, Buyurman (2009-09-16)
This paper describes a framework for display processing applications in C4ISR systems and discusses Havelsan's approach. Mission Computers in C4ISR systems need a framework for both mission processing and display processing applications to enhance productivity and robustness. Each framework has its own requirements and challenges. Our goal is to provide a general display processing framework for all kinds of mission computer applications.
Citation Formats
P. Karagöz and İ. H. Toroslu, “A logical framework for scheduling workflows under resource allocation constraints,” presented at the VLDB ’02: Proceedings of the 28th International Conference on Very Large Databases, 20–23 August 2002, Hong Kong, China, 2002, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/86884.