NDLI: Parallel randomization for large structured Markov chains

Content Provider	IEEE Xplore Digital Library
Author	Kemper, P.
Copyright Year	2002
Description	Author affiliation: Informatik IV, Dortmund Univ., Germany (Kemper, P.)
Abstract	Multiprocessor architectures with few but powerful processors are gaining more and more popularity. We describe a parallel iterative algorithm to perform randomization for a continuous time Markov chain with a Kronecker representation on a shared memory architecture. The Kronecker representation is modified for a parallel matrix-vector multiplication with a fast multiplication scheme and no write conflicts on iteration vectors. The proposed technique is applied on a model of a workstation cluster for dependability analysis, corresponding computations are performed on two multiprocessor architectures, a Sun enterprise and a SGI Origin 2000 to measure its performance.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Fault-Tolerant Comput. (TCFTC) IFIP Working Group 10.4 on Dependable Comput. & Fault Tolerence DARPA LAAS-CNRS Univ. Michigan
Starting Page	657
Ending Page	666
File Size	397013
Page Count	10
File Format	PDF
ISBN	0769511015
DOI	10.1109/DSN.2002.1029011
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-06-23
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Memory architecture Stochastic processes Numerical analysis State-space methods Sparse matrices Workstations Performance analysis Concurrent computing Steady-state Jacobian matrices
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Shared Transaction Markov Chains for fluid analysis of massively parallel systems

Analyzing Large Sparse Markov Chains of Kronecker Products

State space construction and steady-state solution of GSPNs on a shared-memory multiprocessor

Computing Closed-Form Stochastic Bounds on Transient Distributions of Markov Chains

Numerical Methods for Structured Markov Chains

On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets

Merging Jacobi and Gauss-Seidel methods for solving Markov chains on computer clusters

The complexity of performance analysis in parallel algorithms and systems

An algorithmic and numerical approach to bound the performance of high speed networks

Parallel randomization for large structured Markov chains

Similar Documents

Shared Transaction Markov Chains for fluid analysis of massively parallel systems

Analyzing Large Sparse Markov Chains of Kronecker Products

State space construction and steady-state solution of GSPNs on a shared-memory multiprocessor

Computing Closed-Form Stochastic Bounds on Transient Distributions of Markov Chains

Numerical Methods for Structured Markov Chains

On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets

Merging Jacobi and Gauss-Seidel methods for solving Markov chains on computer clusters

The complexity of performance analysis in parallel algorithms and systems

An algorithmic and numerical approach to bound the performance of high speed networks

Parallel randomization for large structured Markov chains