Skip to search formSkip to main contentSkip to account menu

Dynamic priority scheduling

Dynamic priority scheduling is a type of scheduling algorithm in which the priorities are calculated during the execution of the system. The goal of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
: The main purpose of this paper is to develop a hybrid CPU scheduling algorithm that combines round robin scheduling with… 
2012
2012
Cloud Robotics is currently driving interest in both academia and industry. It allows different types of robots to share… 
2011
2011
Wireless Multimedia Sensor Networks (WMSNs) are characterized by limited hardware resource, bandwidth and variable channel… 
2007
2007
Abstract A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an… 
2007
2007
The increasing demand of multimedia applications in wireless local area networks (WLAN) has led to the attempt to provide quality… 
2004
2004
One of the most important issues in the design of distributed real-time database system (DRTDBS) is transaction scheduling which… 
2001
2001
2. The server is busy serving a class 2 packet during slot k. This can only be the case if at the beginning of the last “start… 
2001
2001
Controlled-load service that provides acceptable quality of service to adaptive real-time applications without making absolute… 
2001
2001
Recent results on the proportional di erentiation model show that waiting time priority scheduling can be applied to implement… 
1998
1998
Scheduling a parallel program is a crucial step in effectively harnessing the computing power of a heterogeneous computing system…