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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Cloud computing is a distributed computing model which enables developers to automatically deploy applications duringtask… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2012
2012
Virtual Desktop Infrastructures (VDIs) are gaining popularity in cloud computing by allowing companies to deploy their office… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
The software architecture of a critical embedded control system generally consists of a set of multi-periodic communicating tasks… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper presents a new algorithm for fixed-priority scheduling of sporadic task systems on multiprocessors.The algorithm is… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Providing quality of service in random access multi-hop wir eless networks requires support from both medium access and packet… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Recent results on the proportional di erentiation model show that waiting time priority scheduling can be applied to implement… (More)
  • table 1
  • table 2
  • table 3
  • figure 2
  • table 4
Is this relevant?
2001
2001
Controlled-Load Service that provides acceptable quali0 of service to adaptive real-time applications without making absolute… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1993
Highly Cited
1993
| Scheduling theory holds great promise as a means to a priori validate timing correctness of real-time applications. However… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1990
1990
Scheduling requirements are a major portion of the set of requirements that must be addressed by the Ada 9X Project. This is… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this paper, we address the problem of priority scheduling in a database management system. We start by investigating the… (More)
  • figure 1
  • figure 2.1
  • figure 2.2
  • table 3.1
  • table 3.2
Is this relevant?