An efficient disk-based tool for solving large Markov models
| Autor: | William H. Sanders, Daniel D. Deavours |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
Workstation
Computer Networks and Communications Computer science Process (computing) Kanban Markov model Transition rate matrix Variable-order Bayesian network law.invention Computational science Matrix (mathematics) Hardware and Architecture law Modeling and Simulation Algorithm Software Block (data storage) |
| Zdroj: | Performance Evaluation. 33:67-84 |
| ISSN: | 0166-5316 |
| Popis: | Very large Markov models often result when modeling realistic computer systems and networks. We describe a new tool for solving large Markov models on a typical engineering workstation. This tool does not require any special properties or a particular structure in the model, and it requires only slightly more memory than what is necessary to hold the solution vector itself. It uses a disk to hold the state-transition-rate matrix, a variant of block Gauss-Seidel as the iterative solution method, and an innovative implementation that involves two parallel processes: the first process retrieves portions of the iteration matrix from disk, and the second process does repeated computation on small portions of the matrix. We demonstrate its use on two realistic models: a Kanban manufacturing system and the Courier protocol stack, which have up to 10 million states and about 100 million nonzero entries. The tool can solve the models efficiently on a workstation with 128 Mbytes of memory and 4 Gbytes of disk. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect