Mapping Algorithms Parallel Architectures by Lucas Keny (8 results)

Condition: New. pp. 140.

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.

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.

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.

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.

Condition: New. PRINT ON DEMAND pp. 140.

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.

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.