A tensor sum preconditioner for stochastic automata networks

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Stochastic automata networks (SANs) have gained great interest within the performance-modeling community because of their natural ability to capture parallel and distributed activities. SANs and the related concept of stochastic process algebra are advantageous because they keep the transition matrix in a compact form called the SAN descriptor. Several iterative and projection methods have been tested for SANs. Some preconditioners for SANs have been developed to speed up the convergence. Recently, Langville and Stewart [Langville, A., W. Stewart. 2004. A Kronecker product approximate preconditioner for SANs. Numer. Linear Algebra Appl. 11 723-752] proposed the nearest Kronecker product (NKP) preconditioner for SANs with great success. Encouraged by their work, we propose a new preconditioning method, called the tensor sum preconditioner (TSP), which uses a tensor sum preconditioner rather than a Kronecker product preconditioner. In TSP, we take into account as much as possible the effect of synchronization using term grouping, factorizations, and approximation techniques. We conducted an experimental study to compare our TSP with the NKP preconditioner, and the results show that TSP outperformed NKP on both the number of iterations and the execution time.

Original languageEnglish
Pages (from-to)234-242
Number of pages9
JournalINFORMS Journal on Computing
Volume20
Issue number2
DOIs
Publication statusPublished - Mar 2008

Fingerprint

Tensors
Linear algebra
Random processes
Factorization
Algebra
Synchronization
Automata

Keywords

  • Markovian models
  • Nearest kronecker product
  • Performance evaluation
  • Preconditioning
  • Stochastic automata networks

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Science Applications
  • Management Science and Operations Research

Cite this

A tensor sum preconditioner for stochastic automata networks. / Touzene, Abderezak.

In: INFORMS Journal on Computing, Vol. 20, No. 2, 03.2008, p. 234-242.

Research output: Contribution to journalArticle

@article{d5ea8f50455f460693aa92907c4bd977,
title = "A tensor sum preconditioner for stochastic automata networks",
abstract = "Stochastic automata networks (SANs) have gained great interest within the performance-modeling community because of their natural ability to capture parallel and distributed activities. SANs and the related concept of stochastic process algebra are advantageous because they keep the transition matrix in a compact form called the SAN descriptor. Several iterative and projection methods have been tested for SANs. Some preconditioners for SANs have been developed to speed up the convergence. Recently, Langville and Stewart [Langville, A., W. Stewart. 2004. A Kronecker product approximate preconditioner for SANs. Numer. Linear Algebra Appl. 11 723-752] proposed the nearest Kronecker product (NKP) preconditioner for SANs with great success. Encouraged by their work, we propose a new preconditioning method, called the tensor sum preconditioner (TSP), which uses a tensor sum preconditioner rather than a Kronecker product preconditioner. In TSP, we take into account as much as possible the effect of synchronization using term grouping, factorizations, and approximation techniques. We conducted an experimental study to compare our TSP with the NKP preconditioner, and the results show that TSP outperformed NKP on both the number of iterations and the execution time.",
keywords = "Markovian models, Nearest kronecker product, Performance evaluation, Preconditioning, Stochastic automata networks",
author = "Abderezak Touzene",
year = "2008",
month = "3",
doi = "10.1287/ijoc.1070.0236",
language = "English",
volume = "20",
pages = "234--242",
journal = "INFORMS Journal on Computing",
issn = "1091-9856",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "2",

}

TY - JOUR

T1 - A tensor sum preconditioner for stochastic automata networks

AU - Touzene, Abderezak

PY - 2008/3

Y1 - 2008/3

N2 - Stochastic automata networks (SANs) have gained great interest within the performance-modeling community because of their natural ability to capture parallel and distributed activities. SANs and the related concept of stochastic process algebra are advantageous because they keep the transition matrix in a compact form called the SAN descriptor. Several iterative and projection methods have been tested for SANs. Some preconditioners for SANs have been developed to speed up the convergence. Recently, Langville and Stewart [Langville, A., W. Stewart. 2004. A Kronecker product approximate preconditioner for SANs. Numer. Linear Algebra Appl. 11 723-752] proposed the nearest Kronecker product (NKP) preconditioner for SANs with great success. Encouraged by their work, we propose a new preconditioning method, called the tensor sum preconditioner (TSP), which uses a tensor sum preconditioner rather than a Kronecker product preconditioner. In TSP, we take into account as much as possible the effect of synchronization using term grouping, factorizations, and approximation techniques. We conducted an experimental study to compare our TSP with the NKP preconditioner, and the results show that TSP outperformed NKP on both the number of iterations and the execution time.

AB - Stochastic automata networks (SANs) have gained great interest within the performance-modeling community because of their natural ability to capture parallel and distributed activities. SANs and the related concept of stochastic process algebra are advantageous because they keep the transition matrix in a compact form called the SAN descriptor. Several iterative and projection methods have been tested for SANs. Some preconditioners for SANs have been developed to speed up the convergence. Recently, Langville and Stewart [Langville, A., W. Stewart. 2004. A Kronecker product approximate preconditioner for SANs. Numer. Linear Algebra Appl. 11 723-752] proposed the nearest Kronecker product (NKP) preconditioner for SANs with great success. Encouraged by their work, we propose a new preconditioning method, called the tensor sum preconditioner (TSP), which uses a tensor sum preconditioner rather than a Kronecker product preconditioner. In TSP, we take into account as much as possible the effect of synchronization using term grouping, factorizations, and approximation techniques. We conducted an experimental study to compare our TSP with the NKP preconditioner, and the results show that TSP outperformed NKP on both the number of iterations and the execution time.

KW - Markovian models

KW - Nearest kronecker product

KW - Performance evaluation

KW - Preconditioning

KW - Stochastic automata networks

UR - http://www.scopus.com/inward/record.url?scp=61349116127&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=61349116127&partnerID=8YFLogxK

U2 - 10.1287/ijoc.1070.0236

DO - 10.1287/ijoc.1070.0236

M3 - Article

VL - 20

SP - 234

EP - 242

JO - INFORMS Journal on Computing

JF - INFORMS Journal on Computing

SN - 1091-9856

IS - 2

ER -