Results 1  10
of
317
A WorstCase Behaviour Analysis for Hard RealTime Transactions
"... Most hard realtime systems that incorporate database components assume that the data is resident in main memory. For these systems, priority ceiling protocols can be used to limit priority inversion. In this paper we consider disk resident data, additionally we assume optimistic concurrency control ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
control with abort and restart. Hence, when a high priority transaction requires access to the disk it will cause any lower level transactions that are accessing the disk to be aborted. Analysis is presented that allows the worst case response times of transactions to be calculated. A feature
On Average and Worst Case Behaviour in NonPreemptive Priority Queueing
 In Proceedings of the 2003 Internation Symposium on Performance Evaluation of Computer and Telecommunication Systems
, 2003
"... Abstract: In this paper, we derive worst case bounds on delay and backlog for nonpreemptive priority queueing systems using network calculus. There are known results for the average behaviour of nonpreemptive priority queueing systems from traditional queueing theory. By use of numerical investiga ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract: In this paper, we derive worst case bounds on delay and backlog for nonpreemptive priority queueing systems using network calculus. There are known results for the average behaviour of nonpreemptive priority queueing systems from traditional queueing theory. By use of numerical
ZeroSum Markov Games and WorstCase Optimal Control of Queueing Systems
 QUESTA
, 1994
"... Zero sum stochastic games model situations where two persons, called players, control some dynamic system, and both have opposite objectives. One player wishes typically to minimize a cost which has to be paid to the other player. Such a game may also be used to model problems with a single controll ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
;nature" (called player 1), and the objective of the controller (player 2) is then to design a policy that guarantees the best performance under worstcase behaviour of nature. The purpose of this paper is to present a survey of stochastic games in queues, where both tools and applications are considered
Worstcase evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
"... Abstract The worstcase behaviour of a general class of regularization algorithms is considered in the case where only objective function values and associated gradient vectors are evaluated. Upper bounds are derived on the number of such evaluations that are needed for the algorithm to produce an ..."
Abstract
 Add to MetaCart
Abstract The worstcase behaviour of a general class of regularization algorithms is considered in the case where only objective function values and associated gradient vectors are evaluated. Upper bounds are derived on the number of such evaluations that are needed for the algorithm to produce
An Approach To Symbolic WorstCase Execution Time Analysis
 In 25th IFAC Workshop on RealTime Programming
, 2000
"... Using the constant value for the worst case execution time for all calls to a subprogram is safe but pessimistic. We address the problem of tailoring the WCET of each call to a subprogram by building the WCET as an algebraic expression parameterised with some of the subprogram parameters. The WCE ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
Using the constant value for the worst case execution time for all calls to a subprogram is safe but pessimistic. We address the problem of tailoring the WCET of each call to a subprogram by building the WCET as an algebraic expression parameterised with some of the subprogram parameters
Worstcase performance analysis of synchronous dataflow scenarios
 in CODES/ISSS
, 2010
"... Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to accurately capture the behaviour of modern, dynamic dataflow applications, such as embedded multimedia codecs. An approach ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
machine that specifies the possible orders of scenario occurrences. This combination accurately captures more dynamic applications and this way provides tighter results than an existing analysis based on a conservative static dataflow model, which is too pessimistic, while looking only at the ‘worstcase
Peer Groups
"... this paper is to present the details of our new allocator, it is important to demonstrate that the allocator can work in conjunction with (at least) a simple collector without compromising the worstcase behaviour. We therefore present in this section a garbage collector that is both scalable and no ..."
Abstract
 Add to MetaCart
this paper is to present the details of our new allocator, it is important to demonstrate that the allocator can work in conjunction with (at least) a simple collector without compromising the worstcase behaviour. We therefore present in this section a garbage collector that is both scalable
Worstcase Time Bounds for Coloring and Satisfiability Problems
, 2002
"... We consider worst case time bounds for NPcomplete problems. For the (k, 2)satisfiability problem, we give a randomized algorithm that runs in time O\Lambda ((k!)n=k). This bound is O((k=ck)n) with ck increasing to the asymptotic limit e, and improves for k * 11 over the O((0:4518k)n) randomized b ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
We consider worst case time bounds for NPcomplete problems. For the (k, 2)satisfiability problem, we give a randomized algorithm that runs in time O\Lambda ((k!)n=k). This bound is O((k=ck)n) with ck increasing to the asymptotic limit e, and improves for k * 11 over the O((0:4518k)n) randomized
Comparing the WorstCase Efficiency of Asynchronous Systems with PAFAS
"... A timed CCSlike process algebra PAFAS and a testing scenario are developed for evaluating the temporal worstcase efficiency of asynchronous concurrent systems. Each action is associated with a maximal time delay, which allows components to work with arbitrary relative speeds; for simplicity, the ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
A timed CCSlike process algebra PAFAS and a testing scenario are developed for evaluating the temporal worstcase efficiency of asynchronous concurrent systems. Each action is associated with a maximal time delay, which allows components to work with arbitrary relative speeds; for simplicity
A Note on the Smyth Powerdomain Construction
, 1993
"... this paper we define a different representation for the Smyth powerdomain. We use minimal representatives instead of maximal ones. The reason for using minimal representatives is the following. Consider the collection of all possible results of a nondeterministic program. The worst case behaviour of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
this paper we define a different representation for the Smyth powerdomain. We use minimal representatives instead of maximal ones. The reason for using minimal representatives is the following. Consider the collection of all possible results of a nondeterministic program. The worst case behaviour
Results 1  10
of
317