skip to main content

Architectures for an Efficient Application Execution in a Collection of HNOWS

Furtado, A. ; Rebouças, A. ; de Souza, J. R. ; Rexachs, D. ; Luque, E. Kranzlmüller, Dieter ; Volkert, Jens ; Kacsuk, Peter ; Dongarra, Jack

Lecture notes in computer science, 2002, p.450-460 [Periódico revisado por pares]

Berlin, Heidelberg: Springer Berlin Heidelberg

Texto completo disponível

Citações Citado por
  • Título:
    Architectures for an Efficient Application Execution in a Collection of HNOWS
  • Autor: Furtado, A. ; Rebouças, A. ; de Souza, J. R. ; Rexachs, D. ; Luque, E.
  • Kranzlmüller, Dieter ; Volkert, Jens ; Kacsuk, Peter ; Dongarra, Jack
  • Assuntos: Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing
  • É parte de: Lecture notes in computer science, 2002, p.450-460
  • Descrição: To achieve high performance, an efficient task scheduling and load balance model is necessary, our goal is to optimize the execution of parallel algorithms over a Collection of geographically separated Heterogeneous Clusters of Workstations (CoHNOWS). Some architectures are tested and an adaptive Master/Worker model is proposed, where Cluster’s workers are grouped by a sub-master that acts as a single point of control, and a separate machine is used to manage inter-cluster communications over WAN. Due to network latency unpredictability, an algorithm with dynamic data distribution is used, adapting each cluster’s data load. The chosen benchmark algorithm was the Matrix Multiplication, because of its scalability facilities, and the MPI communications library for its portability. The testbed system used is composed of two heterogeneous dedicated clusters (HNOW), one in Spain and the other in Brazil, using a non-dedicated WAN (Internet) as the interconnection network between them.
  • Editor: Berlin, Heidelberg: Springer Berlin Heidelberg
  • Idioma: Inglês

Buscando em bases de dados remotas. Favor aguardar.