Learn More
Distributed Shared-Memory (DSM) multiprocessors provide an attractive combination of cost-effective commodity architecture and, thanks to the shared-memory abstraction, relative ease of programming. Unfortunately, it is well known that tuning applications for scalable performance in these machines is time-consuming. To address this problem, programmers use(More)
In this work, we present a first effort at quantitatively comparing the strengths and limitations of various intrusion-tolerant server architectures. We study four representative architectures, and use stochas-tic models to quantify the costs and benefits of each from both the performance and dependability perspectives. We present results characterizing(More)
Many distributed applications have to meet their performance or quality-of-service goals in environments where available resources change contantly. Important classes of distributed applications (including distributed multimedia codes, applications for mobile devices, and computational grid codes) use <i>runtime adaptation</i> in order to achieve their(More)
Structured (a.k.a. symbolic) representation techniques of Markov models have, to a large extent, been used effectively for representing very large transition matrices and their associated state spaces. However, their success means that the largest space requirement encountered when analyzing these models is often the representation of their iteration and(More)
This tool paper presents the integration of the MODEST specification language into the M ¨ OBIUS framework. The M ¨ OBIUS framework. The M ¨ OBIUS framework [2] is an environment for supporting multiple modeling formalisms and solution techniques. Models expressed in formalisms that are compatible with the framework are translated into equivalent models(More)
Markov models are used in many industrial applications, but, for very large models, simulation is often currently the only viable evaluation technique. However, simulation techniques that are based on evaluating trajectories at the level of individual states and transitions can be inefficient because they have to keep track of many details. Moreover, since(More)