Results 131 to 140 of about 157,797 (184)
Some of the next articles are maybe not open access.
QoS using delay-synchronized dynamic priority scheduling
Proceedings. Sixth IEEE Symposium on Computers and Communications, 2002Controlled-load service that provides acceptable quality of service to adaptive real-time applications without making absolute guarantee is extensively considered, owing to its higher resource utilization than guaranteed service. Enhancement of utilization strongly relies on traffic scheduling method adaptable to a varying traffic load, and admission ...
K. Siriwong, R. Ammar
openaire +1 more source
Optimal aperiodic scheduling for dynamic-priority systems
Proceedings of 3rd International Workshop on Real-Time Computing Systems and Applications, 2002This paper addresses the problem of jointly scheduling tasks with both hard and soft real-time constraints. We present a new on-line aperiodic admission algorithm to be used with on optimal dynamic priority preemptive scheduler, such as the Earliest Deadline First (EDF) or the Least Laxity First (LLF).
I. Ripoll, A. Garcia-Fornes, A. Crespo
openaire +1 more source
Improving fixed priority schedulability with dynamic priority as secondary criterion
Journal of Embedded Computing, 2006In this paper, we focus on a non-preemptive scheduling, combining fixed priorities and dynamic priorities on a uniprocessor. This scheduling is called FP/DP. Results presented in this paper can be applied indifferently to tasks and flows. With any flow are associated a fixed priority denoting the importance degree of the flow and a temporal parameter,
Steven Martin +2 more
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
Dynamic priorities, priority scheduling and priority inheritance
ACM SIGAda Ada Letters, 1990Scheduling requirements are a major portion of the set of requirements that must be addressed by the Ada 9X Project. This is evident by the numerous Revision Requests (RRs) submitted (over 25) to the Ada 9X Project Office and the subsequent Revision Issues (RI-7005 and RI-7007). The related 9X requirements are:
openaire +1 more source
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
Dynamic priority scheduling for heterogeneous cognitive radio networks
2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2012In cognitive radio networks (CRNs), secondary networks (SNs) are regulated in order to prevent them from accessing a channel if primary networks (PNs) are currently occupying the channel. However, there not exists any regulation how to coordinate the channel access among multiple heterogeneous SNs.
Boram Choi +3 more
openaire +1 more source
Dynamic multilevel priority packet scheduling design for WSN
2014 International Conference on Signal Propagation and Computer Technology (ICSPCT 2014), 2014In wireless sensor network (WSN) we need to schedule different types of packets, Such as real time and non real time packets with some restrictions on resources. There are lots of existing packet scheduling mechanism of wireless sensor network uses first come first serve (FCFS), preemptive priority and non-preemptive priority scheduling algorithm.
Varsha Jain +2 more
openaire +1 more source
Heterogeneous Dynamic Priority Scheduling in Time Critical Applications
International Journal of Wireless Networks and Broadband Technologies, 2012In the unlicensed band, the notion of primary user and secondary user (To implement cognitive radio) is not explicit. By dynamic priority assignment the authors propose to implement cognitive radio in the unlicensed band. In time critical events, the data which is most important, has to be given the time slots.
Arvind Viswanathan +2 more
openaire +1 more source
Dynamic Priority Scheduling Mechanism through Adaptive InterFrame Space
2007 International Conference on Wireless Communications, Networking and Mobile Computing, 2007The increasing demand of multimedia applications in wireless local area networks (WLAN) has led to the attempt to provide quality of service for differentiated traffics in WLAN. In this paper, a novel mechanism, Adaptive IFS through Transmission Delay (AITD) is introduced; to dynamically adjust the inter-frame space (IFS) based on differentiation ...
Reza Ghazizadeh, Pingzhi Fan
openaire +1 more source