A real-time applicative software consists of both aperiodic and periodic tasks. The tasks have regular arrival times strict deadlines. irregular no deadline. objective an optimal task server is to guarantee minimal response for the violation hard deadlines We consider a energy harvesting system composed harvester, storage unit, uniprocessing unit introduce novel scheduler, namely SSP which exte...

In dynamic real-time task systems, tasks that are subject to deadlines are al-lowed to join and leave the system. In previous work, Stoica et al. and Baruah et al.presented conditions under which such joins and leaves may occur in fair-scheduleduniprocessor systems without causing missed deadlines. In this paper, we extendtheir work by considering fair-scheduled multiprocess...

Delaying the synchronisation of actions may reveal some hidden behaviour that would not happen if the synchronisation would meet the specified deadlines. This precise phenomenon makes bisimulation fail to be a congruence for the parallel composition of timed automata with deadlines, a variant of timed automata where time progress is controlled by deadlines imposed on each transition. This probl...

We extend a recently-proposed framework for the rate-distortion optimized transmission of packetized media. The original framework assumed that each packet has a single arrival deadline and that a packet is useless if it arrives after its deadline. In practice, however, packets may be associated with multiple deadlines. Examples include the case of compressed video that uses bi-directional pred...

In recent result, the fault-tolerant scheduling algorithm almost requires that all task’s periods are the same and equal to their deadlines, but in fact the periods are not the same in many cases. According to the characteristics of distributed control systems and the technique of primary/backup copies, based on EDF algorithm the novel fault-tolerant scheduling algorithm is proposed in this pap...

Real-time systems Practitioners categorize real-time systems as hard, firm, and soft.1 Hard real-time systems include those in which a single missed deadline might cause catastrophic repercussions. Firm real-time systems tolerate one or more missed deadlines without catastrophic repercussions. In soft real-time systems, missed deadlines only result in performance degradation. Bart Van Beneden s...

Three hypothesis, hereafter labelled threshold-bound hypothesis, drift-rate-change hypothesis and two-stage-processing hypothesis are proposed to account for data from a perceptual discrimination task in which three different response deadlines were involved and three different payoffs were presented prior to each individual trial. The present research is to show how the three different hypothe...

This paper introduces a new uploading system that automatically uploads multimedia files to a centralized server given client hard deadlines. Unlike systems supporting downloading applications such as video streaming and file sharing, systems that support uploading applications have received relatively little attention in the past decade. While not popularly studied, uploading systems with hard...

In this paper we study energy efficient deadline scheduling on multiprocessors in which the processors consumes power at a rate of s when running at speed s, where α ≥ 2. The problem is to dispatch jobs to processors and determine the speed and jobs to run for each processor so as to complete all jobs by their deadlines using the minimum energy. The problem has been well studied for the single ...

Consider scheduling of unit jobs with release times and deadlines on m identical machines with the objective to maximize the number of jobs completed before their deadlines. We prove a new lower bound for online algorithms with immediate decision. This means that the jobs arrive over time and the algorithm has to decide the schedule of each job immediately upon its release. Our lower bound tend...