A Novel Dynamic Priority Scheduling Algorithm of Process Engine in SOA

Li, Li; Jin, Ling; Bai, Xinxin

doi:10.1109/icws.2009.17

Cited by 4 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This stream of research is closest to the spirit of our work and we will discuss the proposed approaches in detail and relate them to the work presented in this paper. Tian et al propose an algorithm to dynamically assign a priority level ("low" or "high") to each task (service invocation of a process) based on the business value and time left of the corresponding process instances [15], [16]. The value of a process instance is modeled as a utility function of response time reflecting the inverse relation between the customer satisfaction and response time.…”

Section: Summary and Discussionmentioning

confidence: 99%

Autonomic Prioritization of Enterprise Transactions Based on Bid-Price Controls

Setzer

Markl

2013

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

We study the business-driven prioritization of workflows in enterprise transaction processing systems. Today, IT services are increasingly shared amongst workflows, and static prioritization is applied during phases of high system workload to mitigate the business impact of service queuing and resulting workflow response-time increase. Static prioritization rules can only be optimal for one particular workflow definition and demand mix scenario, while in practice workflow definitions are continuously re-engineered and demand varies over time. We propose a technique to automatically adapt workflow priorities aimed at minimizing overload-related costs resulting from workflow delays. We continuously align maximum service buffer lengths and bid-prices reflecting current marginal opportunity costs of invoking a shared service. New prioritization is derived by comparing expected costs when queuing a workflow with its current opportunity costs, computed as the sum of bid-prices of invoked services. Simulation outcomes based on industry data illustrate that the approach dominates standard queuing disciplines as well as static prioritization.

show abstract

Section: Summary and Discussionmentioning

confidence: 99%

Autonomic Prioritization of Enterprise Transactions Based on Bid-Price Controls

Setzer

Markl

2013

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…A priority scheduling method for process engines is proposed in [7]. It analyzes the execution status in the process engine and dynamically assigns the priorities to service requests alike to our approach.…”

Section: Related Workmentioning

confidence: 99%

Adaptive Request Prioritization in Dynamic Service-Oriented Systems

Khazankin

Schall

Dustdar

2011

2011 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

The availability of scarce resources in a serviceoriented system demands for context-aware selection policies that adapt based on service-level agreements (SLAs). One of the open issues is to prioritize service requests in dynamically changing environments where concurrent instances of processes may compete for resources. Here we propose a runtime monitoring approach to observe the actual state of the system. We argue that priorities should be assigned to requests based on potential violations of SLA objectives. While most existing work in the area of quality of service monitoring and SLA modeling focuses typically on purely technical systems, we consider service-oriented systems spanning both softwarebased services and human actors. Adaptive request scheduling in such systems is challenging due to the poorly predictable behavior of human actors in performing tasks. Our approach helps to cope with these challenges by prioritizing service requests that may cause violations of SLAs and corresponding objectives that are associated with processes.

show abstract

“…Jobs with higher priority will be processed in short time. The control point in the proposed method is not the timing of a job being processed, but the priority of the job (Qiming et al, 2009).…”

Section: Problem Statementmentioning

confidence: 99%

Case Study of the Optimizing the Automotive Manufacturing Systems Efficiency via Applying New Method of Scheduling

Nojabaei

Franchetti

2014

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

Efficiency is becoming a pivotal aspect in each manufacturing system and scheduling plays a crucial role in sustaining it. The applicability of distributed computing to coordinate and execute jobs has been investigated in the past literature. Moreover, it is significant that even for sensitive industrial systems the only criterion of allocating jobs to appropriate machines is the FIFO policy. On the other flip, many researchers are of the opinion that the main reason behind failing to provide fairness in distributed systems is considering the only criterion of time stamp to judge upon and form the queue of jobs with the aim of allocating those jobs to the machines. In order to increase the efficiency of sensitive industrial system, this study takes into consideration of three criteria of each job including priority, time action and time stamp. The methodology adopted by this study is definition of job scheduler and positioning jobs in temporary queue and sorting via developing bubble sort. In sorting algorithm criterion of priority, time action should be considered besides time stamp to recognize the tense jobs for processing earlier. To evaluate this algorithm first a numerical test case (simulation) is programmed and then the case study performing in order to optimize efficiency of applying this method in real manufacturing system. Eventually the results of this study provided evidence on that the rate of efficiency is increased.

show abstract

A Novel Dynamic Priority Scheduling Algorithm of Process Engine in SOA

Cited by 4 publications

References 6 publications

Autonomic Prioritization of Enterprise Transactions Based on Bid-Price Controls

Autonomic Prioritization of Enterprise Transactions Based on Bid-Price Controls

Adaptive Request Prioritization in Dynamic Service-Oriented Systems

Case Study of the Optimizing the Automotive Manufacturing Systems Efficiency via Applying New Method of Scheduling

Contact Info

Product

Resources

About