From Static Domains to Graph Decomposition for Heterogeneous Cluster Programming

C. B. Navarrete () and E. Anguiano ()
Additional contact information
C. B. Navarrete: Universidad Autónoma de Madrid, Escuela Politécnica Superior
E. Anguiano: Universidad Autónoma de Madrid, Centro de Referencia Linux

A chapter in High Performance Computing on Vector Systems 2009, 2010, pp 123-147 from Springer

Abstract: Abstract In this paper we present the development of two finished projects that have given us enough knowledge to begin with the implementation of a middleware application based on the MPI extension. This ongoing project is also presented in this document. This middleware allow us to dynamically generate a set of domains that fits to the problem to be solved on an heterogeneous cluster. The main goal is to adapt the partitioning to dynamic and unpredictable load changes on the nodes. We want to adapt the architecture to the problem and not the problem to the architecture.

Keywords: Execution Time; Domain Decomposition; Atomic Interaction; Static Domain; Depth First Search (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-03913-3_11

Ordering information: This item can be ordered from
http://www.springer.com/9783642039133

DOI: 10.1007/978-3-642-03913-3_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().