03403nam a22003857a 4500999001700000001000600017003000900023005001700032008004100049010001700090020003100107020002800138040006400166050002400230082001600254100002700270245007100297260004000368300004500408440007400453500002900527504006700556505156300623520028002186526000802466650003202474650005202506650002902558700002802587700003202615852004002647942001202687952015102699952016702850 c39424d3942433629BD-DhAAL20211109102057.0180808t2009 flua b 001 0 eng  a 2008019142 a9781584889458 (alk. paper) a1584889454 (alk. paper) aDLCcDLCdBTCTAdBAKERdYDXCPdC#PdBWXdCDXdDLCdBD-DhAAL00aQA76.642b.C39 200900a005.2752221 aCasanova, Henri92777210aParallel algorithms /cHenri Casanova, Arnaud Legrand, Yves Robert aBoca Raton, FL :bCRC Press,cc2009 axv, 337 pages :billustrations ;c25 cm. 0aChapman & Hall/CRC numerical analysis and scientific computing927773 a"A Chapman & Hall book." aIncludes bibliographical references (pages 323-332) and index. a Preface Models PRAM Model Pointer Jumping Performance Evaluation of PRAM Algorithms Comparison of PRAM Models Sorting Machine Relevance of the PRAM Model Sorting Networks Odd-Even Merge Sort Sorting on a One-Dimensional Network Networking Interconnection Networks Communication Model Case Study: The Unidirectional Ring Case Study: The Hypercube Peer-to-Peer Computing Parallel Algorithms Algorithms on a Ring of Processors Matrix-Vector Multiplication Matrix-Matrix Multiplication A First Look at Stencil Applications LU Factorization A Second Look at Stencil Applications Implementing Logical Topologies Distributed vs. Centralized Implementations Summary of Algorithmic Principles Algorithms on Grids of Processors Logical Two-Dimensional Grid Topologies Communication on a Grid of Processors Matrix Multiplication on a Grid of Processors Two-Dimensional Block Cyclic Data Distribution Load Balancing on Heterogeneous Platforms Load Balancing for One-Dimensional Data Distributions Load Balancing for Two-Dimensional Data Distributions Free Two-Dimensional Partitioning on a Heterogeneous Grid Scheduling Scheduling Introduction Scheduling Task Graphs Solving Pb(â ) Solving Pb(p) Taking Communication Costs into Account Pb(â ) with Communications List Heuristics for Pb(p) with Communications Extension to Heterogeneous Platforms Advanced Scheduling Divisible Load Scheduling Steady-State Scheduling Workflow Scheduling Hyperplane Scheduling (or Scheduling at Compile-Time) Bibliography Index Exercises and Answers appear at the end of each chapter. aFocusing on algorithms for distributed-memory parallel architectures, this book covers theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. aCSE 0aParallel algorithms.927774 0aParallel programming (Computer science).927775 0aComputer science.9424571 aLegrand, Arnaud.9277761 aRobert, Yves,d1938-927777 aAyesha Abed LibrarycGeneral Stacks 2ddccBK 00102ddc4070aBRACULbBRACULcGENd2018-07-29eKarim Internationalg1494.60l0o005.275 CASp3010033629r2018-07-29t1v1494.60w2018-07-29yBK 00102ddc4070aBRACULbBRACULcGENd2018-07-29eKarim Internationalg1494.60l3m24o005.275 CASp3010033630r2026-07-27s2026-05-09t2v1494.60w2018-07-29yBK