Results 1 - 10 of 13,424

Table 2: Scheduling policies modelled

in Real-time schedulability tests for preemptive multitasking
by C. J. Fidge 1998
"... In PAGE 22: ..., 1989) because (ide- ally!) any soft real-time tasks absorb idle time only and thus do not feature in these schedulability tests. (In fact both algorithms may introduce some degree of interference, and the priority exchange algorithm even makes the task set unstable!) Table2 shows the scheduling policies assumed by the tests. Tests that allow any static priority allocation have been marked as supporting rate and deadline monotonic scheduling too because such a capability can be used to construct a... ..."
Cited by 11

Table 1: Summary of scheduling policies.

in Integrated Resource Management for Cluster-based Internet Services
by Kai Shen , Hong Tang, Tao Yang, Lingkun Chu 2002
Cited by 70

Table 3. Summary of Scheduling Policies.

in Scheduling Real-Time Transactions with Disk Resident Data
by unknown authors

Table 2. Summary of scheduling policies.

in Scheduling Real-time Transactions: a Performance Evaluation
by unknown authors

Table 3. Memory Access Scheduling Policies. Policy

in Memory Controller Optimizations for Web Servers
by Scott Rixner
"... In PAGE 4: ... This strongly suggests that these techniques can be effective. Table3 describes the scheduling algorithms considered in this paper. The sequential, bank sequential, and first ready schedulers are self-explanatory.... In PAGE 5: ... Scheduling accesses, however, now has the additional component of allocating channels. Most of the scheduling algorithms presented in Table3 still apply to virtual channel SDRAM. However, the row policy would consider segment operations along with row operations first.... ..."

Table 1 : Performance of cluster scheduling policies

in Exploiting Idle Cycles in Networks of Workstations
by Kyung Dong Ryu 2001
"... In PAGE 10: ...vii LIST OF TABLES Table1 : Performance of cluster scheduling policies .... ..."
Cited by 3

Table 8. Usage of units by the two scheduling policies

in Resource Management for Dynamically-Challenged Reconfigurable Systems
by Muhammad Z. Hasan
"... In PAGE 6: ... We have chosen various sizes of task graphs with MND=5. The usage of these three units under two scheduling policies is shown in Table8 . As we can conclude from this table, the total usage under the BE-policy is less than that under the reference policy.... ..."

Table 3. Performance of Scheduling Policies With Shared Resources

in Scheduling distributable real-time threads in Tempus middleware
by Peng Li, Binoy Ravindran, Hyeonjoong Cho 2004
"... In PAGE 6: ...epicted in Figure 6(b), i.e., DTs share resources. The only scheduling policies that can handle TUFs and resource dependencies are DASA and GUS, which are compared in Table3 . Still, GUS per- forms better than DASA in terms of accrued util- ity ratio.... ..."
Cited by 5

Table 1. Worst efficiency bounds for scheduling policies.

in Evaluation of an Adaptive Scheduling Strategy for Master-Worker Applications on Clusters of Workstations
by Elisa Heymann, Miquel A. Senar, Emilio Luque, Miron Livny 2000
"... In PAGE 8: ... The behavior of the policies was very similar for all the number of workers, but it was strongly affected by the variation of the execution times of the tasks in different iterations, by the workload and by having significant differences among the execution times of the 20% largest tasks. Table1 shows the efficiency bounds obtained for the previously described scheduling policies, always relative to LPTF policy. The first column contains the upper bound that is never surpassed in 95% of cases.... ..."
Cited by 5

Table 1. Worst efficiency bounds for scheduling policies.

in Evaluation of an Adaptive Scheduling Strategy for Master-Worker Applications on Clusters of Workstations
by Elisa Heymann, Miquel A. Senar, Emilio Luque, Miron Livny
"... In PAGE 8: ... The behavior of the policies was very similar for all the number of workers, but it was strongly affected by the variation of the execution times of the tasks in different iterations, by the workload and by having significant differences among the execution times of the 20% largest tasks. Table1 shows the efficiency bounds obtained for the previously described scheduling policies, always relative to LPTF policy. The first column contains the upper bound that is never surpassed in 95% of cases.... ..."
Results 1 - 10 of 13,424