國立高雄大學圖資館 |

Language: English

Back

Sequential and parallel algorithms a...

Sanders, Peter.

Sequential and parallel algorithms and data structuresthe basic toolbox /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Sequential and parallel algorithms and data structuresby Peter Sanders ... [et al.].
Reminder of title:	the basic toolbox /
other author:	Sanders, Peter.
Published:	Cham :Springer International Publishing :2019.
Description:	xv, 509 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Algorithms.
Online resource:	https://doi.org/10.1007/978-3-030-25209-0
ISBN:	9783030252090$q(electronic bk.)

Sequential and parallel algorithms and data structuresthe basic toolbox /
Sequential and parallel algorithms and data structuresthe basic toolbox /[electronic resource] :by Peter Sanders ... [et al.]. - Cham :Springer International Publishing :2019. - xv, 509 p. :ill., digital ;24 cm.

Appetizer: Integer Arithmetic -- Introduction -- Representing Sequences by Arrays and Linked Lists -- Hash Tables and Associative Arrays -- Sorting and Selection -- Priority Queues -- Sorted Sequences -- Graph Representation -- Graph Traversal -- Shortest Paths -- Minimum Spanning Trees -- Generic Approaches to Optimization -- Collective Communication and Computation -- Load Balancing -- App. A, Mathematical Background -- App. B, Computer Architecture Aspects -- App. C, Support for Parallelism in C++ -- App. D, The Message Passing Interface (MPI) -- App. E, List of Commercial Products, Trademarks and Licenses.

This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shift towards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms. The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java.

ISBN: 9783030252090$q(electronic bk.)

Standard No.: 10.1007/978-3-030-25209-0doiSubjects--Topical Terms:

184661
Algorithms.

LC Class. No.: QA76.6 / .S35 2019

Dewey Class. No.: 005.1

Sequential and parallel algorithms and data structuresthe basic toolbox /
LDR:03537nmm a2200325 a 4500 001 586748
003 DE-He213
005 20200704152438.0
006 m d
007 cr nn 008maaau
008 210326s2019 sz s 0 eng d
020 $a 9783030252090$q(electronic bk.)
020 $a 9783030252083$q(paper)
024 7 $a 10.1007/978-3-030-25209-0 $2 doi
035 $a 978-3-030-25209-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.6 $b .S35 2019
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.6 $b .S479 2019
245 0 0 $a Sequential and parallel algorithms and data structures $h [electronic resource] : $b the basic toolbox / $c by Peter Sanders ... [et al.].
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xv, 509 p. : $b ill., digital ; $c 24 cm.
505 0 $a Appetizer: Integer Arithmetic -- Introduction -- Representing Sequences by Arrays and Linked Lists -- Hash Tables and Associative Arrays -- Sorting and Selection -- Priority Queues -- Sorted Sequences -- Graph Representation -- Graph Traversal -- Shortest Paths -- Minimum Spanning Trees -- Generic Approaches to Optimization -- Collective Communication and Computation -- Load Balancing -- App. A, Mathematical Background -- App. B, Computer Architecture Aspects -- App. C, Support for Parallelism in C++ -- App. D, The Message Passing Interface (MPI) -- App. E, List of Commercial Products, Trademarks and Licenses.
520 $a This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shift towards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms. The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java.
650 0 $a Algorithms. $3 184661
650 0 $a Data structures (Computer science) $3 183917
650 0 $a Computer network architectures. $3 197806
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Processor Architectures. $3 274498
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Data Engineering. $3 839346
650 2 4 $a Mathematics of Algorithmic Complexity. $3 675328
700 1 $a Sanders, Peter. $3 376631
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-3-030-25209-0
950 $a Computer Science (SpringerNature-11645)