We consider the problem of non-preemptively scheduling periodic and sporadic task systems on one processor using inserted idle times. For periodic task systems, we prove that the decision problem of determining whether a periodic task system is schedulable for all start times with respect to the class of algorithms using inserted idle times is NP-Hard in the strong sense, even when the deadline...

During an off-peak hour of a day, a Mobile Terminal (MT) can stay in idle mode for long time as there is no incoming or outgoing packet. An idle MT can move from one location to another and the wireless access network keeps tracking the idle MT. Idle MTs need to assist the wireless access network for location update; so that, on call arrival the network can route the call successfully. Mean whi...

We consider a queueing loss system with heterogeneous skill based servers with arbitrary service distributions. We assume Poisson arrivals, with each arrival having a vector indicating which of the servers are eligible to serve it. An arrival can only be assigned to a server that is both idle and eligible. Assuming exchangeable eligibility vectors and an idle time ordering assignment policy, th...