Kronecker descriptor partitioning for parallel algorithms

Ricardo M. Czekster, Cesar A.F. De Rose, Paulo Fernandes, Antonio M. De Lima, Thais Webber

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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
DOIs
Publication statusPublished - 2010
Event2010 Spring Simulation Multiconference, SpringSim'10 - Orlando, FL, United States
Duration: 11 Apr 201015 Apr 2010

Publication series

NameSpring Simulation Multiconference 2010, SpringSim'10

Conference

Conference2010 Spring Simulation Multiconference, SpringSim'10
Country/TerritoryUnited States
CityOrlando, FL
Period11/04/1015/04/10

Keywords

  • Data partitioning
  • Kronecker products
  • Parallel algorithms

Fingerprint

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

Cite this