Parallel And Distributed Computing
- Length: 269 pages
- Edition: 1
- Language: English
- Publication Date: 2021-08-24
- ISBN-10: B09DKS22YL
- ISBN-13: 9798464177437
- Sales Rank: #0 (See Top 100 Books)
This book is an introduction to the complex and emerging world of the Parallel and Distributed Computing. It helps you understand the principles and acquire the practical skills of MPI programming using the C/FORTAN programming language. My aim is for you to gain sufficient knowledge and experience to perform simple useful programming tasks using the best up-to-date techniques and so we hope for it to be the easiest book from which you can learn the basics of MPI programming. It helps you understand the principles, algorithm & implementation of Parallel and Distributed Computing.
This book is emphatically focused on the concept. Understanding the fundamental ideas, principles, and techniques is the essence of a good programmer. Only well-designed code has a chance of becoming part of a correct, reliable, and maintainable parallel system. Through this book, we hope that you will see the absolute necessity of understanding Parallel and Distributed Computing.
I have taken a top-down approach, addressing the issues to be resolved in the design of distributed systems and describing successful approaches in the form of abstract models, algorithms and detailed case studies of widely used systems.
The book aims to provide an understanding of the principles on which the distributed computing are based; their architecture, algorithms and design; and how it meets the demands of contemporary distributed applications. I began with a set of nine chapters that together cover the building blocks for a study of distributed systems. The first two chapters provide a conceptual overview of the subject, outlining the characteristics of distributed systems and the challenges that must be addressed in their design: scalability, heterogeneity, security and failure handling being the most significant. These chapters also develop abstract models for understanding process interaction, failure and security.
Simply In Depth….
1 INTRODUCTION TO PARALLEL COMPUTING 9 Introduction Background Problem Solving in Parallel Concept of Temporal Parallelism Concept of Data Parallelism Functional Parallelism Classes of parallel computers Performance Evaluation The Concept of Concurrent and Parallel Execution Granularity Potential of Parallelism Data Clustering Minsky Conjecture The Need of Parallel Computation Levels of Parallel Processing Bit Level Instruction Level Loop Level Procedure Level Program Level Applications of Parallel Processing Scientific Applications/Image Processing Engineering Applications Database Query/Answering Systems AI Applications Mathematical Simulation and Modeling Applications Supercomputers and grand challenge problems Modem Parallel Computers Future of parallel computing 2 CLASSIFICATION OF PARALLEL COMPUTERS 25 Introduction Types of Classification Flynn’s Classification Instruction Cycle Instruction Stream and Data Stream Flynn’s Classification Handler’s Classification Structural Classification Shared Memory System/Tightly Coupled System Uniform Memory Access Model Non-Uniform Memory Access Model Cache-only Memory Architecture Model Loosely Coupled Systems Classification Based on Grain Size Parallelism Conditions Bernstein Conditions for Detection of Parallelism Parallelism Based on Grain Size 3 INTERCONNECTION NETWORK 40 Introduction Network Properties Design issues of Interconnection Network Various Interconnection Networks Concept of Permutation Network Performance Metrics 4 PARALLEL COMPUTER ARCHITECTURE 55 Introduction Pipeline Processing Classification of Pipeline Processors Instruction Pipelines Arithmetic Pipelines Performance and Issues in Pipelining Vector Processing Array Processing Associative Array Processing Multi-threaded Processors 5 PERFORMANCE ANALYSIS OF PARALLEL COMPUTING 70 Introduction Definitions Performance analysis Performance analysis techniques Performance analysis metrics Efficiency Speedup Amdahl's Law Gustafson Law Gustafson-Barsis's Law Superlinear Speedup and Efficiency The Karp-Flatt Metric The Isoefficiency Metric Isoefficiency Relation Cost and Scalability 6 PARALLEL COMPUTATIONAL MODEL 90 PRAM CRCW CREW EREW, Simulating CRCW on CREW & SREW PRAM algorithms P-Complete problems. 7 INTRODUCTION TO PARALLEL ALGORITHMS 98 PVM MPI Paradigms Simple parallel programs in MPI/PVM environments Parallel algorithms on network Addition of Matrices Multiplication of Matrices Parallel Programming Issues Systolic Array 8 FUNDAMENTALS OF DISTRIBUTED COMPUTING 136 Evolution of Distributed Computing Systems System models Issues in design of Distributed Systems Distributed-computing environment Web based distributed model Computer networks related to distributed & web based protocols. 9 ISSUES IN DESIGNING A DISTRIBUTED OPERATING SYSTEM 144 Transparency Reliability Fault Management Flexibility Performance Scalability 10 REMOTE PROCEDURE CALL 154 The RPC Model Transparency of RPC Implementing RPC Mechanism Stub Generation RPC Messages Marshaling Arguments and Results Server Management Communication Protocols for RPCs Complicated RPCs Client-Server Binding Exception Handling Security Some Special Types of RPCs Lightweight RPC Optimization for Better Performance. 11 DISTRIBUTED SHARED MEMORY 175 Design and Implementation issues of DSM Granularity Structure of Shared memory Space Consistency Models Replacement Strategy Thrashing Other Approaches to DSM Advantages of DSM 12 SYNCHRONIZATION 183 Clock Synchronization Event Ordering Mutual Exclusion Election Algorithms 13 RESOURCES AND PROCESS MANAGEMENT 193 Desirable Features of a good global scheduling algorithm Task assignment approach Load Balancing approach Load Sharing Approach Process Migration Threads Processor allocation Real time distributed Systems. 14 DISTRIBUTED FILE SYSTEM 205 Desirable Features of a good Distributed File Systems File Models File Accessing Models File-shearing Semantics File-caching Schemes File Replication Fault Tolerance Design Principles Suns network file system Andrews file system Comparison of NFS and AFS. 15 NAMING 210 Desirable Features of a Good Naming System Fundamental Terminologies and Concepts Systems-Oriented Names Name caches Naming & security DCE directory services.
Donate to keep this site alive
1. Disable the AdBlock plugin. Otherwise, you may not get any links.
2. Solve the CAPTCHA.
3. Click download link.
4. Lead to download server to download.