The need for and the advantages of generalized tensor algebra for kronecker structured representations

International Journal of Simulation: Systems, Science and Technology

Volumn 6, Issue 3-4, 2005, Pages 15-26

  Brenner, Leonardo ^a   Fernandes, Paulo ^a   Sales, Afonso ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

Numerical methods; Performance evaluation; SAN; SPN; Tensor Algebra

Indexed keywords

AUTOMATA THEORY; NUMERICAL METHODS; PETRI NETS; STOCHASTIC SYSTEMS; TENSORS;

GENERALIZED STOCHASTIC PETRI NETS; GENERALIZED TENSOR ALGEBRAS; KRONECKER REPRESENTATIONS; PERFORMANCE EVALUATION; SAN; SPN; STOCHASTIC AUTOMATA NETWORKS; TENSOR ALGEBRA;

ALGEBRA;

EID: 84925035979     PISSN: 14738031     EISSN: 1473804X     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Benoit, A., Brenner, L., Fernandes, P., and Plateau, B. (2004). Aggregation of Stochastic Automata Networks with replicas. Linear Algebra and its Applications, 386:111-136.
2. Benoit, A., Brenner, L., Fernandes, P., Plateau, B., and Stewart, W. J. (2003). The PEPS Software Tool. In Computer Performance Evaluation/TOOLS 2003, volume 2794 of LNCS, pages 98-115, Urbana, IL, USA. Springer-Verlag Heidelberg.
3. Brenner, L., Fernandes, P., and Sales, A. (2003). Why you should care about Generalized Tensor Algebra. Technical Report TR 037, PUCRS, Porto Alegre. http://www.inf.pucrs.br/tr/tr037.pdf.
4. Buchholz, P., Ciardo, G., Donatelli, S., and Kemper, P. (2000). Complexity of memory-efficientKronecker operationswith applications to the solution of Markov models. INFORMS Journal on Computing, 13(3):203-222.
5. Buchholz, P. and Dayar, T. (2003). Block SOR for Kronecker structured representations. In Proceedings of the 2003 International Conference on the Numerical Solution of Markov Chains, pages 121-143, Urbana, IL, USA.
6. Ciardo, G., Jones, R. L., Miner, A. S., and Siminiceanu, R. (2003). Logical and stochastic modeling with SMART. In Computer Performance Evaluation/TOOLS 2003, volume 2794 of LNCS, pages 78-97, Urbana, IL, USA. Springer-Verlag Heidelberg.
7. Ciardo, G. and Trivedi, K. S. (1991). A Decomposition Approach for Stochastic Petri Nets Models. In Proceedings of the 4th InternationalWorkshop Petri Nets and Performance Models, pages 74-83, Melbourne, Australia. IEEE Computer Society.
8. Davio, M. (1981). Kronecker Products and Shuffle Algebra. IEEE Transactions on Computers, C-30(2):116-125.
9. Donatelli, S. (1994). Superposed generalized stochastic Petri nets: definition and efficient solution. In Valette, R., editor, Proceedings of the 15th International Conference on Applications and Theory of Petri Nets, pages 258-277. Springer-Verlag Heidelberg.
10. Fernandes, P., Plateau, B., and Stewart, W. J. (1998). Efficient descriptor-Vector multiplication in Stochastic Automata Networks. Journal of the ACM, 45(3):381-414.
11. Gilmore, S., Hillston, J., Kloul, L., and Ribaudo, M. (2003). PEPA nets: a structured performancemodelling formalism. Performance Evaluation, 54(2):79-104.
12. Kemper, P. (1996). Numerical Analysis of Superposed GSPNs. IEEE Transactions on Software Engineering, 22(9):615-628.
13. Miner, A. S. and Ciardo, G. (1999a). A data structure for the efficient Kronecker solution of GSPNs. In Proceedings of the 8th International Workshop on Petri Nets and Performance Models, pages 22-31, Zaragoza, Spain.
14. Miner, A. S. and Ciardo, G. (1999b). Efficient Reachability Set Generation and Storage Using Decision Diagrams. In Proceedings of the 15th International Conference on Applications and Theory of Petri Nets, volume 1639 of LNCS, pages 6-25, Williamsburg, VA, USA. Springer-Verlag Heidelberg.
15. Miner, A. S., Ciardo, G., and Donatelli, S. (2000). Using the exact state space of a Markov model to compute approximate stationary measures. In Proceedings of the 2000 ACM SIGMETRICS Conference on Measurements and Modeling of Computer Systems, pages 207-216, Santa Clara, California, USA. ACM Press.
16. Plateau, B. (1985). On the stochastic structure of parallelism and synchronization models for distributed algorithms. In Proceedings of the 1985 ACM SIGMETRICS conference on Measurements and Modeling of Computer Systems, pages 147-154, Austin, Texas, USA. ACM Press.
17. Sanders, W. H. and Meyer, J. F. (1991). Reduced Base Model Construction Methods for Stochastic Activity Networks. IEEE Journal on Selected Areas in Communications, 9(1):25-36.