In this paper we model a decision maker who must exert costly effort to complete single task by fixed deadline. Effort costs evolve stochastically in continuous time. The optimally waits until are less than given threshold, the solution an optimal stopping time problem. We derive for three cases: (1) exponential makers, (2) Naïve hyperbolic discounters and (3) sophisticated discounters. Absent ...

We study scheduling of multimedia traffic on the downlink of a wireless communication system. We examine a scenario where multimedia packets are associated with strict deadlines and are equivalent to lost packets if they arrive after their associated deadlines. Lost packets result in degradation of playout quality at the receiver, which is quantified in terms of the “distortion cost” associated...

We analyze checkpointing strategy for multiple realtime tasks with deadlines. Real-time tasks usually have deadlines associated with them. For multiple real-time tasks, checkpointing strategy considering deadlines of all tasks is very difficult to derive. We analyze the problem of checkpoint placement for such multiple tasks. In our strategy, the interval between checkpoints are determined for ...

In this paper we study the feasibility problem of scheduling a set of start time dependent tasks on a single machine with deadlines, processing rates and identical initial processing times. First, we show that the cases with arbitrary deadlines are strongly NP-complete. Second, we show that the cases with two distinct deadlines are NP-complete in the ordinary sense. Finally, we give an optimal ...

This paper extends analysis of the Adaptive Mixed Criticality (AMC) scheme for fixed-priority preemptive scheduling of mixed-criticality systems to include tasks with arbitrary deadlines. Both of the previously published schedulability tests, AMC-rtb and AMC-max are extended to cater for tasks with deadlines that may be greater than their periods. Evaluations show that the simpler method, AMC-r...

We introduce a portfolio management method that uses effort estimates to build sets of feasible deadlines for software projects at the bidding stage. Effort estimates can involve considerable error, and this must be taken into account when selecting deadlines. We show how a simple probability model can allow for possible errors. The model is built using a single effort estimate for each current...

A real-time system consists of both aperiodic and periodic tasks. Periodic tasks have regular arrival times and hard deadlines. Aperiodic tasks have irregular arrival times and either soft or hard deadlines. In this paper, we present a new algorithm, the Sporadic Server algorithm, that greatly improves response times for soft-deadline aperiodic tasks and can guarantee hard deadlines for both pe...