Wiley series on parallel and distributed computing最新文献

筛选
英文 中文
High Performance Heterogeneous Computing 高性能异构计算
Wiley series on parallel and distributed computing Pub Date : 2009-08-03 DOI: 10.1002/9780470508206
Alexey L. Lastovetsky, J. Dongarra
{"title":"High Performance Heterogeneous Computing","authors":"Alexey L. Lastovetsky, J. Dongarra","doi":"10.1002/9780470508206","DOIUrl":"https://doi.org/10.1002/9780470508206","url":null,"abstract":"An analytical overview of the state of the art, open problems, and future trends in heterogeneous parallel and distributed computing This book provides an overview of the ongoing academic research, development, and uses of heterogeneous parallel and distributed computing in the context of scientific computing. Presenting the state of the art in this challenging and rapidly evolving area, the book is organized in five distinct parts: Heterogeneous Platforms: Taxonomy, Typical Uses, and Programming Issues Performance Models of Heterogeneous Platforms and Design ofHeterogeneous Algorithms Performance: Implementation and Software Applications Future Trends High Performance Heterogeneous Computing is a valuablereference for researchers and practitioners in the area of high performance heterogeneous computing. It also serves as an excellent supplemental text for graduate and postgraduate courses in related areas.","PeriodicalId":391237,"journal":{"name":"Wiley series on parallel and distributed computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121661471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 52
Task Scheduling for Parallel Systems 并行系统的任务调度
Wiley series on parallel and distributed computing Pub Date : 2007-05-04 DOI: 10.1002/0470121173
O. Sinnen
{"title":"Task Scheduling for Parallel Systems","authors":"O. Sinnen","doi":"10.1002/0470121173","DOIUrl":"https://doi.org/10.1002/0470121173","url":null,"abstract":"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. 2.5 Dependence Analysis. 2.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. 3.5.2 Motivations and Limitations. 3.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. 5.2.1 Phase Two. 5.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 alpha|beta|gamma Classification. 6.4.2 Without Communication Costs. 6.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. 7.3.1 Scheduling Edge on Route. 7.3.2 The Edge Scheduling. 7.4 Contention Aware Scheduling. 7.4.1 Basics. 7.4.2 NP","PeriodicalId":391237,"journal":{"name":"Wiley series on parallel and distributed computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114177044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 363
Design and analysis of distributed algorithms 分布式算法的设计与分析
Wiley series on parallel and distributed computing Pub Date : 2006-10-27 DOI: 10.1002/0470072644
N. Santoro
{"title":"Design and analysis of distributed algorithms","authors":"N. Santoro","doi":"10.1002/0470072644","DOIUrl":"https://doi.org/10.1002/0470072644","url":null,"abstract":"Preface. 1. Distributed Computing Environments. 1.1 Entities. 1.2 Communication. 1.3 Axioms and Restrictions. 1.3.1 Axioms. 1.3.2 Restrictions. 1.4 Cost and Complexity. 1.4.1 Amount of Communication Activities. 1.4.2 Time. 1.5 An Example: Broadcasting. 1.6 States and Events. 1.6.1 Time and Events. 1.6.2 States and Configurations. 1.7 Problems and Solutions (). 1.8 Knowledge. 1.8.1 Levels of Knowledge. 1.8.2 Types of Knowledge. 1.9 Technical Considerations. 1.9.1 Messages. 1.9.2 Protocol. 1.9.3 Communication Mechanism. 1.10 Summary of Definitions. 1.11 Bibliographical Notes. 1.12 Exercises, Problems, and Answers. 1.12.1 Exercises and Problems. 1.12.2 Answers to Exercises. 2. Basic Problems And Protocols. 2.1 Broadcast. 2.1.1 The Problem. 2.1.2 Cost of Broadcasting. 2.1.3 Broadcasting in Special Networks. 2.2 Wake-Up. 2.2.1 Generic Wake-Up. 2.2.2 Wake-Up in Special Networks. 2.3 Traversal. 2.3.1 Depth-First Traversal. 2.3.2 Hacking (). 2.3.3 Traversal in Special Networks. 2.3.4 Considerations on Traversal. 2.4 Practical Implications: Use a Subnet. 2.5 Constructing a Spanning Tree. 2.5.1 SPT Construction with a Single Initiator: Shout. 2.5.2 Other SPT Constructions with Single Initiator. 2.5.3 Considerations on the Constructed Tree. 2.5.4 Application: Better Traversal. 2.5.5 Spanning-Tree Construction with Multiple Initiators. 2.5.6 Impossibility Result. 2.5.7 SPT with Initial Distinct Values. 2.6 Computations in Trees. 2.6.1 Saturation: A Basic Technique. 2.6.2 Minimum Finding. 2.6.3 Distributed Function Evaluation. 2.6.4 Finding Eccentricities. 2.6.5 Center Finding. 2.6.6 Other Computations. 2.6.7 Computing in Rooted Trees. 2.7 Summary. 2.7.1 Summary of Problems. 2.7.2 Summary of Techniques. 2.8 Bibliographical Notes. 2.9 Exercises, Problems, and Answers. 2.9.1 Exercises. 2.9.2 Problems. 2.9.3 Answers to Exercises. 3. Election. 3.1 Introduction. 3.1.1 Impossibility Result. 3.1.2 Additional Restrictions. 3.1.3 Solution Strategies. 3.2 Election in Trees. 3.3 Election in Rings. 3.3.1 All the Way. 3.3.2 As Far As It Can. 3.3.3 Controlled Distance. 3.3.4 Electoral Stages. 3.3.5 Stages with Feedback. 3.3.6 Alternating Steps. 3.3.7 Unidirectional Protocols. 3.3.8 Limits to Improvements (). 3.3.9 Summary and Lessons. 3.4 Election in Mesh Networks. 3.4.1 Meshes. 3.4.2 Tori. 3.5 Election in Cube Networks. 3.5.1 Oriented Hypercubes. 3.5.2 Unoriented Hypercubes. 3.6 Election in Complete Networks. 3.6.1 Stages and Territory. 3.6.2 Surprising Limitation. 3.6.3 Harvesting the Communication Power. 3.7 Election in Chordal Rings (). 3.7.1 Chordal Rings. 3.7.2 Lower Bounds. 3.8 Universal Election Protocols. 3.8.1 Mega-Merger. 3.8.2 Analysis of Mega-Merger. 3.8.3 YO-YO. 3.8.4 Lower Bounds and Equivalences. 3.9 Bibliographical Notes. 3.10 Exercises, Problems, and Answers. 3.10.1 Exercises. 3.10.2 Problems. 3.10.3 Answers to Exercises. 4. Message Routing and Shortest Paths. 4.1 Introduction. 4.2 Shortest Path Routing. 4.2.1 Gossiping the Network Maps. 4.2.2 Iterative C","PeriodicalId":391237,"journal":{"name":"Wiley series on parallel and distributed computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124617796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 212
Fundamentals of computer organization and architecture 计算机组织和体系结构的基本知识
Wiley series on parallel and distributed computing Pub Date : 2004-12-03 DOI: 10.5860/choice.42-6539
M. Abd-El-Barr, H. El-Rewini
{"title":"Fundamentals of computer organization and architecture","authors":"M. Abd-El-Barr, H. El-Rewini","doi":"10.5860/choice.42-6539","DOIUrl":"https://doi.org/10.5860/choice.42-6539","url":null,"abstract":"Preface.1. Introduction to Computer Systems.1.1. Historical Background.1.2. Architectural Development & Styles.1.3. Technological Development.1.4. Performance Measures.1.5. Summary.Exercises.References and Further Reading.2. Instruction Set Architecture & Design.2.1. Memory Locations and Operations.2.2. Addressing Modes.2.3. Instruction Types.2.4. Programming Examples.2.5. Summary.Exercises.References and Further Reading.3. Assembly Language Programming.3.1. A Simple Machine.3.2. Instructions Mnemonics and Syntax.3.3. Assembler Directives and Commands.3.4. Assembly and Execution of Programs.3.5. Example: The X 86 Family.3.6. Summary.Exercises.References and Further Reading.4. Computer Arithmetic.4.1. Number Systems.4.2. Integer Arithmetic.4.3. Floating Point Arithmetic.4.4. Summary.Exercises.References and Further Readings.5. Processing Unit Design.5.1. CPU Basics.5.2. Register Set.5.3. Data Path.5.4. The CPU Instruction Cycle.5.5. Control Unit.5.6. Summary.Exercises.References.6. Memory System Design I.6.1. Basic Concepts.6.2. Cache Memory.6.3. Summary.Exercises.References and Further Readings.7. Memory System Design II.7.1. Main Memory.7.2. Virtual Memory.7.3. Read-Only Memory.7.4. Summary.Exercises.References and Further Readings.8. Input-Output Design and Organization.8.1. Basic Concepts.8.2. Programmed I/O.8.3. Interrupt-Driven I/O.8.4. Direct Memory Access (DMA).8.5. Busses.8.6. Input-Output Interfaces.8.7. Summary.Exercises.References and Further Readings.9. Pipelining Design Techniques.9.1. General Concepts.9.2. Instruction Pipeline.9.3. Arithmetic pipeline.9.4. Summary.Exercises.References and Further Reading.10. Reduced Instruction Set Computers (RISCs).10.1. RISC/CISC Evolution Cycle.10.2. RISCs Design Principles.10.3. Overlapped Register Windows.10.4. RISCs Versus CISCs.10.5. Pioneer (University) RISC Machines.10.6. Example of Advanced RISC Machines.10.7. Summary.Exercises.References and Further Readings.11. Introduction to Multiprocessors.11.1. Introduction.11.2. Classification of Computer Architectures.11.3. SIMD Schemes.11.4. MIMD Schemes.11.5. Interconnection Networks.11.6. Analysis and Performance Metrics.11. 7. Summary.Exercises.References and Further Readings.Index.","PeriodicalId":391237,"journal":{"name":"Wiley series on parallel and distributed computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123402572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 40
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书