Amortized efficiency of list update and paging rules
Communications of the ACM
On the competitiveness of on-line real-time task scheduling
Real-Time Systems
On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Scheduling with conflicts, and applications to traffic signal control
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Non-Preemptive Real-Time Scheduling of Multimedia Tasks
Real-Time Systems
Online scheduling with hard deadlines
Journal of Algorithms
Packet-mode policies for input-queued switches
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Patience is a virtue: the effect of slack on competitiveness for admission control
Journal of Scheduling - Special issue: On-line algorithm part I
| Hi-index | 0.00 |
We study a variant of online scheduling problems, the online realtime scheduling. It can be defined on a complete graph, where each node represents a communication agent, and a communication between two agents can be considered as an edge. An input is a sequence of communication jobs, each of which requires two specified agents to communicate during specified time period. Each agent can participate in at most one communication job. The task of an online algorithm is to schedule jobs so that the sum of the profits of completed communication jobs is maximized. In this paper, we improve the competitive ratio of the General Shelf based Max Matching (GSMM) algorithm from 6 + 4√2(≅ 11.66) to 2√6 + 6(≅ 10.90). We also prove that this ratio is optimal for GSMM. In addition, we study the case where each job has no slack time, namely, it must be either started immediately or rejected at its release time, and show the competitive ratio of GSMM is 2√6 + 5(≅ 9.90).