Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

119

ORL
1998

97views more ORL 1998»

Preemptive on-line scheduling for two uniform processors

15 years 2 months ago

Preemptive on-line scheduling for two uniform processors

Download v8nu74s71s31g374r7ssn017uloss3c1vr3s.unbf.ca

This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the

Jianjun Wen, Donglei Du

Real-time Traffic

ORL 1998 | Paper | Preemptive On-line Scheduling | Uniform Processors |

claim paper

Related Content

» Optimal OnLine Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

» Fixedpriority preemptive multiprocessor scheduling to partition or not to partition

» Preemptive scheduling on a small number of hierarchical machines

» SemiPartitioned Hard RealTime Scheduling with Restricted Migrations upon Identical Multipr...

» The Partitioned Scheduling of Sporadic RealTime Tasks on Multiprocessor Platforms

» Improvements in PolynomialTime Feasibility Testing for EDF

» Competitive queueing policies for QoS switches

» On the Scheduling of MixedCriticality RealTime Task Sets

» Nonuniform Instruction Scheduling

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	ORL
Authors	Jianjun Wen, Donglei Du

Comments (0)