Amortized efficiency of list update and paging rules
Communications of the ACM
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the competitiveness of on-line real-time task scheduling
Real-Time Systems
MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling
Theoretical Computer Science - Special issue on dependable parallel computing
U-Net: a user-level network interface for parallel and distributed computing
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Designing and Implementing High-Performance Media-on-Demand Servers
IEEE Parallel & Distributed Technology: Systems & Technology
Real-Time Parallel MPEG-2 Decoding in Software
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
Packet-mode policies for input-queued switches
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Improved upper bounds on the competitive ratio for online realtime scheduling
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Dynamic alteration schemes of real-time schedules for I/O device energy efficiency
ACM Transactions on Embedded Computing Systems (TECS)
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |
Motivatedby the special characteristicsof multimedia tasks, we consider non-preemptive scheduling oftasks where there exists no (or very limited) information concerningthe tasks before they are released. We present impossibilityresults and analyze algorithms for non-preemptive schedulingin single processor and multiprocessor systems. To evaluate ouralgorithm we assume that system obtains a value that is proportionalto the processing time of the task whenever a task is completedby its deadline. Competitive analysis is used, where the goalis to keep the total value obtained by an on-line algorithm boundedby a function of the total value obtained by an off-line algorithm.In particular, one set of our results considers the competitiveratio of scheduling algorithm when the length of the tasks isnot greater than C_{\maxx} (and not smaller thanC_{\minn}). We show that the performance of a schedulingalgorithm is improved dramatically when the release time of thetasks is O(C_{\maxx}) prior to their deadline; achievinga competitive ratio that is close to one.