Results 251 to 260 of about 10,040 (298)
Some of the next articles are maybe not open access.
Scheduling aperiodic tasks in dynamic priority systems
Real-Time Systems, 1996In this paper we present five new on-line algorithms for servicing soft aperiodic requests in realtime systems, where a set of hard periodic tasks is scheduled using the Earliest Deadline First (EDF) algorithm. All the proposed solutions can achieve full processor utilization and enhance aperiodic responsiveness, still guaranteeing the execution of the
BUTTAZZO, Giorgio Carlo, M. Spuri
openaire +2 more sources
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).
Ismael Ripoll +2 more
openaire +1 more source
A dynamic priority scheduling algorithm on service request scheduling in cloud computing
Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology, 2011With the popularity of cloud computing, more and more business are operated in the cloud computing. In this paper, we address the problem of service request scheduling in cloud computing systems. We consider the three-tier cloud structure, which consists of resource providers, service providers and consumers.
Zhongyuan Lee, Ying Wang, Wen Zhou
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 0001 +2 more
openaire +2 more sources
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 ...
Kannikar Siriwong, Reda A. Ammar
openaire +1 more source
The partitioned dynamic-priority scheduling of sporadic task systems
Real-Time Systems, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sanjoy K. Baruah, Nathan Fisher
openaire +1 more source
A Scheduling Algorithm with Dynamic Priority Assignment for WCDMA Systems
IEEE Transactions on Mobile Computing, 2009In third generation WCDMA systems, shared channels allow many users to jointly utilize a single orthogonal variable spreading factor (OVSF) code. In this paper, we propose a scheduling algorithm with dynamic priority assignment (DPA) which is designed for the downlink-shared channel (DSCH) of 3G WCDMA systems and operates within a cross layer framework.
Dimitrios N. Skoutas, Angelos N. Rouskas
openaire +1 more source
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
Scheduling of hard-aperiodic requests in dynamic priority systems
Proceedings of 3rd International Workshop on Real-Time Computing Systems and Applications, 2002In this paper, we discuss the problem of jointly scheduling both hard deadline of periodic and aperiodic tasks in dynamic priority systems. The proposed scheduling scheme has extended the APS (Alternative Priority Scheduling) algorithm which is developed by the authors.
Hyungill Kim +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