The rapid progress in high-performance microprocessor design has made it diicult to adapt real-time scheduling results to new models of microprocessor hardware, thus leaving an unfortunate gap between real-time scheduling theory and its practice. In light of current and expected trends in commercial microprocessor architecture design, it is therefore important to make a qualitative assessment o...

This paper is concerned with online story scheduling, motivated by storyboarding in online advertising. In storyboarding, triggered by the browsing history of a user, advertisers arrive online and wish to present a sequence of ads (stories) on the website. The user ceases to browse with probability 1− β at each time step. Once the user finishes watching an ad, the advertiser derives a reward. T...

We consider polynomial-time algorithms for partitioning a collection of non-preemptive or restricted-preemption tasks among the processors of an identical multiprocessor platform. Since the problem of partitioning tasks among processors (even with unlimited preemption) is NP-hard in the strong sense, these algorithms are unlikely to be optimal. For task systems where the ratio between the large...

This paper examines a fundamental problem in the theory of real-time scheduling, that of scheduling a set of periodic or sporadic tasks on a uniprocessor without preemption and without inserted idle time. We exhibit a necessary and sufficient set of conditions C for a set of periodic or sporadic tasks to be schedulable for arbitrary release times of the tasks. We then show that any set of perio...

In this paper, a task scheduling problem for cloud computing environment is formulated by using the M/M/n queuing model. A priority assignment algorithm designed to employ new data structure named waiting time matrix assign individual tasks upon arrival. addition this, queue implements unique concept based on principle of Fibonacci heap extracting with highest priority. This work introduces par...

Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and compu...

1 Please direct all correspondence to Krishna Kavi, Department of Computer Science and Engineering, The University of North Texas, P.O. Box 311366, Denton, Texas 76203, [email protected] Abstract Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring no...

The challenge in conserving energy in embedded real-time systems is to reduce power consumption while preserving temporal correctness. Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of online energy-aware I/O scheduling for hard real-time systems based on the preempt...

A key challenge in designing realtime systems for nonpreemptive architectures is the timely guarantee of the execution of periodic tasks, together with non-periodic tasks. The main challenge of scheduling tasks in such systems results from the conflict between the requirement to execute periodic tasks at specific time intervals, versus the requirement to yield the CPU to non-periodic tasks. The...

The power consumption rate of computing devices has seen an enormous increase over the last decades. Therefore computer systems must make a trade-off between performance and energy usage. This observation has led to speed scaling, a technique that adapts the speed of the system to balance energy and performance. Fundamentally, when implementing speed scaling, an algorithm must make two decision...