Muutke küpsiste eelistusi

Creativity in Load-Balance Schemes for Multi/Many-Core Heterogeneous Graph Computing: Emerging Research and Opportunities [Kõva köide]

  • Formaat: Hardback, 163 pages, kõrgus x laius: 254x178 mm, kaal: 645 g
  • Ilmumisaeg: 05-Jan-2018
  • Kirjastus: IGI Global
  • ISBN-10: 1522537996
  • ISBN-13: 9781522537991
Teised raamatud teemal:
  • Formaat: Hardback, 163 pages, kõrgus x laius: 254x178 mm, kaal: 645 g
  • Ilmumisaeg: 05-Jan-2018
  • Kirjastus: IGI Global
  • ISBN-10: 1522537996
  • ISBN-13: 9781522537991
Teised raamatud teemal:
Recent years have witnessed the rise of analysis of real-world massive and complex phenomena in graphs; to efficiently solve these large-scale graph problems, it is necessary to exploit high performance computing (HPC), which accelerates the innovation process for discovery and invention of new products and procedures in network science. Creativity in Load-Balance Schemes for Multi/Many-Core Heterogeneous Graph Computing: Emerging Research and Opportunities is a critical scholarly resource that examines trends, challenges, and collaborative processes in emerging fields within complex network analysis. Featuring coverage on a broad range of topics such as high-performance computing, big data, network science, and accelerated network traversal, this book is geared towards data analysts, researchers, students in information communication technology (ICT), program developers, and academics.
Preface vii
Acknowledgment xiv
Section 1
Chapter 1 The Need for HPC Computing in Network Science
1(29)
Chapter 2 Core Kernels for Complex Network Analysis
30(29)
Chapter 3 Accelerated Network Traversal Using Multi/Many-Cores
59(29)
Section 2
Chapter 4 Partitioning of Complex Networks for Heterogeneous Computing
88(25)
Chapter 5 Topology-Aware Load-Balance Schemes for Heterogeneous Graph Processing
113(31)
Chapter 6 Trends and Challenges in Large-Scale HPC Network Analysis
144(27)
Chapter 7 A Case Study on Citation Network Analysis
171(18)
Conclusion 189(4)
Related Readings 193(21)
About the Authors 214(2)
Index 216