Learn More
In applications ranging from video reception to telecommunications and packet communication to aircraft control, tasks enter periodically and have xed response time constraints, but missing a deadline is acceptable, provided most deadlines are met. We call such tasks \occasionally skippable". We look at the problem of uniprocessor scheduling of occasionally(More)
With respect to on-line scheduling algorithms that must direct the service of sporadic task requests we quantify the benefit of clairvoyancy, i.e., the power of possessing knowledge of various task parameters of future events. Specifically, we consider the problem of preemptively sheduling sporadic task requests in both uni- and multi-processor(More)
Koren, G. and D. Shasha, MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling, Theoretical Computer Science 128 (1994) 75-97. We study competitive on-line scheduling in multiprocessor real-time environments. In our model, every task has a deadline and a value that it obtains only if it completes by its deadline. A task can be(More)
In this paper we show how a real-time time-sharing RtTS architecture can be very useful in resolving many of the formidable problems generally posed by complex real-time systems. In particular, we address dynamic multi-job systems, running on shared-memory multi-processor platforms. Each job is multi-tasked, with task characteristics assumed to be complex,(More)
In this paper we cessor real-time study the performance of off-line multiproschedules that allows task mieration compared to those that forbid migration. We conzider an offline scheduling problem in which a given collection of tasks each with release time, computation time and deadline are to be run on a multi-processor system. A preemptive schedule allows(More)