Mapping Algorithms Parallel Architectures by Lucas Keny (8 results)

Author
Title
Refine with Advanced Search

Refine your search

  • Books (8)

  • New (8)

to

Custom price range (US$)

to

    • Language: English

      Published by Editorial Academica Espanola, 2011

      3846558575 / 9783846558577

      • Softcover

      Seller: Books Puddle, New York, NY, U.S.A.Books Puddle

      4-star seller
      Contact seller

      Condition: New

      US$ 103.59

      US$ 3.99 shipping 
      Ships within U.S.A.

      Quantity: 4 available

      Condition: New. pp. 140.

    • Language: English

      Published by LAP LAMBERT Academic Publishing, 2011

      3846558575 / 9783846558577

      • Softcover

      Seller: preigu, Osnabrück, Germanypreigu

      5-star seller
      Contact seller

      Condition: New

      US$ 60.36

      US$ 80.28 shipping 
      Ships from Germany to U.S.A.

      Quantity: 5 available

      Taschenbuch. Condition: Neu. Mapping of Algorithms on Parallel Architectures | An emphasis on OTIS models | Keny T. Lucas (u. a.) | Taschenbuch | 140 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846558577 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.

    • Language: English

      Published by LAP LAMBERT Academic Publishing Dez 2011, 2011

      3846558575 / 9783846558577

      • Softcover
      • Print on Demand

      Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.

      5-star seller
      Contact seller

      Condition: New

      US$ 69.70

      US$ 26.38 shipping 
      Ships from Germany to U.S.A.

      Quantity: 2 available

      Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 140 pp. Englisch.

    • Language: English

      Published by Editorial Academica Espanola, 2011

      3846558575 / 9783846558577

      • Softcover
      • Print on Demand

      Seller: Majestic Books, Hounslow, United KingdomMajestic Books

      4-star seller
      Contact seller

      Condition: New

      US$ 103.56

      US$ 8.70 shipping 
      Ships from United Kingdom to U.S.A.

      Quantity: 4 available

      Condition: New. Print on Demand pp. 140 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

    • Language: English

      Published by LAP LAMBERT Academic Publishing, 2011

      3846558575 / 9783846558577

      • Softcover
      • Print on Demand

      Seller: moluna, Greven, Germanymoluna

      5-star seller
      Contact seller

      Condition: New

      US$ 57.30

      US$ 56.19 shipping 
      Ships from Germany to U.S.A.

      Quantity: Over 20 available

      Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Lucas Keny T.Keny T. Lucas is the Principal at Xavier Institute of Polytechnic and Technology, Ranchi, India. He has served various industries and academic institutions for 20 years. Prasanta K. Jana, Professor & Head, CSE, Indian Sc.

    • Language: English

      Published by Editorial Academica Espanola, 2011

      3846558575 / 9783846558577

      • Softcover
      • Print on Demand

      Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios

      4-star seller
      Contact seller

      Condition: New

      US$ 111.57

      US$ 11.41 shipping 
      Ships from Germany to U.S.A.

      Quantity: 4 available

      Condition: New. PRINT ON DEMAND pp. 140.

    • Language: English

      Published by LAP LAMBERT Academic Publishing Dez 2011, 2011

      3846558575 / 9783846558577

      • Softcover
      • Print on Demand

      Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

      5-star seller
      Contact seller

      Condition: New

      US$ 69.70

      US$ 68.81 shipping 
      Ships from Germany to U.S.A.

      Quantity: 1 available

      Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 140 pp. Englisch.

    • Language: English

      Published by LAP LAMBERT Academic Publishing, 2011

      3846558575 / 9783846558577

      • Softcover
      • Print on Demand

      Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

      5-star seller
      Contact seller

      Condition: New

      US$ 69.70

      US$ 70.12 shipping 
      Ships from Germany to U.S.A.

      Quantity: 1 available

      Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.