Advertisement

Divide-and-conquer algorithms on two-dimensional meshes

  • Miguel Valero-García
  • Antonio González
  • Luis Díaz de Cerio
  • Dolors Royo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)

Abstract

The Reflecting and Growing mappings have been proposed to map parallel divide-and-conquer algorithms onto two — dimensional meshes. The performance of these mappings has been previously analyzed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh. In such scenario, the Reflecting mapping is optimal for meshes with wormhole routing and the Growing mapping is very close to the optimal for meshes with store-and-forward routing. In this paper we consider a more general scenario in which the parallel divide-and-conquer algorithm can be started at an arbitrary node of the mesh. We propose and approach that is simpler than both the Reflecting and Growing mappings, is optimal for wormhole meshes and better than the Growing mapping for store-and-forward meshes.

Keywords

Parallel Algorithm Average Cost General Scenario Arbitrary Node Binomial Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    González, A., Valero-García, M., Díaz de Cerio L.: Executing Algorithms with Hypercube Topology on Torus Multicomputers. IEEE Transactions on Parallel and Distributed Systems 8 (1995) 803–814CrossRefGoogle Scholar
  2. 2.
    Lo, V., Rajopadhye, S., Telle, J.A.: Parallel Divide and Conquer on Meshes. IEEE Transactions on Parallel and Distributed Systems 10 (1996) 1049–1057CrossRefGoogle Scholar
  3. 3.
    Matic, S.: Emulation of Hypercube Architecture on Nearest-Neighbor Mesh-Connected Processing Elements. IEEE Transactions on Computers 5 (1990) 698–700CrossRefGoogle Scholar
  4. 4.
    Valero-García, M., González, A., Díaz de Cerio, L., Royo, D.: Divide-and-Conquer Algorithms on Two-Dimensional Meshes. Research Report UPC-DAC-1997-30, http://www.ac.upc.es/recerca/reports/INDEX1997DAC.htmlGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Miguel Valero-García
    • 1
  • Antonio González
    • 1
  • Luis Díaz de Cerio
    • 1
  • Dolors Royo
    • 1
  1. 1.Dept. d’Arquitectura de ComputadorsUniversitat Politcnica de CatalunyaBarcelonaSpain

Personalised recommendations