Results 1  10
of
602,217
Dynamic Dictionaries in Constant WorstCase Time
"... We introduce a technique to maintain a set of n elements from a universe of size u with membership and indel operations, so that elements are associated rbit satellite data. We achieve constant worstcase time for all the operations, at the price of spending u + o(u) + O(nr + n log log log u) bits ..."
Abstract
 Add to MetaCart
We introduce a technique to maintain a set of n elements from a universe of size u with membership and indel operations, so that elements are associated rbit satellite data. We achieve constant worstcase time for all the operations, at the price of spending u + o(u) + O(nr + n log log log u) bits
Worstcase Time Bounds for Coloring and Satisfiability Problems
, 2002
"... Abstract 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) ran ..."
Abstract
 Add to MetaCart
Abstract 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
Worstcase timing analysis of exception handling in Ada
 in Ada. Ada: Towards Maturity
, 1993
"... . This paper describes a method for analysing the timing properties of exception handling in Ada. The paper first describes how exceptions are implemented and considers the use of exceptions in the SPARK, Safe/Ada and ANNA subsets. A static analysis technique for reasoning about exception propagatio ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
propagation is then presented. We argue that this technique, along with a suitable subset and detailed knowledge of exception implementation can be used to develop an accurate worstcase timing analysis system. The method is illustrated with an example. Finally, our conclusions and plans for further work
An Accurate Worst Case Timing Analysis for RISC Processors
 IN IEEE REALTIME SYSTEMS SYMPOSIUM
, 1995
"... An accurate and safe estimation of a task's worst case execution time (WCET) is crucial for reasoning about the timing properties of realtime systems. In RISC processors, the execution time of a program construct (e.g., a statement) is affected by various factors such as cache hits/misses a ..."
Abstract

Cited by 116 (3 self)
 Add to MetaCart
An accurate and safe estimation of a task's worst case execution time (WCET) is crucial for reasoning about the timing properties of realtime systems. In RISC processors, the execution time of a program construct (e.g., a statement) is affected by various factors such as cache hits
Efficient worst case timing analysis of data caching
 In IEEE RealTime Technology and Applications Symposium
, 1996
"... Recent progress in worst case timing analysis of programs has made it possible to perform accurate timing analysis of pipelined execution and instruction caching, which is necessary when a RISC processor is used as the target processor of a realtime system. However, there has not been much progress ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
Recent progress in worst case timing analysis of programs has made it possible to perform accurate timing analysis of pipelined execution and instruction caching, which is necessary when a RISC processor is used as the target processor of a realtime system. However, there has not been much
On the probabilistic worstcase time of "FIND"
 ALGORITHMICA
, 2001
"... We analyze the worstcase number of comparisons Tn of Hoare’s selection algorithm find when the input is a random permutation, and worst case is measured with respect to the rank k. We give a new short proof that Tn/n tends to a limit distribution, and provide new bounds for the limiting distributi ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We analyze the worstcase number of comparisons Tn of Hoare’s selection algorithm find when the input is a random permutation, and worst case is measured with respect to the rank k. We give a new short proof that Tn/n tends to a limit distribution, and provide new bounds for the limiting
EXPOSE: Inferring Worstcase Time Complexity by Automatic Empirical Study
"... Introduction to doubling. A useful understanding of an algorithm’s efficiency, the worstcase time complexity gives an upper bound on how an increase in the size of the input, denoted n, increases the execution time of the algorithm, or f(n). This relationship is often expressed in the ..."
Abstract
 Add to MetaCart
Introduction to doubling. A useful understanding of an algorithm’s efficiency, the worstcase time complexity gives an upper bound on how an increase in the size of the input, denoted n, increases the execution time of the algorithm, or f(n). This relationship is often expressed in the
Integrated program proof and worstcase timing analysis of SPARK Ada.
 In Proc. ACM SIGPLAN Workshop on Languages, Compilers and Tools for RealTime Systems (LCTRTS'94
, 1994
"... . This paper describes work in progress at the University of York on worstcase timing analysis of software for hard realtime and safetycritical systems. We are pursuing a programming environment that combines the technologies of program proof and timing analysis. In short, the analytical power af ..."
Abstract

Cited by 45 (7 self)
 Add to MetaCart
. This paper describes work in progress at the University of York on worstcase timing analysis of software for hard realtime and safetycritical systems. We are pursuing a programming environment that combines the technologies of program proof and timing analysis. In short, the analytical power
Worstcase time decremental connectivity and kedge witness
, 2008
"... We give a simple algorithm for decremental graph connectivity that handles edge deletions in worstcase time O(k log n) and connectivity queries in O(log k), where k is the number of edges deleted so far, and uses worstcase space O(m 2). We use this to give an algorithm for kedge witness (“does th ..."
Abstract
 Add to MetaCart
We give a simple algorithm for decremental graph connectivity that handles edge deletions in worstcase time O(k log n) and connectivity queries in O(log k), where k is the number of edges deleted so far, and uses worstcase space O(m 2). We use this to give an algorithm for kedge witness (“does
Modeling of Ethernet AVB Networks for WorstCase Timing Analysis
"... Abstract: Ethernet is currently explored as the upcoming network standard for distributed control applications in many different industries such as automotive, avionics and industrial automation. It offers higher performance and flexibility over traditional control bus systems such as CAN and ProfiB ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
realtime systems to derive worstcase timing properties and hence timing guarantees of the original Ethernet AVB network. For this, we provide the required formalism for the analysis of the scheduling of Ethernet AVB.
Results 1  10
of
602,217