ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Performance Evaluation
Volume 54, Issue 2, October 2003, Pages 105-128
Modelling Techniques and Tools for Computer Performance Evaluation
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (203 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0166-5316(03)00070-1    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier Science B.V. All rights reserved.

The Möbius state-level abstract functional interface*1

Salem Derisavia, Corresponding Author Contact Information, E-mail The Corresponding Author, Peter KemperE-mail The Corresponding Author, b, William H. SandersE-mail The Corresponding Author, a and Tod CourtneyE-mail The Corresponding Author, a

a Coordinated Science Laboratory, Electrical and Computer Engineering Department, and Computer Science Department, University of Illinois at Urbana-Champaign, 1308 W. Main St., Urbana, IL 61801, USA b Informatik IV, Universität Dortmund, D-44221, Dortmund, Germany

Available online 20 June 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

A key advantage of the Möbius modeling environment is the ease with which one can incorporate new modeling formalisms, model composition and connection methods, and model solution methods. We present a new state-level abstract functional interface (AFI) for Möbius that allows numerical solution methods to communicate with Möbius state-level models via the abstraction of a labeled transition system (LTS). This abstraction and its corresponding implementation yield a useful separation of concerns. We illustrate use of the Möbius state-level AFI by implementing two state-space representations and several numerical solvers for steady-state and transient analysis.

Author Keywords: Markov chain analysis; Kronecker representation

Article Outline

1. Introduction
2. Requirements
3. State-level AFI definition
3.1. LTS definition
3.2. Use of containers and iterators
3.3. State-level AFI classes
3.3.1. Required operations
3.3.2. AFI classes
3.3.3. Example container class: submatrix
3.4. Evaluation
4. Example state-level AFI implementations
4.1. Flat state-level object
4.2. Kronecker-based state-level object
5. Performance
5.1. Example models
5.2. Comparison of iterators
6. Conclusions
Acknowledgements
References
Vitae



Performance Evaluation
Volume 54, Issue 2, October 2003, Pages 105-128
Modelling Techniques and Tools for Computer Performance Evaluation
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.