This paper exemplifies the similarities in Time Warp and computer architecture concepts and terminology, and the continued trend for convergence of ideas in these two areas. Time Warp can provide a means to describe the complex mechanisms being used to allow the instruction execution window to be enlarged. Furthermore it can extend the current mechanisms, which do not scale, in a scaleable mann...

In this paper, we investigate time-aware agents programming. A time-aware agent is able to manage several tasks working on disparate data. It reasons about its tasks durations and it is also able to cooperate with other agents to share CPU resources in order to meet its deadlines. Time-awareness should not be at the expense of agent autonomy, to which we must pay attention at programming and ex...

We consider the task of designing a truthful auction mechanism for CPU time scheduling problem. There are m commodities (time slots) T = {t1, t2, . . . , tm} for n buyers I = {1, 2, . . . , n}. Each buyer requires a number of time slots si for its task. The valuation function of buyer i for a bundle of time slots Ti is vi(Ti) = wi(m− t), where t is the last time slot in Ti and |Ti| = si. The ut...

We propose a design methodology for producing CPU schedulers with provable real-time behaviors. Our approach is grounded in the well-known technique of using virtual time to track a fluid model representation of the system. However, our work aims to go beyond traditional fair sharing schedulers like Weighted Fair Queueing by laying bare the mathematical foundations of virtual time. We show how ...

Round Robin CPU scheduling algorithm use fixed time quantum in timeshared system. In timeshared system performance is totally depends upon the selection of time quantum. Static time quantum and selection of time quantum both reason in RR CPU scheduling algorithm is disadvantage for the CPU performance. In this paper study the different dynamic RR CPU scheduling algorithm and discuss the selecti...