國立虎尾科技大學 |

Distributed Graph Analytics = Programming, Languages, and Their Compilation /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Distributed Graph Analytics/ by Unnikrishnan Cheramangalath, Rupesh Nasre, Y. N. Srikant.
其他題名:	Programming, Languages, and Their Compilation /
作者:	Cheramangalath, Unnikrishnan.
其他作者:	Srikant, Y. N.
面頁冊數:	XI, 207 p. 44 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Discrete Mathematics in Computer Science. -
電子資源:	https://doi.org/10.1007/978-3-030-41886-1
ISBN:	9783030418861

Distributed Graph Analytics = Programming, Languages, and Their Compilation /
Cheramangalath, Unnikrishnan.

Distributed Graph AnalyticsProgramming, Languages, and Their Compilation /[electronic resource] :by Unnikrishnan Cheramangalath, Rupesh Nasre, Y. N. Srikant. - 1st ed. 2020. - XI, 207 p. 44 illus.online resource.

Introduction to Graph Analytics -- Graph Algorithms and Applications -- Efficient Parallel Implementation of Graph Algorithms -- Graph Analytics Frameworks -- GPU Architecture and Programming Challenges -- Dynamic Graph Algorithms -- Falcon: A Domain Specific Language for Graph Analytics -- Experiments, Evaluation and Future Directions.

This book brings together two important trends: graph algorithms and high-performance computing. Efficient and scalable execution of graph processing applications in data or network analysis requires innovations at multiple levels: algorithms, associated data structures, their implementation and tuning to a particular hardware. Further, programming languages and the associated compilers play a crucial role when it comes to automating efficient code generation for various architectures. This book discusses the essentials of all these aspects. The book is divided into three parts: programming, languages, and their compilation. The first part examines the manual parallelization of graph algorithms, revealing various parallelization patterns encountered, especially when dealing with graphs. The second part uses these patterns to provide language constructs that allow a graph algorithm to be specified. Programmers can work with these language constructs without worrying about their implementation, which is the focus of the third part. Implementation is handled by a compiler, which can specialize code generation for a backend device. The book also includes suggestive results on different platforms, which illustrate and justify the theory and practice covered. Together, the three parts provide the essential ingredients for creating a high-performance graph application. The book ends with a section on future directions, which offers several pointers to promising topics for future research. This book is intended for new researchers as well as graduate and advanced undergraduate students. Most of the chapters can be read independently by those familiar with the basics of parallel programming and graph algorithms. However, to make the material more accessible, the book includes a brief background on elementary graph algorithms, parallel computing and GPUs. Moreover it presents a case study using Falcon, a domain-specific language for graph algorithms, to illustrate the concepts.

ISBN: 9783030418861

Standard No.: 10.1007/978-3-030-41886-1doiSubjects--Topical Terms:

670123
Discrete Mathematics in Computer Science.

LC Class. No.: QA76.758

Dewey Class. No.: 005.1

Distributed Graph Analytics = Programming, Languages, and Their Compilation /
LDR:03723nam a22003975i 4500 001 1027946
003 DE-He213
005 20200630101818.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030418861 $9 978-3-030-41886-1
024 7 $a 10.1007/978-3-030-41886-1 $2 doi
035 $a 978-3-030-41886-1
050 4 $a QA76.758
072 7 $a UMZ $2 bicssc
072 7 $a COM051230 $2 bisacsh
072 7 $a UMZ $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Cheramangalath, Unnikrishnan. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1324454
245 1 0 $a Distributed Graph Analytics $h [electronic resource] : $b Programming, Languages, and Their Compilation / $c by Unnikrishnan Cheramangalath, Rupesh Nasre, Y. N. Srikant.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XI, 207 p. 44 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Introduction to Graph Analytics -- Graph Algorithms and Applications -- Efficient Parallel Implementation of Graph Algorithms -- Graph Analytics Frameworks -- GPU Architecture and Programming Challenges -- Dynamic Graph Algorithms -- Falcon: A Domain Specific Language for Graph Analytics -- Experiments, Evaluation and Future Directions.
520 $a This book brings together two important trends: graph algorithms and high-performance computing. Efficient and scalable execution of graph processing applications in data or network analysis requires innovations at multiple levels: algorithms, associated data structures, their implementation and tuning to a particular hardware. Further, programming languages and the associated compilers play a crucial role when it comes to automating efficient code generation for various architectures. This book discusses the essentials of all these aspects. The book is divided into three parts: programming, languages, and their compilation. The first part examines the manual parallelization of graph algorithms, revealing various parallelization patterns encountered, especially when dealing with graphs. The second part uses these patterns to provide language constructs that allow a graph algorithm to be specified. Programmers can work with these language constructs without worrying about their implementation, which is the focus of the third part. Implementation is handled by a compiler, which can specialize code generation for a backend device. The book also includes suggestive results on different platforms, which illustrate and justify the theory and practice covered. Together, the three parts provide the essential ingredients for creating a high-performance graph application. The book ends with a section on future directions, which offers several pointers to promising topics for future research. This book is intended for new researchers as well as graduate and advanced undergraduate students. Most of the chapters can be read independently by those familiar with the basics of parallel programming and graph algorithms. However, to make the material more accessible, the book includes a brief background on elementary graph algorithms, parallel computing and GPUs. Moreover it presents a case study using Falcon, a domain-specific language for graph algorithms, to illustrate the concepts.
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 1 4 $a Software Engineering. $3 669632
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Software engineering. $3 562952
700 1 $a Srikant, Y. N. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1324456
700 1 $a Nasre, Rupesh. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1324455
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030418854
776 0 8 $i Printed edition: $z 9783030418878
776 0 8 $i Printed edition: $z 9783030418885
856 4 0 $u https://doi.org/10.1007/978-3-030-41886-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)