bokomslag Mapping of Algorithms on Parallel Architectures
Data & IT

Mapping of Algorithms on Parallel Architectures

Keny T Lucas Prasanta K Jana

Pocket

1099:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-11 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 140 sidor
  • 2011
This book is very useful for the scholars who are interested in the field of parallel computing at large and specifically in Opto-electronic Interconnection system (OTIS). OTIS has attracted many scientists and researches because of hybrid structure and hierarchical properties and extensive literature is also available. In this book, we have presented various parallel algorithms for problems including Lagrange interpolation, Durand-Kerner root finding, sorting, all-to-all communication, single-source shortest path routing and conflict graph construction on different OTIS models. In mapping these algorithms, intensive data movements are required over the intra-group links (electronic) as well as inter-group links (optical). Therefore, to analyze the time complexity of the proposed algorithms, we count the data movements through the electronic links as electronic moves and through the optical links as OTIS moves. We have also compared our work with the existing algorithms proposed by other scholars. This book will definitely motivate the scholars to explore all possible ways, an algorithm can be mapped on an OTIS model to improve the overall time complexity.
  • Författare: Keny T Lucas, Prasanta K Jana
  • Format: Pocket/Paperback
  • ISBN: 9783846558577
  • Språk: Engelska
  • Antal sidor: 140
  • Utgivningsdatum: 2011-12-05
  • Förlag: LAP Lambert Academic Publishing