LEADER 05485nam 2200673 a 450 001 9910143405503321 005 20170809162044.0 010 $a1-280-90109-8 010 $a9786610901098 010 $a0-470-12117-3 010 $a0-470-12116-5 035 $a(CKB)1000000000355070 035 $a(EBL)297311 035 $a(OCoLC)476071527 035 $a(SSID)ssj0000255638 035 $a(PQKBManifestationID)11195823 035 $a(PQKBTitleCode)TC0000255638 035 $a(PQKBWorkID)10217254 035 $a(PQKB)11514517 035 $a(MiAaPQ)EBC297311 035 $a(EXLCZ)991000000000355070 100 $a20061103d2007 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aTask scheduling for parallel systems$b[electronic resource] /$fOliver Sinnen 210 $aHoboken, N.J. $cWiley-Interscience$dc2007 215 $a1 online resource (314 p.) 225 1 $aWiley series on parallel and distributed computing 300 $aDescription based upon print version of record. 311 $a0-471-73576-0 320 $aIncludes bibliographical references (p. 269-280) and indexes. 327 $aTASK SCHEDULING FOR PARALLEL SYSTEMS; CONTENTS; Preface; Acknowledgments; 1. Introduction; 1.1 Overview; 1.2 Organization; 2. Parallel Systems and Programming; 2.1 Parallel Architectures; 2.1.1 Flynn's Taxonomy; 2.1.2 Memory Architectures; 2.1.3 Programming Paradigms and Models; 2.2 Communication Networks; 2.2.1 Static Networks; 2.2.2 Dynamic Networks; 2.3 Parallelization; 2.4 Subtask Decomposition; 2.4.1 Concurrency and Granularity; 2.4.2 Decomposition Techniques; 2.4.3 Computation Type and Program Formulation; 2.4.4 Parallelization Techniques; 2.4.5 Target Parallel System 327 $a2.5 Dependence Analysis2.5.1 Data Dependence; 2.5.2 Data Dependence in Loops; 2.5.3 Control Dependence; 2.6 Concluding Remarks; 2.7 Exercises; 3. Graph Representations; 3.1 Basic Graph Concepts; 3.1.1 Computer Representation of Graphs; 3.1.2 Elementary Graph Algorithms; 3.2 Graph as a Program Model; 3.2.1 Computation and Communication Costs; 3.2.2 Comparison Criteria; 3.3 Dependence Graph (DG); 3.3.1 Iteration Dependence Graph; 3.3.2 Summary; 3.4 Flow Graph (FG); 3.4.1 Data-Driven Execution Model; 3.4.2 Summary; 3.5 Task Graph (DAG); 3.5.1 Graph Transformations and Conversions 327 $a3.5.2 Motivations and Limitations3.5.3 Summary; 3.6 Concluding Remarks; 3.7 Exercises; 4. Task Scheduling; 4.1 Fundamentals; 4.2 With Communication Costs; 4.2.1 Schedule Example; 4.2.2 Scheduling Complexity; 4.3 Without Communication Costs; 4.3.1 Schedule Example; 4.3.2 Scheduling Complexity; 4.4 Task Graph Properties; 4.4.1 Critical Path; 4.4.2 Node Levels; 4.4.3 Granularity; 4.5 Concluding Remarks; 4.6 Exercises; 5. Fundamental Heuristics; 5.1 List Scheduling; 5.1.1 Start Time Minimization; 5.1.2 With Dynamic Priorities; 5.1.3 Node Priorities; 5.2 Scheduling with Given Processor Allocation 327 $a5.2.1 Phase Two5.3 Clustering; 5.3.1 Clustering Algorithms; 5.3.2 Linear Clustering; 5.3.3 Single Edge Clustering; 5.3.4 List Scheduling as Clustering; 5.3.5 Other Algorithms; 5.4 From Clustering to Scheduling; 5.4.1 Assigning Clusters to Processors; 5.4.2 Scheduling on Processors; 5.5 Concluding Remarks; 5.6 Exercises; 6. Advanced Task Scheduling; 6.1 Insertion Technique; 6.1.1 List Scheduling with Node Insertion; 6.2 Node Duplication; 6.2.1 Node Duplication Heuristics; 6.3 Heterogeneous Processors; 6.3.1 Scheduling; 6.4 Complexity Results; 6.4.1 ?|?|? Classification 327 $a6.4.2 Without Communication Costs6.4.3 With Communication Costs; 6.4.4 With Node Duplication; 6.4.5 Heterogeneous Processors; 6.5 Genetic Algorithms; 6.5.1 Basics; 6.5.2 Chromosomes; 6.5.3 Reproduction; 6.5.4 Selection, Complexity, and Flexibility; 6.6 Concluding Remarks; 6.7 Exercises; 7. Communication Contention in Scheduling; 7.1 Contention Awareness; 7.1.1 End-Point Contention; 7.1.2 Network Contention; 7.1.3 Integrating End-Point and Network Contention; 7.2 Network Model; 7.2.1 Topology Graph; 7.2.2 Routing; 7.2.3 Scheduling Network Model; 7.3 Edge Scheduling 327 $a7.3.1 Scheduling Edge on Route 330 $aA new model for task scheduling that dramatically improves the efficiency of parallel systems Task scheduling for parallel systems can become a quagmire of heuristics, models, and methods that have been developed over the past decades. The author of this innovative text cuts through the confusion and complexity by presenting a consistent and comprehensive theoretical framework along with realistic parallel system models. These new models, based on an investigation of the concepts and principles underlying task scheduling, take into account heterogeneity, contention for communication r 410 0$aWiley series on parallel and distributed computing. 606 $aParallel processing (Electronic computers) 606 $aComputer multitasking 606 $aComputer scheduling 608 $aElectronic books. 615 0$aParallel processing (Electronic computers) 615 0$aComputer multitasking. 615 0$aComputer scheduling. 676 $a004.35 676 $a004/.35 700 $aSinnen$b Oliver$f1971-$0983995 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143405503321 996 $aTask scheduling for parallel systems$92246805 997 $aUNINA