Mapping algorithms parallel architectures von lucas keny (8 Ergebnisse)

Autor: 
Titel: 
Mit der Detailsuche verfeinern

Optimieren Sie Ihre Suche

  • Bücher (8)

  • Neu (8)

bis

Benutzerdefinierte Preisspanne (EUR)

bis

  • Sprache: Englisch

    Verlag: Editorial Academica Espanola, 2011

    3846558575 / 9783846558577

    • Softcover

    Anbieter: Books Puddle, Woodside, NY, USABooks Puddle

    Verkäufer/-in mit 4 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 94,62

    EUR 3,51 Versand 
    Versand innerhalb von USA

    Anzahl: 4 verfügbar

    Zustand: New. pp. 140.

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing, 2011

    3846558575 / 9783846558577

    • Softcover

    Anbieter: preigu, Osnabrück, Deutschlandpreigu

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 51,10

    EUR 70,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 5 verfügbar

    Taschenbuch. Zustand: 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. …

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing Dez 2011, 2011

    3846558575 / 9783846558577

    • Softcover
    • Print-on-Demand

    Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 59,00

    EUR 23,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 2 verfügbar

    Taschenbuch. Zustand: 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.…

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing, 2011

    3846558575 / 9783846558577

    • Softcover
    • Print-on-Demand

    Anbieter: moluna, Greven, Deutschlandmoluna

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 48,50

    EUR 48,99 Versand 
    Versand von Deutschland nach USA

    Anzahl: Mehr als 20 verfügbar

    Zustand: 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.…

  • Sprache: Englisch

    Verlag: Editorial Academica Espanola, 2011

    3846558575 / 9783846558577

    • Softcover
    • Print-on-Demand

    Anbieter: Majestic Books, Hounslow, Vereinigtes KönigreichMajestic Books

    Verkäufer/-in mit 4 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 95,62

    EUR 7,58 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 4 verfügbar

    Zustand: 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.

  • Sprache: Englisch

    Verlag: Editorial Academica Espanola, 2011

    3846558575 / 9783846558577

    • Softcover
    • Print-on-Demand

    Anbieter: Biblios, frankfurt am main, HESSE, DeutschlandBiblios

    Verkäufer/-in mit 4 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 96,18

    EUR 9,95 Versand 
    Versand von Deutschland nach USA

    Anzahl: 4 verfügbar

    Zustand: New. PRINT ON DEMAND pp. 140.

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing Dez 2011, 2011

    3846558575 / 9783846558577

    • Softcover
    • Print-on-Demand

    Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 59,00

    EUR 60,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 1 verfügbar

    Taschenbuch. Zustand: 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.…

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing, 2011

    3846558575 / 9783846558577

    • Softcover
    • Print-on-Demand

    Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 59,00

    EUR 61,14 Versand 
    Versand von Deutschland nach USA

    Anzahl: 1 verfügbar

    Taschenbuch. Zustand: 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.…