Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
An architecture for workflow scheduling under resource allocation constraints
Date
2005-07-01
Author
Karagöz, Pınar
Toroslu, İsmail Hakkı
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
177
views
0
downloads
Cite This
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 allocation constraints define restrictions on how to allocate resources, and scheduling under resource allocation constraints provide proper resource allocation to tasks. In this work, we provide an architecture to specify and to schedule workflows under resource allocation constraints as well as under the temporal and causality constraints. A specification language with the ability to express resources and resource allocation constraints and a scheduler module that contains a constraint solver in order to find correct resource assignments are core and novel parts of this architecture.
Subject Keywords
Hardware and Architecture
,
Software
,
Information Systems
URI
https://hdl.handle.net/11511/36707
Journal
INFORMATION SYSTEMS
DOI
https://doi.org/10.1016/j.is.2004.03.003
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Performing and analyzing non-formal inspections of entity relationship diagram (ERD)
ÇAĞILTAY, NERGİZ; TOKDEMİR, GÜL; Kilic, Ozkan; Topalli, Damla (Elsevier BV, 2013-08-01)
Designing and understanding of diagrammatic representations is a critical issue for the success of software projects because diagrams in this field provide a collection of related information with various perceptual signs and they help software engineers to understand operational systems at different levels of information system development process. Entity relationship diagram (ERD) is one of the main diagrammatic representations of a conceptual data model that reflects users' data requirements in a databas...
A logical framework for scheduling workflows under resource allocation constraints
Karagöz, Pınar; Toroslu, İsmail Hakkı (null; 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 t...
A method for concurrency control in distributed DBMSs: Permission Test Method
Halıcı, Uğur (Association for Computing Machinery (ACM), 1987-01-09)
In this paper, a method for concurrency control in distributed DBMSs, called Permission Test Method is proposed. The PT method satisfies the basic requirements for concurrency control, that is, it executes the transactions in a serializable order, deadlocks do not appear and indefinite postponment is prevented by the method. In PT method, transactions, which are permitted to run, are not aborted unless a related site failure occurs. Furthermore, the complexity analysis indicates that the algorithm will work...
A framework for reviewing domain specific conceptual models
TANRIÖVER, ÖMER ÖZGÜR; Bilgen, Semih (Elsevier BV, 2011-09-01)
Conceptual models are used in understanding and communicating the domain of interest during analysis phase of system development. As they are used in early phases, errors and omissions may propagate to later phases and may be very costly to correct. This paper proposes a framework for evaluating conceptual models when represented in a domain specific language based on UML constructs. The framework describes the main aspects to be considered when conceptual models are represented in a domain specific languag...
A study on enterprise resource planning systems and embedding them into the company processes
Gencel, Orhan; Şen, Tayyar; Department of Information Systems (2003)
In this thesis, implementations of Enterprise Resource Planning Systems are studied with a broader view. Pre-implementation preparations and post-implementation developments play key roles in the success of the ERP utilization of the companies. To find out how the success can be achieved, various concepts in ERP implementation are analyzed. Using analogies with the basic software development models, common application methodologies are studied. The study is completed with the analysis of an interesting and ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
P. Karagöz and İ. H. Toroslu, “An architecture for workflow scheduling under resource allocation constraints,”
INFORMATION SYSTEMS
, pp. 399–422, 2005, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36707.