Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,724,724 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Earliest deadline first scheduling
Least slack time scheduling
Priority ceiling protocol
Rate-monotonic scheduling
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Towards real-time multi-sensor information retrieval in Cloud Robotic System
Lujia Wang
,
Ming Liu
,
M. Meng
,
R. Siegwart
International Conference on Multisensor Fusion…
2012
Corpus ID: 7992771
Cloud Robotics is currently driving interest in both academia and industry. It allows different types of robots to share…
Expand
2011
2011
Cooperation-Based Scheduling Algorithm in Wireless Multimedia Sensor Networks
Bo Zeng
,
Yabo Dong
,
Dongming Lu
International Conference on Wireless…
2011
Corpus ID: 17755309
Wireless Multimedia Sensor Networks (WMSNs) are characterized by limited hardware resource, bandwidth and variable channel…
Expand
2010
2010
Fairness-Aware Resource Allocation for the SISO Downlink over Frequency-Selective Channels
Vasileios D. Papoutsis
,
I. Fraimis
,
S. Kotsopoulos
IEEE Wireless Communication and Networking…
2010
Corpus ID: 11835191
The problem of resource allocation for the downlink of wireless systems operating over a frequency-selective channel is…
Expand
2008
2008
Adaptive Tasks Balancing in Wireless Sensor Networks
Fadi Tirkawi
,
Stefan Fischer
3rd International Conference on Information and…
2008
Corpus ID: 17225954
In this paper, we extend our CPU-scheduling algorithm which is based on topology information of the network. In wireless sensor…
Expand
2007
2007
The partitioned dynamic-priority scheduling of sporadic task systems
Sanjoy Baruah
,
N. Fisher
Real-time systems
2007
Corpus ID: 7995237
Abstract A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an…
Expand
2004
2004
Priority Scheduling of Transactions in Distributed Real-Time Databases
V. Lee
,
K. Lam
,
B. Kao
Real-time systems
2004
Corpus ID: 8292420
One of the most important issues in the design of distributed real-time database system (DRTDBS) is transaction scheduling which…
Expand
Highly Cited
2002
Highly Cited
2002
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks
V. Kanodia
,
Chengzhi Li
,
A. Sabharwal
,
B. Sadeghi
,
E. Knightly
Wirel. Networks
2002
Corpus ID: 701496
Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet…
Expand
2001
2001
QoS using delay-synchronized dynamic priority scheduling
Kannikar Siriwong
,
R. Ammar
Proceedings. Sixth IEEE Symposium on Computers…
2001
Corpus ID: 46460546
Controlled-load service that provides acceptable quality of service to adaptive real-time applications without making absolute…
Expand
2001
2001
Dynamic Priority Scheduling for Proportional Delay Differentiated Services
Lassaad Essafi
,
G. Bolch
,
H. D. Meer
Messung, Modellierung und Bewertung von Rechen…
2001
Corpus ID: 33054557
Recent results on the proportional di erentiation model show that waiting time priority scheduling can be applied to implement…
Expand
1998
1998
DPS: dynamic priority scheduling heuristic for heterogeneous computing systems
I. Ahmad
,
M. Dhodhi
,
R. Ul-Mustafa
1998
Corpus ID: 61411475
Scheduling a parallel program is a crucial step in effectively harnessing the computing power of a heterogeneous computing system…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE