DR for foreground-background QBD processes
Brief description of the
algorithm
Input: A foreground QBD process whose transitions depend on
the level of a background QBD process (the input is the generator matrices
for these processes).
Output: A single generator matrix for an approximate foreground
QBD process.
Source code (matlab)
DR.zip
The above file contains the following set of files:
README.txt
infinite2finite.m
infinite2finiteA.m
infinite2finiteB.m
finiteforeground.m
Neuts3.m
homoNeuts.m
nonhomoNeuts.m
FPmatrix.m
RUGmatrices.m
Gmatrix.m
Mmatrix.m
MRImatrix.m
coxian2.m
Related documents
This is an implementation of the algorithm described in
Applications of the algorithm, DR, can be found in
- [MAMA04] Takayuki Osogami, Adam Wierman, Mor Harchol-Balter, and Alan
Scheller-Wolf, "A recursive analysis technique for multi-dimensionally
infinite Markov chains," The Sixth Workshop
on Mathematical Performance Modeling and Analysis (MAMA 2004), June
2004.
- [SIGMETRICS03] Takayuki Osogami, Mor Harchol-Balter, and Alan Scheller-Wolf,
"Analysis of Cycle Stealing with Switching Cost," ACM SIGMETRICS 2003,
pages 184-195, June 2003.
- [SPAA03] Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan
Scheller-Wolf, and Mark S. Squillante, "Cycle Stealing under Immediate
Dispatch Task Assignment," The Fifteenth ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2003), pages
274-285, June 2003.
- [ICDCS03] Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan
Scheller-Wolf, and Mark S. Squillante, "Analysis of Task Assignment with
Cycle Stealing under Central Queue," The 23rd International Conference
on Distributed Computing Systems (ICDCS 2003), pages 628-637,
May 2003.
- [PE04a] Takayuki Osogami, Mor Harchol-Balter, and Alan Scheller-Wolf,
"Analysis of Cycle Stealing with Switching Times and Thresholds," accepted
for publication, August 2004.
- [ADAPTIVE04] Takayuki Osogami, Mor Harchol-Balter, Alan Scheller-Wolf,
and Li Zhang "An
Adaptive Threshold-Based Policy for Sharing Servers with Affinities,"
Technical Report CMU-CS-04-112 (2004).
- [RDR03b] Adam Wierman, Takayuki Osogami, Mor Harchol-Balter, and
Alan Scheller-Wolf "
Analyzing the Effect of Prioritized Background Tasks in Multiserver
Systems," Technical Report CMU-CS-03-213 (2003).
- [PE04b] Takayuki Osogami, Adam Wierman, Mor Harchol-Balter, and
Alan Scheller-Wolf "
How Many Servers are Best in a Dual-Priority FCFS System?," Technical
Report CMU-CS-03-201 (2003); also submitted for publication, August
2004.
or
- Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf,
and Mark S. Squillante, Analysis of Task Assignment with Cycle Stealing
under Central Queue, IBM Watson Research Research Report, RC23098
(February 2004).
- Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf,
and Mark S. Squillante, Cycle Stealing under Immediate Dispatch Task
Assignment, IBM Watson Research Research Report, RC23093 (January
2004).
- Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf,
and Mark S. Squillante, "
Analysis of Task Assignment with Cycle Stealing," Technical Report
CMU-CS-02-158 (July 2002).
Takayuki Osogami
Department of Computer Science
Carnegie Mellon University
5000 Forbes Avenue
Pittsburgh, PA 15213