On the Competitiveness of On-Line Scheduling of Unit-Length Packets with Hard Deadlines in Slotted Time
نویسنده
چکیده
It is shown that the competitive factor for online scheduling of unit-length packets with hard deadlines in slotted time is in the interval [0.5, φ], where φ is the inverse of the golden ratio, φ = ( √ 5 − 1)/2 ≈ 0.618034. Moreover, any static priority policy, that in each slot schedules a maximum value packet irrespective of deadlines, achieves competitive factor 0.5.
منابع مشابه
Lex-Optimal Online Multiclass Scheduling with Hard Deadlines
On-line scheduling of unit-length packets with hard deadlines by a single server in slotted time is considered. First, the throughput optimal scheduling policies are characterized. Then multiclass packets are considered in which each packet has an M -bit class identifier, and a new optimality property called lex-optimality (short for lexicographic optimality) is defined for on-line scheduling p...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملOnline Packet Scheduling with Hard Deadlines in Wired Networks
The problem of online job or packet scheduling with hard deadlines has been studied extensively in the single hop setting, whereas it is notoriously difficult in the multihop setting. This difficulty stems from the fact that packet scheduling decisions at each hop influences and are influenced by decisions on other hops and only a few provably efficient online scheduling algorithms exist in the...
متن کاملA Constant Approximation Algorithm for Scheduling Packets on Line Networks
In this paper we improve the approximation ratio for the problem of maximizing the throughput of line networks with bounded buffers. Each node in the network has a local buffer of bounded size B, and each edge (or link) can transmit a limited number c of packets in every time unit. The input to the problem consists of a set of packet requests, each defined by a source node, a destination node, ...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کامل