MOCA

swMATH2629MaRDI QIDQ15168FDOQ15168

Author name not available (Why is that?)

Described by source

• MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling

Cited In (17)

• Extra processors versus future information in optimal deadline scheduling
• Performance guarantee for edf under overload
• Online interval scheduling: Randomized and multiprocessor cases
• Title not available (Why is that?)
• Optimally Handling Commitment Issues in Online Throughput Maximization
• A general framework for handling commitment in online throughput maximization
• Competitive analysis of online real-time scheduling algorithms under hard energy constraint
• Performance guarantee for online deadline scheduling in the presence of overload
• IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
• An improved randomized on-line algorithm for a weighted interval selection problem
• Competitive deadline scheduling via additional or faster processors
• Energy Efficient Deadline Scheduling in Two Processor Systems
• The Power of Migration in Multiprocessor Scheduling of Real-Time Systems
• Title not available (Why is that?)
• Optimal time-critical scheduling via resource augmentation
• Bounding the Power of Preemption in Randomized Scheduling
• Scheduling parallel tasks with individual deadlines

This page was built for software: MOCA