Real–time software systems with tight performance requirements are abundant. These systems frequently use many different algorithms and if these algorithms were to experience worst case behavior, the system may not be able to meet its performance requirements. Unfortunately, the inputs which would cause worst case behavior are often unknown, making it very difficult to defend against them. In t...

Utility system operators and engineers want a better understanding of the impacts of large wind farms on grid stability before they are interconnected to the grid. Utilities need wind electrical models and methods of analysis that will help them analyze potential problems of grid stability. Without the necessary tools and knowledge of the behavior of large wind farms, utilities are reluctant to...

In this paper‎, ‎we study convergence behavior of the global FOM (Gl-FOM) and global GMRES (Gl-GMRES) methods for solving the matrix equation $AXB=C$ where $A$ and $B$ are symmetric positive definite (SPD)‎. ‎We present some new theoretical results of these methods such as computable exact expressions and upper bounds for the norm of the error and residual‎. ‎In particular‎, ‎the obtained upper...

Traditional timing analysis techniques rely on composing system-level worst-case behavior with local worst-case behaviors of individual components. In many complex real-time systems, no single local worst-case behavior exists for each component and it generally requires to enumerate all the combinations of individual local behaviors to find the global worst case. This paper presents a scalable ...

We analyze the List scheduling algorithm for the problem of minimizing makespan using a worst-average-case or wac analysis technique, previously used by Kenyon for analyzing the Best Fit bin packing algorithm. We show that List’s worst-average-case or wac ratio asymptotically approaches 2 as m→∞. Thus, List’s worst-case behavior is not overly dependent on the order of job arrivals.

This paper is concernedwith the analysis of theworst case behavior of Hopcroft’s algorithm for minimizing deterministic finite state automata. We extend a result of Castiglione, Restivo and Sciortino. They show that Hopcroft’s algorithm has a worst case behavior for the automata recognizing Fibonacci words. In a previous paper, we have proved that this holds for all standard Sturmian words havi...