Stochastic Bounds for Markov Chains with the Use of GPU

被引：2

作者：

Bylina, Jaroslaw ^{[1
]}

Fourneau, Jean-Michel ^{[2
,3
]}

Karwacki, Marek ^{[1
]}

Pekergin, Nihal ^{[4
]}

Quessette, Franck ^{[2
,3
]}

机构：

[1] Marie Curie Sklodowska Univ, Inst Math, Lublin, Poland

[2] CNRS, PRiSM, Versailles, France

[3] Univ Versailles St Quentin, Versailles, France

[4] UPEC, LACL, Creteil, France

来源：

COMPUTER NETWORKS, CN 2015 | 2015年 / 522卷

关键词：

Markov chains; GPU; Stochastic bounds; Sparse matrices; Heterogeneous algorithms;

D O I：

10.1007/978-3-319-19419-6_34

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The authors present a new approach to find stochastic bounds for a Markov chain - namely with the use of the GPU for computing the bounds. A known algorithm [1,2] is used and it is rewritten to suit the GPU architecture with the cooperation of the CPU. The authors do some experiments with matrices from various models as well as some random matrices. The tests are analyzed and some future considerations are given.

引用

页码：357 / 370

页数：14

共 19 条

[1]

Abu-Amsha O, 1998, 4 INFORMS C TEL BOC

[2]

[Anonymous], 1997, Markov processes for stochastic modeling

[3]

[Anonymous], 2022, Stochastic Models

[4]

[Anonymous], P 22 INT C PAR ARCH

[5]

[Anonymous], 2002, Comparison Methods for Stochastic Models and Risks

[6] Generalized class C Markov chains and computation of closed-form bounding distributions [J].

Ben Mamoun, Mouad ;

Busic, Ana ;

Pekergin, Nihal .

PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2007, 21 (02) :235-260

[7]

Busic A, 2005, 2005 IEEE IPSJ INT S, P260

[8]

Bylina B., 2011, THEOR APPL INFORM, V23, P127

[9]

Bylina B, 2012, COMM COM INF SC, V291, P401, DOI 10.1007/978-3-642-31217-5_42

[10] An Efficient Representation on GPU for Transition Rate Matrices for Markov Chains [J].

Bylina, Jaroslaw ;

Bylina, Beata ;

Karwacki, Marek .

PARALLEL PROCESSING AND APPLIED MATHEMATICS (PPAM 2013), PT I, 2014, 8384 :663-672

← 1 2 →