國立虎尾科技大學 |

Introduction to HPC with MPI for Data Science

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Introduction to HPC with MPI for Data Science/ by Frank Nielsen.
Author:	Nielsen, Frank.
Description:	XXXIII, 282 p. 101 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer programming. -
Online resource:	https://doi.org/10.1007/978-3-319-21903-5
ISBN:	9783319219035

Introduction to HPC with MPI for Data Science
Nielsen, Frank.

Introduction to HPC with MPI for Data Science[electronic resource] /by Frank Nielsen. - 1st ed. 2016. - XXXIII, 282 p. 101 illus. in color.online resource. - Undergraduate Topics in Computer Science,1863-7310. - Undergraduate Topics in Computer Science,.

Preface -- Part 1: High Performance Computing (HPC) with the Message Passing Interface (MPI) -- A Glance at High Performance Computing (HPC) -- Introduction to MPI: The Message Passing Interface -- Topology of Interconnection Networks -- Parallel Sorting -- Parallel Linear Algebra.-The MapReduce Paradigm -- Part 11: High Performance Computing for Data Science -- Partition-based Clustering with k means -- Hierarchical Clustering -- Supervised Learning: Practice and Theory of Classification with k NN rule -- Fast Approximate Optimization to High Dimensions with Core-sets and Fast Dimension Reduction -- Parallel Algorithms for Graphs -- Appendix A: Written Exam -- Appendix B: SLURM: A resource manager and job scheduler on clusters of machines -- Appendix C: List of Figures -- Appendix D: List of Tables -- Appendix E: Index.

This gentle introduction to High Performance Computing (HPC) for Data Science using the Message Passing Interface (MPI) standard has been designed as a first course for undergraduates on parallel programming on distributed memory models, and requires only basic programming notions. Divided into two parts the first part covers high performance computing using C++ with the Message Passing Interface (MPI) standard followed by a second part providing high-performance data analytics on computer clusters. In the first part, the fundamental notions of blocking versus non-blocking point-to-point communications, global communications (like broadcast or scatter) and collaborative computations (reduce), with Amdalh and Gustafson speed-up laws are described before addressing parallel sorting and parallel linear algebra on computer clusters. The common ring, torus and hypercube topologies of clusters are then explained and global communication procedures on these topologies are studied. This first part closes with the MapReduce (MR) model of computation well-suited to processing big data using the MPI framework. In the second part, the book focuses on high-performance data analytics. Flat and hierarchical clustering algorithms are introduced for data exploration along with how to program these algorithms on computer clusters, followed by machine learning classification, and an introduction to graph analytics. This part closes with a concise introduction to data core-sets that let big data problems be amenable to tiny data problems. Exercises are included at the end of each chapter in order for students to practice the concepts learned, and a final section contains an overall exam which allows them to evaluate how well they have assimilated the material covered in the book.

ISBN: 9783319219035

Standard No.: 10.1007/978-3-319-21903-5doiSubjects--Topical Terms:

527822
Computer programming.

LC Class. No.: QA76.6-76.66

Dewey Class. No.: 005.11

Introduction to HPC with MPI for Data Science
LDR:03970nam a22003975i 4500 001 978776
003 DE-He213
005 20200629115519.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319219035 $9 978-3-319-21903-5
024 7 $a 10.1007/978-3-319-21903-5 $2 doi
035 $a 978-3-319-21903-5
050 4 $a QA76.6-76.66
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
082 0 4 $a 005.11 $2 23
100 1 $a Nielsen, Frank. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 897551
245 1 0 $a Introduction to HPC with MPI for Data Science $h [electronic resource] / $c by Frank Nielsen.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XXXIII, 282 p. 101 illus. in color. $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
490 1 $a Undergraduate Topics in Computer Science, $x 1863-7310
505 0 $a Preface -- Part 1: High Performance Computing (HPC) with the Message Passing Interface (MPI) -- A Glance at High Performance Computing (HPC) -- Introduction to MPI: The Message Passing Interface -- Topology of Interconnection Networks -- Parallel Sorting -- Parallel Linear Algebra.-The MapReduce Paradigm -- Part 11: High Performance Computing for Data Science -- Partition-based Clustering with k means -- Hierarchical Clustering -- Supervised Learning: Practice and Theory of Classification with k NN rule -- Fast Approximate Optimization to High Dimensions with Core-sets and Fast Dimension Reduction -- Parallel Algorithms for Graphs -- Appendix A: Written Exam -- Appendix B: SLURM: A resource manager and job scheduler on clusters of machines -- Appendix C: List of Figures -- Appendix D: List of Tables -- Appendix E: Index.
520 $a This gentle introduction to High Performance Computing (HPC) for Data Science using the Message Passing Interface (MPI) standard has been designed as a first course for undergraduates on parallel programming on distributed memory models, and requires only basic programming notions. Divided into two parts the first part covers high performance computing using C++ with the Message Passing Interface (MPI) standard followed by a second part providing high-performance data analytics on computer clusters. In the first part, the fundamental notions of blocking versus non-blocking point-to-point communications, global communications (like broadcast or scatter) and collaborative computations (reduce), with Amdalh and Gustafson speed-up laws are described before addressing parallel sorting and parallel linear algebra on computer clusters. The common ring, torus and hypercube topologies of clusters are then explained and global communication procedures on these topologies are studied. This first part closes with the MapReduce (MR) model of computation well-suited to processing big data using the MPI framework. In the second part, the book focuses on high-performance data analytics. Flat and hierarchical clustering algorithms are introduced for data exploration along with how to program these algorithms on computer clusters, followed by machine learning classification, and an introduction to graph analytics. This part closes with a concise introduction to data core-sets that let big data problems be amenable to tiny data problems. Exercises are included at the end of each chapter in order for students to practice the concepts learned, and a final section contains an overall exam which allows them to evaluate how well they have assimilated the material covered in the book.
650 0 $a Computer programming. $3 527822
650 1 4 $a Programming Techniques. $3 669781
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319219028
776 0 8 $i Printed edition: $z 9783319219042
830 0 $a Undergraduate Topics in Computer Science, $x 1863-7310 $3 1254738
856 4 0 $u https://doi.org/10.1007/978-3-319-21903-5
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)