22,393 research outputs found
An Analytical Solution for Probabilistic Guarantees of Reservation Based Soft Real-Time Systems
We show a methodology for the computation of the probability of deadline miss
for a periodic real-time task scheduled by a resource reservation algorithm. We
propose a modelling technique for the system that reduces the computation of
such a probability to that of the steady state probability of an infinite state
Discrete Time Markov Chain with a periodic structure. This structure is
exploited to develop an efficient numeric solution where different
accuracy/computation time trade-offs can be obtained by operating on the
granularity of the model. More importantly we offer a closed form conservative
bound for the probability of a deadline miss. Our experiments reveal that the
bound remains reasonably close to the experimental probability in one real-time
application of practical interest. When this bound is used for the optimisation
of the overall Quality of Service for a set of tasks sharing the CPU, it
produces a good sub-optimal solution in a small amount of time.Comment: IEEE Transactions on Parallel and Distributed Systems, Volume:27,
Issue: 3, March 201
A tabu search procedure for generating robust project baseline schedules under stochastic resource availabilities.
The majority of research efforts in project scheduling assume a static and deterministic environment with complete information. In practice, however, these assumptions will hardly, if ever, be satisfied. Proactive scheduling aims at the generation of robust baseline schedules that are as much as possible protected against anticipated disruptions that may occur during project execution. In this paper, we focus on disruptions that may be caused by stochastic resource availabilities and aim at generating stable baseline schedules, where the solution robustness (stability) of the baseline schedule is measured by the weighted deviation between the planned and the actually realized activity starting times during project execution. We present a tabu search procedure that operates on a surrogate free slack based objective function. The effectiveness of the procedure is demonstrated by extensive computational results obtained on a set of randomly generated test instances.
Time and Organizational Improvisation
This paper argues that the apparent contradiction in current conceptualizations of time in organizations (e.g., Chronos vs. Kairos) is only apparent, and that a synthesis between these opposing poles is both possible and desirable. We propose improvisation (where time to plan converges with time to act) as a vehicle for articulating a dialectical view of time-based organizational phenomena, while focusing on the three major time-related problems organizations have to solve: scheduling, synchronization, and allocation. The paper discusses how improvisation helps to synthesize even time and event time in scheduling processes, internal pacing and external pacing in synchronization processes, and linear and cyclical time in allocation processes. Methodological and practical obstacles to synthesis are also discussed.Improvisation, Planning, Time
- …