By Topic

Quantitative Evaluation of Systems (QEST), 2010 Seventh International Conference on the

Date 15-18 Sept. 2010

Filter Results

Displaying Results 1 - 25 of 53
  • [Front cover]

    Publication Year: 2010, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (4380 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2010, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (15 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2010, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (65 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2010, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (109 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2010, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (205 KB)
    Freely Available from IEEE
  • Message from the General Co-chairs

    Publication Year: 2010, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (101 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Committee Co-chairs

    Publication Year: 2010, Page(s):x - xi
    Request permission for commercial reuse | PDF file iconPDF (151 KB) | HTML iconHTML
    Freely Available from IEEE
  • Chairs and Committees

    Publication Year: 2010, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2010, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2010, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • The Role of Quantitative Models in Building Scalable Cloud Infrastructures

    Publication Year: 2010, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (63 KB) | HTML iconHTML

    Planetary scale cloud computing requires hugely scalable infrastructures for compute, storage, network, and services that support programming models such as Map Reduce. There are many design choices that arise in the construction of cloud infrastructures. Examples include: scheduling policies for compute clusters, caching and replication policies for storage, and approaches to integrating bandwidt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Checking Multivariate State Rewards

    Publication Year: 2010, Page(s):7 - 16
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (349 KB) | HTML iconHTML

    We consider continuous stochastic logics with state rewards that are interpreted over continuous time Markov chains. We show how results from multivariate phase type distributions can be used to obtain higher-order moments for multivariate state rewards (including covariance). We also generalise the treatment of eventuality to unbounded path formulae. For all extensions we show how to obtain close... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information Hiding in Probabilistic Concurrent Systems

    Publication Year: 2010, Page(s):17 - 26
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (469 KB) | HTML iconHTML

    Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are examples of this notion. We study the problem of information hiding in systems characterized by the presence of randomization and concurrency. It is well known that the raising of nondeterminism, due to the possible interle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems

    Publication Year: 2010, Page(s):27 - 36
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scant attention in this area, at least from the implementation perspective. This paper studies the problem of how to efficiently realize an algorithm for computing optimal long-run average reward values for concurrent probabilistic sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DTMC Model Checking by SCC Reduction

    Publication Year: 2010, Page(s):37 - 46
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (426 KB) | HTML iconHTML

    Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking algorithms and thus support the verification of DTMCs. However, these algorithms do not provide any diagnostic information in the form of counterexamples, which are highly important for the correction of erroneous systems... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Phase-Type Representation for the Queue Length Distribution of a Semi-Markovian Queue

    Publication Year: 2010, Page(s):49 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    In this paper we study a broad class of semi-Markovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue and others, as well as queues with correlated inter-arrival and service times. Queues belonging to this class are characterized by a set of matrices of size m and Sengupta showed that its waiting time distribution can be represente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Prediction Model for Software Performance in Symmetric Multiprocessing Environments

    Publication Year: 2010, Page(s):59 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1291 KB) | HTML iconHTML

    The broad introduction of multi-core processors made symmetric multiprocessing (SMP) environments mainstream. The additional cores can significantly increase software performance. However, their actual benefit depends on the operating system scheduler's capabilities, the system's workload, and the software's degree of concurrency. The load distribution on the available processors (or cores) strong... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Evaluation of Entropy Based Approaches to Alert Detection in High Performance Cluster Logs

    Publication Year: 2010, Page(s):69 - 78
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (871 KB) | HTML iconHTML

    Manual alert detection on modern high performance clusters (HPC) is cumbersome given their increasing complexity and size of their logs. The ability to automatically detect such alerts quickly and accurately with little or no human intervention is therefore desirable. The entropy-based approach of the Nodeinfo framework, which is in production use at Sandia National Laboratories, is one approach t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DSPN-Tool: A New DSPN and GSPN Solver for GreatSPN

    Publication Year: 2010, Page(s):79 - 80
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (187 KB) | HTML iconHTML

    Generalized and Deterministic Stochastic Petri Nets (GSPN and DSPN) and their relative solvers have been around for a while. In the last years research on GSPN solution has mainly concentrated on efficient data structure for state space representation, while little has been published on DSPN. Strangely enough although, the DSPN solvers available do still exhibit a number of limitations, most notab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Toolbox for Component-Wise Bounds for Steady-State Distribution of a DTMC

    Publication Year: 2010, Page(s):81 - 82
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (171 KB) | HTML iconHTML

    We present new algorithms we have recently introduced and which provide iterative component-wise bounds of the steady-state distribution of Markov chains. At each iteration we improve the quality of the bounds and these bounds are tight as the limit is the exact solution. As the algorithms are based on the product matrix-vector and properties of (max, +) sequences, they can easily be included into... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PSI2: Envelope Perfect Sampling of Non Monotone Systems

    Publication Year: 2010, Page(s):83 - 84
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    The famed perfect sampling method of Propp and Wilson uses a backward coupling scheme to compute unbiased samples of the stationary distribution of Markov chains. It has been implemented in a software tool, called PSI2, that proved very efficient for monotone chains coming from queuing networks. However, when the system includes at least one non-monotone event, the backward simulation scheme has t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ProFiDo - The Processes Fitting Toolkit Dortmund

    Publication Year: 2010, Page(s):87 - 96
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1178 KB) | HTML iconHTML

    This paper describes the Java-based toolkit ProFiDo which integrates several tools for fitting input models. Currently supported are command line tools for fitting probability distributions, ARIMA processes and Markovian arrival processes. The toolkit provides a graphical user interface which allows for the specification of workflows that describe the different steps of data preprocessing, paramet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fitting Markovian Arrival Processes by Incorporating Correlation into Phase Type Renewal Processes

    Publication Year: 2010, Page(s):97 - 106
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    This paper presents a novel MAP fitting method. As many recent fitting methods, it is based on the separate fitting of the distribution of the inter-arrival times and the correlation structure of the arrival process. We assume that a Phase-type(PH) distribution representing the inter-arrival times is available. Our procedure obtains a MAP featuring the prescribed PH distributed inter-arrival times... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Canonical Form Based MAP(2) Fitting

    Publication Year: 2010, Page(s):107 - 116
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1113 KB) | HTML iconHTML

    The importance of the order two Markovian arrival process (MAP(2)) comes from its compactness, serving either as arrival or service process in applications, and from the nice properties which are not available for higher order MAPs. E.g., for order two processes the acyclic MAP(2) (AMAP(2)), the MAP(2) and the order two matrix exponential process (MEP(2)) are equivalent. Additionally, MAP(2) proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reflections on the Numerical Solution of Markov Chains

    Publication Year: 2010, Page(s): 119
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (67 KB) | HTML iconHTML

    It has been 45 years since Vic Wallace introduced RQA1, the first software system to generate and then compute the stationary distribution of Markov chains. RQA1 proved successful for a period of time but eventually hit upon a type of problem that it just could not solve, namely a nearly-completely-decomposable (NCD) Markov chain. In the intervening years our understanding of NCD systems has grown... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.