Kronecker descriptor partitioning for parallel algorithms

R.M. Czekster, C.A.F. De Rose, P. Fernandes, A.M. De Lima, T. Webber

Research output: Chapter in Book/Published conference outputConference publication

Abstract

The key operation to obtain stationary and transient solutions of transition systems described by Kronecker structured formalisms is the Vector-Descriptor product. This operation is usually performed with shuffling operations and matrices aggregations to reduce the floating point multiplications inside iterative methods. Due to the flexibility of the Split method treating Kronecker product terms, it is a natural alternative to decompose descriptors within parallel environments. The main problem is to define the correct task size to assign to each node and also the shared memory size, since sending a small task per time can lead to a larger communication overhead. In this paper we are investigating data partitioning strategies for a parallel solution of transition systems obtained from Kronecker descriptors using the Split algorithm.
Original languageEnglish
Title of host publicationSpring Simulation Multiconference 2010, SpringSim'10
PublisherACM
Number of pages4
ISBN (Print)978-1-4503-0069-8
DOIs
Publication statusPublished - 1 Apr 2010

Fingerprint

Dive into the research topics of 'Kronecker descriptor partitioning for parallel algorithms'. Together they form a unique fingerprint.

Cite this