Results 261 to 270 of about 10,040 (298)
Some of the next articles are maybe not open access.
Global Dynamic Priority Scheduling
2015In this chapter, we briefly describe the research that had been conducted in the dynamic-priority scheduling of systems of three-parameter sporadic tasks. In contrast to the situation with respect to Liu and Layland task systems (Chap. 7) where there is a very large body of work to discuss, the research on dynamic priority (DP) scheduling of three ...
Sanjoy Baruah +2 more
openaire +1 more source
Algorithms on dynamic priority scheduling for heterogeneous traffic in ATM
1993 18th Conference on Local Computer Networks, 2002Double minimum laxity threshold (MLT), double queue length threshold (QLT), and hysteresis QLT algorithms are proposed as dynamic priority scheduling techniques for advanced processing of multiple class traffic. The performance of the proposed algorithm is analyzed by computer simulation.
Sang Gug Jong, Yong Ohk Chin
openaire +1 more source
A dynamic priority rule for scheduling against due‐dates
Journal of Operations Management, 1982AbstractWe simulate the performance of a simple production system in which due‐dates are set internally. We investigate priority rules aimed at minimizing tardiness, emphasizing a “modified duedate rule” which functions effectively in conjunction with internally‐set deadlines and which adapts to both tight and loose conditions in the due‐dates.
Baker, K.R., Bertrand, J.W.M.
openaire +2 more sources
A QoS constrained dynamic priority scheduling algorithm for process engine
Proceedings of 2010 IEEE International Conference on Service Operations and Logistics, and Informatics, 2010In this paper, a task scheduling algorithm in process engine is proposed to not only maximize overall customer satisfaction but also guarantee QoS requirement. This new algorithm dynamically assigns priority to a task based on the weighted utility value considering the predicted business value and left time to execute the process instance the task ...
Li Li +5 more
openaire +1 more source
A soft aperiodic task scheduling algorithm in dynamic-priority systems
Proceedings Second International Workshop on Real-Time Computing Systems and Applications, 2002In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed-critical task indicating (CTI) algorithm developed by the authors previously (1995).
Sungyoung Lee 0001 +2 more
openaire +1 more source
Overcoming Limitations of Off-the-Shelf Priority Schedulers in Dynamic Environments
2013 IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems, 2013It is common nowadays to architect and design scaled-out systems with off-the-shelf computing components operated and managed by off-the-shelf open-source tools. While web services represent the critical set of services offered at scale, big data analytics is emerging as a preferred service to be colocated with cloud web services at a lower priority ...
Feng Yan 0001 +3 more
openaire +1 more source
Dynamic Priority Scheduling Protocol Based on Cost in Cloud Computing
2016 Global Summit on Computer & Information Technology (GSCIT), 2016Cloud computing is a distributed computing model which enables developers to automatically deploy applications duringtask allocation and storage distribution. Cloud computing intends to share a pool of virtualized computer resources and equipment's ofcomputation, storage and information. Scheduling is the most important complex part in cloud computing.
Essaies Meriam, Nabil Tabbane
openaire +1 more source
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
Real-Time Systems, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
An FPGA Based Scheduling Coprocessor for Dynamic Priority Scheduling in Hard Real-Time Systems
2000In this paper we present a scheduling coprocessor device for uniprocessor computer systems running a real-time operating system (RTOS). The coprocessor shortens the scheduling time of the operating system by performing dynamic priority computation for all tasks in parallel and making a task selection according to these priorities at a higher speed than
Jens Hildebrandt, Dirk Timmermann
openaire +1 more source
A Novel Dynamic Priority Scheduling Algorithm of Process Engine in SOA
2009 IEEE International Conference on Web Services, 2009EAI and SOA are widely adopted in enterprise information systems with business processes being orchestrated by a process engine. An algorithm which schedules tasks of process instances to maximize overall customer satisfaction is proposed in this paper.
Qiming Tian, Li Li, Ling Jin, Xinxin Bai
openaire +1 more source