Advertisement

Models for Parallel and Distributed Computation

Theory, Algorithmic Techniques and Applications

  • Ricardo Corrêa
  • Inês Dutra
  • Mario Fiallos
  • Fernando Gomes

Part of the Applied Optimization book series (APOP, volume 67)

Table of contents

  1. Front Matter
    Pages i-xx
  2. Models of Parallel Computation

    1. Front Matter
      Pages 1-1
    2. Valmir C. Barbosa
      Pages 27-52
    3. Cristina Boeres, Vinod E. F. Rebello
      Pages 53-84
    4. D. B. Skillicorn
      Pages 85-115
    5. Afonso Ferreira, Isabelle Guérin-Lassous
      Pages 117-143
  3. Parallel Applications

    1. Front Matter
      Pages 145-145
    2. Sandra Duni Ekşiog̃lu, Panos M. Pardalos, Mauricio G. C. Resende
      Pages 179-206
    3. Cláudio F. R. Geyer, Patrícia Kayser Vargas, Inês de Castro Dutra
      Pages 207-241
    4. Benjamín Barán
      Pages 243-277
  4. Back Matter
    Pages 315-323

About this book

Introduction

Parallel and distributed computation has been gaining a great lot of attention in the last decades. During this period, the advances attained in computing and communication technologies, and the reduction in the costs of those technolo­ gies, played a central role in the rapid growth of the interest in the use of parallel and distributed computation in a number of areas of engineering and sciences. Many actual applications have been successfully implemented in various plat­ forms varying from pure shared-memory to totally distributed models, passing through hybrid approaches such as distributed-shared memory architectures. Parallel and distributed computation differs from dassical sequential compu­ tation in some of the following major aspects: the number of processing units, independent local dock for each unit, the number of memory units, and the programming model. For representing this diversity, and depending on what level we are looking at the problem, researchers have proposed some models to abstract the main characteristics or parameters (physical components or logical mechanisms) of parallel computers. The problem of establishing a suitable model is to find a reasonable trade-off among simplicity, power of expression and universality. Then, be able to study and analyze more precisely the behavior of parallel applications.

Keywords

Scheduling algorithms combinatorial optimization complexity computer computer science logic logic programming numerical methods optimization programming

Editors and affiliations

  • Ricardo Corrêa
    • 1
  • Inês Dutra
    • 2
  • Mario Fiallos
    • 1
  • Fernando Gomes
    • 1
  1. 1.Universidade Federal do CearáBrazil
  2. 2.Universidade Federal do Rio de JaneiroBrazil

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4757-3609-0
  • Copyright Information Springer-Verlag US 2002
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4419-5219-6
  • Online ISBN 978-1-4757-3609-0
  • Series Print ISSN 1384-6485
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
Electronics
IT & Software
Telecommunications