FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions
نویسندگان
چکیده
We investigate some real-time behaviour of a (discrete time) single server system with FCFS (first come first serve) task scheduling under rush-hour conditions . The main result deals with the probability distribution of a random variable SRD(T), which describes the time the system operates without violating a fixed task service time deadline T Relying on a simple general probability model, asymptotic formulas concerning the mean and the variance of SRD (T) are determined ; for instance, if the average arrival rate is larger than the departure rate, the expectation of SRD(T) is proved to fulfil E[SRD(T)] = c, + O(T ') for T -+ m, where c, denotes some constant .If the arrival rate equals the departure rate, we find E[SRD(T)] c 2 T' for some i>2 . AMS Classification : OSA15, 05CO5, 68C15, 68E10 .
منابع مشابه
Some Investigations on FCFS Scheduling in Hard Real Time Applications
We investigate some real time behaviour of a (discrete time) single server system with FCFS task scheduling. The main results deal with the probability distribution of a random variable SRD(T), which describes the time the system operates without violating a fixed task service time deadline T. The tree approach used for the derivation of our results is suitable for revisiting problems already s...
متن کاملIntegrated capacitated transportation and production scheduling problem in a fuzzy environment
Nowadays, several methods in production management mainly focus on the different partners of supply chain management. In real world, the capacity of planes is limited. In addition, the recent decade has seen the rapid development of controlling the uncertainty in the production scheduling configurations along with proposing novel solution approaches. This paper proposes a new mathematical model...
متن کاملGuaranteeing End-to-End Deadlines in ATM Networks
In this paper we address the issue of guaranteeing the end-to-end deadlines of hard real-time connections in an ATM network. In an ATM network, a set of hard real-time connections can be admitted only if the end-to-end delays of cells belonging to individual connections are not more than their deadlines. We systematically decompose an ATM network into constant delay and variable delay servers t...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملTask scheduling using probabilistic ant colony heuristics
The problem of determining whether a set of tasks can be assigned to a set of heterogeneous processors in general is NP-hard. Generating an efficient schedule of tasks for a given application is critical for achieving high performance in a heterogeneous computing environment. This paper presents a novel algorithm based on Ant Colony Optimization (ACO) for the scheduling problem. An attempt is m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- BIT
دوره 32 شماره
صفحات -
تاریخ انتشار 1992