Aggregation/Disaggregation Method on Parallel Computer

Yukio Takahashi and Kou Fujimoto
Additional contact information
Yukio Takahashi: Tokyo Institute of Technology, Department of Information Sciences
Kou Fujimoto: Tokyo Institute of Technology, Department of Information Sciences

Chapter 34 in Computations with Markov Chains, 1995, pp 591-593 from Springer

Abstract: Extended Abstract The aggregation/disaggregation method (the A/D method) is an iterative method for calculating the stationary probabilities of large scale Markov chains numerically. It consists of two phases; the aggregation phase and the disaggregation phase. In the disaggregation phase, a number of linear equations have to be solved. Since these calculations can be done in parallel, the A/D method is a suitable numerical method for parallel computers.

Keywords: Data Transfer; Parallel Computer; Time Continuous Markov Chain; Dimensional Torus; Service Completion (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4615-2241-6_34

Ordering information: This item can be ordered from
http://www.springer.com/9781461522416

DOI: 10.1007/978-1-4615-2241-6_34

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().