Distributed Computing - Brossura

Mahajan, Sunita; Shah, Seema

3,84

73 valutazioni di Goodreads

Brossura

ISBN 10: 0198093489 ISBN 13: 9780198093480

Casa editrice: OUP India, 2013

Vedi tutte le copie di questo ISBN:

The book covers basic concepts and techniques developed in this area over the past three decades such as the fundamentals of distributed computing, inter-process communication, synchronization, distributed system management, distributed shared memory, distributed file system and naming. Towards the end of the book emerging trends in high performance computing such as grid computing, SOA (Service-Oriented Architecture), and cloud computing are discussed. The book will help students and professional developers alike to understand the concepts and applications of distributed computing.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

L'autore:

Sunita Mahajan is currently Principal, Institute of Computer Science, MET League of Colleges, Mumbai. A PhD in computer technology from S.N.D.T. Women's University, she has 31 years of research experience at the Bhabha Atomic Research Centre, Mumbai. She is life member of the Computer Society of India, Indian Physics Association and Indian Women Scientists' Association, where she is working as a trustee. Seema Shah is currently Acting Principal and Assistant Professor, Computer Engineering Department, Vidyalankar Institute of Technology, Mumbai University. She is life member ISTE and IWSA, member IEEE and ACM.

Contenuti:

Chapter 1: Basic Distributed System Concepts
1.1 Introduction
1.1.1 What is a Distributed System?
1.1.2 Architectures for Distributed Systems
1.2 Distributed Computing Models
1.2.1 Workstation Model
1.2.2 Workstation-Server Model
1.2.3 Processor-pool Model
1.2.4 Comparison of the Distributed Computing Models
1.2.5 Advantages of Distributed Systems
1.2.6 Disadvantages of Distributed Systems
1.3 Software Concepts
1.3.1 Network Operating System
1.3.2 Distributed Operating System
1.3.3 Multiprocessor Time-Sharing System
1.3.4 Comparison of Different Operating Systems
1.4.1 Transparency
1.4.2 Flexibility
1.4.3 Reliability
1.4.4 Performance
1.4.5 Scalability
1.4.6 Security
1.4.7 Fault Tolerance
1.5 Client-Server Model
1.5.1 Basic Concepts
1.5.2 Client-Server Addressing
1.5.3 Client-Server Implementation
1.5.4 Client-Server Architecture
1.6 Case Studies
1.6.1 World Wide Web 1.0 1.6.2 World Wide Web 2.0
1.6.3 World Wide Web 3.0
Chapter 2: Network Communication
2.1 LAN and WAN Technologies
2.1.1 Introduction to LAN and WAN 46
2.1.2 Classification of Networks
2.2 Protocols for Network Systems
2.2.1 The ISO/OSI Reference Model
2.2.2 Internet Protocols
2.3 Asynchronous Transfer Mode
2.3.1 Introduction to ATM
2.3.2 ATM Protocol Reference Model
2.4 Protocols for Distributed Systems
2.4.1 Fast Local Internet Protocol (FLIP)
2.4.2 Versatile Message Transfer Protocol
Chapter 3: Interprocess Communication
3.1 Message Passing
3.1.1 Introduction to Message Passing
3.1.2 Advantages and Features of Message-Passing Systems
3.1.3 IPC Message Format
3.1.4 IPC Synchronization
3.1.5 Message Buffering Strategies
3.1.6 Multidatagram Messaging
3.1.7 Process Addressing Techniques
3.1.8 Failure Handling Mechanism
3.2 Case Study: IPC in MACH
3.3 Group Communication
3.3.1 Typesof Group Communication
3.3.2 Group Management
3.3.3 Group Addressing and Message Delivery
3.3.4 Reliability Mechanism
3.3.5 Message Ordering
3.4 Case Study: CBCAST Protocol in ISIS
3.5 API for Internet Protocol
3.5.1 Synchronous and Asynchronous Communications
3.5.2 Sockets, UDP and TCP
3.5.3 Java API for UDP and TCP Protocols
Chapter 4: Remote Communication
4.1 Introduction to Remote Communication
4.1.1 Middleware
4.2 Remote Procedural Call Basics
4.2.1 Basic RPC Operation
4.2.2 Stub Generation in RPC
4.3 RPC Implementation
4.3.1 RPC Messages
4.3.2 Parameter Passing Semantics
4.3.3 Server Management
4.4 RPC Communication
4.4.1 RPC Call Semantics
4.4.2 RPC Communication Protocols
4.4.3 Client-Server Binding
4.5 Other RPC Issues
4.5.1 Exception Handling and Security
4.5.2 RPC in Heterogeneous Environment
4.5.3 Failure Handling
4.5.4 RPC Optimization
4.5.5 Complicated and Special RPCs
4.6 Case Study: Sun RPC
4.7 Remote Method Invocation Basics
4.7.1 Distributed Object Concepts
4.8 RMI Implementation
4.8.1 Design Issues in RMI
4.8.2 RMI Execution
4.8.3 Types of Objects
4.8.4 Binding a Client to an Object
4.8.5 RMI Parameter Passing
4.9 Case Study: Java RMI
Chapter 5: Synchronization
5.1 Introduction
5.2 Clock Synchronization
5.2.1 Physical Clocks
5.2.3 Use of Synchronized Clocks
5.3 Logical Clocks
5.3.1 Event Ordering
5.3.2 Implementation of logical clocks
5.3.3 Lamport's Timestamps
5.3.4 Vector Timestamps
5.4 Global State
5.5 Mutual Exclusion
5.5.1 Centralized Algorithm 5.5.2 Distributed Algorithm 5.5.3 Token Ring Algorithm
5.5.4 Comparison of Various Algorithms
5.6 Election Algorithms
5.6.1 The Bully Election Algorithm
5.6.2 The Ring Election Algorithm
5.6.3 Election in a Wireless Network
5.7 Deadlocks in Distributed Systems
5.7.1 Basic Concepts
5.7.2 Deadlock Modelling
5.7.3 Handling Deadlocks in Distributed Systems
5.7.4 Distributed Deadlock Prevention
5.7.5 Distributed Deadlock Detection 5.7.6 Distributed Deadlock Recovery
5.7.7 Issues in Recovery from Deadlock
5.8 Case Study: Deadlocks in Message Communication
Chapter 6: Simulation Basics for Formal Model Specifications
6.1 Introduction
6.1.1 Basic Model of a Message Passing System
6.1.1 Asynchronous Systems
6.1.2 Synchronous Systems
6.2 Basics of Formal Model Specifications
6.2.1 A Generic Problem Specification
6.3 Communications System
6.3.1 Asynchronous Point-to-Point Message Passing System
6.3.2 Asynchronous Broadcast
6.4 Processes
6.5 Admissibility Conditions
6.6 Simulations
Chapter 7: Distributed System Management
7.1 Introduction
7.2 Resource Management
7.2.1 Desirable Features of a Global Scheduling Algorithm
7.3 Task Assignment Approach
7.3.1 Graph Theoretic Deterministic Algorithm
7.3.2 Centralized Heuristic Algorithm
7.3.3 Hierarchical Algorithm
7.4 Load-Balancing Approach
7.4.1 Taxonomy of Load-Balancing Algorithms
7.4.2 Issues in Designing Load-Balancing Algorithms
7.5 Load-Sharing Approach
7.5.1 Issues in Designing Load-Sharing Algorithms
7.6 Process Management in a Distributed Environment
7.6.1 Functions of Distributed Process Management
7.6.2 Desirable Features of a Process Migration Mechanism
7.7 Process Migration
7.7.1 Freezing the Process on Source Node
7.7.2 Address Space Transport Mechanisms
7.7.3 Message Forwarding Mechanism
7.7.4 Process Migration in Heterogeneous Systems
7.7.5 Advantages of Process Migration
7.8 Threads
7.8.1 Process vs. Threads
7.8.2 Thread Models
7.8.3 Design Issues in Threads
7.8.4 Implementing a Thread Package
7.8.5 Threads and Remote Execution
7.9 Fault Tolerance
7.9.1 Component Faults
7.9.2 System Failures
7.9.3 Use of Redundancy
Chapter 8: Distributed Shared Memory
8.1 Introduction
8.2 Basic Concepts of DSM
8.2.1 DSM Architecture
8.2.2 Message Passing Vs. Shared Memory
8.2.3 Types of DSMs
8.2.4 Advantages of DSM
8.3 Hardware DSM
8.3.1 On-chip Memory DSM
8.3.2 Bus-based Multiprocessor
8.3.3 Ring-based Multiprocessor
8.3.4 Switched Multiprocessor
8.4 Design Issues in DSM Systems
8.4.1 Granularity
8.4.2 Structure
8.4.3 Consistency Models
8.4.4 Coherence Protocols
8.5 Issues in Implementing DSM Systems
8.5.1 Thrashing
8.5.2 Responsibility for DSM Management
8.5.3 Replication Versus Migration Strategies
8.5.4 Replacement Strategy
8.6 Heterogeneous and Other DSM Systems
8.6.1 Data Compatibility and Conversion
8.6.2 Block Size Selection
8.7 Case Studies
8.7.1 Munin
8.7.2 Linda
8.7.3 Teamster
8.7.4 JUMP
Chapter 9: Distributed File System
9.1 Introduction to DFS
9.1.1 Functions of DFS
9.1.2 Components of DFS
9.1.3 Desirable Features of a Good DFS
9.2 File Models
9.2.1 Structured and Unstructured Files
9.2.2 Mutable and Immutable Files
9.3 Distributed File System Design
9.3.1 File Service Interface
9.3.2 Directory Service Interface
9.3.3 Naming Transparency
9.4 Semantics of File Sharing
9.4.1 UNIX File Semantics
9.4.2 Session Semantics
9.4.3 Immutable Shared-file Semantics
9.4.4 Transaction-like Semantics
9.5.1 DFS System Structure
9.6 File Caching in DFS
9.6.1 Cache Location
9.7 Replication in DFS
9.7.1 Unit of replication
9.7.2 Replica Creation
9.7.3 Update Protocols
9.8 Case Studies
9.8.1 SUN Network File System
9.8.2 Google File System
Chapter 10: Naming
10.1 Introduction
10.2 Desirable Features of a Good Naming System
10.3 Basic Concepts
10.3.1 Name
10.3.2 Namespace and Contexts
10.3.3 Name Server
10.3.4 Name Agent
10.3.5 Name Resolution
10.4 System-Oriented Names
10.4.1 Features of System-Oriented Names
10.4.2 Types of System-Oriented Names
10.4.3 Approaches to Generate System-Oriented Names
10.5 Object-Locating Mechanisms
10.5.1 Broadcast
10.5.2 Expanding Ring Broadcas
10.5.3 Encoding Object Location in UID
10.5.4 Encoding Creator Node ID in UID
10.5.5 Using Forward Location Pointers
10.5.6 Using Hint Cache and Broadcasting
10.6 Issues in Designing Human-Oriented Names
10.6.1 Scheme for Global Object Naming
10.6.2 Schemes for Partitioning a Namespace into Contexts
10.6.3 Schemes for Implementing Context Bindings
10.6.4 Schemes for Name Resolution
10.7 Name Caches
10.7.1 Characteristics of Name Service Activities
10.7.2 Issues in Name Cache Design
10.8 Naming and Security
10.9 Case Study: Domain Name Service
Chapter 11: Security in Distributed Systems 434
11.1 Introduction
11.1.1 Potential Threats and Attacks on Computer Systems
11.1.2 Confinement Problems
11.1.3 Design Issues in Building Secure Distributed Systems
11.2 Cryptography
11.2.1 Symmetric Cryptosystem Algorithm: DES
11.2.2 Asymmetric Cryptosystem
11.3 Secure Channels
11.3.1 Authentication
11.3.2 Message Integrity and Confidentiality
11.3.3 Secure Group Communications
11.4 Access Control
11.4.1 General Issues
11.4.2 Firewalls
11.4.3 Secure Mobile Code
11.5 Security Management
11.5.1 Key Management
11.5.2 Issues in Key Distribution
11.5.3 Secure Group Management
11.5.4 Authorization Management
11.6 Case Studies
11.6.1 Kerberos
11.6.2 E-payment
Chapter 12: Real-Time Distributed Operating Systems
12.1 Introduction
12.1.1 Types of Stimuli
12.1.2 Classification of Real-Time Systems
12.2 Design Issues in Real-time Distributed Systems
12.2.1 Clock Synchronization
12.2.2 Event-Triggered and Time-Triggered Systems
12.2.3 Fault Tolerance
12.2.4 Predictability
12.2.5 Language Support
12.3 Real-Time Communication
12.3.1 Real-Time Communication in LAN
12.3.2 Real-Time Communication in WAN
12.4 Real-Time Scheduling
12.4.1 Algorithms For Real-Time Scheduling
12.4.2 Dynamic Scheduling
12.4.3 Static Scheduling
12.5 Case Study: Real-Time Communication in MARS
Chapter 13: Distributed Database Management System
13.1 Introduction
13.1.1 Distributed Database (DDB)
13.1.2 Distributed Database Management System (DDBMS)
13.1.3 Distributed Processing
13.1.4 Parallel DBMS
13.1.5 Advantages of DDBMS
13.1.6 Disadvantages of DDBMS
13.1.7 Functions of DDBMS
13.1.8 Types of Distributed Databases
13.2 Distributed DBMS Architectures
13.2.1 Client-Server Systems
13.2.2 Collaborating Server Systems
13.2.3 Middleware Systems
13.3 Data Storage in a Distributed DBMS
13.3.1 Data Allocation
13.3.3 Replication
13.4 Distributed Catalog Management
13.4.1 Naming Objects
13.4.2 Catalog Structure
13.4.3 Distributed Data Independence
13.5 Distributed Query Processing
13.5.1 Non-join Queries in a DDBMS
13.5.2 Joins in a DDBMS
13.5.3 Cost-Based Query Optimization
13.5.4 Updating Distributed Data
13.6 Distributed Transactions
13.7 Distributed Concurrency Control
13.7.1 Objectives
13.7.2 Distributed Serializability
13.7.3 Locking Protocols
13.7.4 Timestamp Protocols
13.7.5 Distributed Deadlock Management
13.8 Distributed Database Recovery
13.8.1 Failures in Distributed Environment
13.8.2 How Failures Affect Recover...