Interprocess Communications in Linux

Interprocess Communications in Linux®: The Nooks & Crannies
By John Shapley Gray

Publisher : Prentice Hall PTR
Pub Date : January 13, 2003
ISBN : 0-13-046042-7



Copyright
Introduction
Acknowledgments
Chapter 1. Programs and Processes
Section 1.1. Introduction
Section 1.2. Library Functions
Section 1.3. System Calls
Section 1.4. Linking Object Code
Section 1.5. Managing Failures
Section 1.6. Executable File Format
Section 1.7. System Memory
Section 1.8. Process Memory
Section 1.9. The u Area
Section 1.10. Process Memory Addresses
Section 1.11. Creating a Process
Section 1.12. Summary
Section 1.13. Key Terms and Concepts

Section 2.1. Introduction
Section 2.2. Process ID
Section 2.3. Parent Process ID
Section 2.4. Process Group ID
Section 2.5. Permissions
Section 2.6. Real and Effective User and Group IDs
Section 2.7. File System Information
Section 2.8. File Information
Section 2.9. Process Resource Limits
Section 2.10. Signaling Processes
Section 2.11. Command-Line Values
Section 2.12. Environment Variables
Section 2.13. The /proc Filesystem
Section 2.14. Summary
Section 2.15. Key Terms and Concepts

Chapter 3. Using Processes
Section 3.1. Introduction
Section 3.2. The fork System Call Revisited
Section 3.3. exec's Minions
Section 3.4. Using fork and exec Together
Section 3.5. Ending a Process
Section 3.6. Waiting on Processes
Section 3.7. Summary
Section 3.8. Key Terms and Concepts

Chapter 4. Primitive Communications
Section 4.1. Introduction
Section 4.2. Lock Files
Section 4.3. Locking Files
Section 4.4. More About Signals
Section 4.5. Signal and Signal Management Calls
Section 4.6. Summary
Section 4.7. Key Terms and Concepts

Chapter 5. Pipes
Section 5.1. Introduction
Section 5.2. Unnamed Pipes
Section 5.3. Named Pipes
Section 5.4. Summary
Section 5.5. Key Terms and Concepts

Chapter 6. Message Queues
Section 6.1. Introduction
Section 6.2. IPC System Calls: A Synopsis
Section 6.3. Creating a Message Queue
Section 6.4. Message Queue Control
Section 6.5. Message Queue Operations
Section 6.6. A Client–Server Message Queue Example
Section 6.7. Message Queue Class
Section 6.8. Summary
Section 6.9. Key Terms and Concepts

Chapter 7. Semaphores
Section 7.1. Introduction
Section 7.2. Creating and Accessing Semaphore Sets
Section 7.3. Semaphore Control
Section 7.4. Semaphore Operations
Section 7.5. Semaphore Class
Section 7.6. Summary
Section 7.7. Key Terms and Concepts

Chapter 8. Shared Memory
Section 8.1. Introduction
Section 8.2. Creating a Shared Memory Segment
Section 8.3. Shared Memory Control
Section 8.4. Shared Memory Operations
Section 8.5. Using a File as Shared Memory
Section 8.6. Shared Memory Class
Section 8.7. Summary
Section 8.8. Key Terms and Concepts

Chapter 9. Remote Procedure Calls
Section 9.1. Introduction
Section 9.2. Executing Remote Commands at a System Level
Section 9.3. Executing Remote Commands in a Program
Section 9.4. Transforming a Local Function Call into a Remote Procedure
Section 9.5. Debugging RPC Applications
Section 9.6. Using RPCGEN to Generate Templates and a MAKEFILE
Section 9.7. Encoding and Decoding Arbitrary Data Types
Section 9.8. Using Broadcasting to Search for an RPC Service
Section 9.9. Summary
Section 9.10. Key Terms and Concepts

Chapter 10. Sockets
Section 10.1. Introduction
Section 10.2. Communication Basics
Section 10.3. IPC Using Socketpair
Section 10.4. Sockets: The Connection-Oriented Paradigm
Section 10.5. Sockets: The Connectionless Paradigm
Section 10.6. Multiplexing I/O with select
Section 10.7. Peeking at Data
Section 10.8. Out of Band Messages
Section 10.9. Summary
Section 10.10. Key Terms and Concepts

Chapter 11. Threads
Section 11.1. Introduction
Section 11.2. Creating a Thread
Section 11.3. Exiting a Thread
Section 11.4. Basic Thread Management
Section 11.5. Thread Attributes
Section 11.6. Scheduling Threads
Section 11.7. Using Signals in Threads
Section 11.8. Thread Synchronization
Section 11.9. Thread-Specific Data
Section 11.10. Debugging Multithreaded Programs
Section 11.11. Summary
Section 11.12. Nomenclature and Key Concepts

Appendix A. Using Linux Manual Pages
Section A.1. Manual Page Sections
Section A.2. Manual Page Format
Section A.3. Standard Linux System Calls

Appendix B. UNIX Error Messages
Appendix C. RPC Syntax Diagrams
Section C.1. Introduction
Section C.2. RPC Definitions
Section C.3. RPC Keywords
Section C.4. Some RPC Examples

Appendix D. Profiling Programs
Section D.1. Introduction
Section D.2. Sample Program for Profiling
Section D.3. Generating Profile Data
Section D.4. Viewing and Interpreting Profile Data

Appendix E. Bibliography

Another Linux Books
Another Open Source Books
Another Parallel Programming Books
Download Continue Reading ...

Flow Based Programming

Another important concept for productivity improvement is that of a reusable subroutine library. I also believe strongly that reuse is another key piece of the solution, but not exactly in the form in which we visualized it in those days. In company after company, I have seen people start up shared subroutine libraries with a fine flurry of enthusiasm, only to find the action slowing to a standstill after some 30 or 40 subroutines have been developed and made available. Some companies are claiming much higher numbers, but I suspect these are shops which measure progress, and reward their people, based on how many subroutines are created and added to the library, rather than on whether they are actually used. Although organizational and economic changes are also required to really capitalize on any form of reuse, I believe there is a more fundamental reason why these libraries never really take off, and that is the philosophy of the von Neumann machine. I will be going into this in more detail in Chapter 1, but I found I was able to predict which subroutines would land up in these libraries, and it was always "one moment in time" functions, e.g. binary search, date routines, various kinds of conversions. I tried to build an easy-to-use, general purpose update (yes, I really tried), and I just couldn't do it (except for supporting a tiny subset of all the possible variations)! This experience is what got me thinking about a radically different approach to producing reusable code. I hope that, as you read this book, you will agree that there is another approach, and that it is completely complementary to the old one


Rapid prototyping and the related idea of iterative development were (and are still) another enthusiasm of mine. Rapid prototyping is a process of reducing the uncertainties in the development process by trying things out. I believe that anything you are uncertain about should be prototyped: complex algorithms, unfamiliar hardware, data base structures, human interfaces (especially!), and so on. I believe this technique will become even more important in the next few decades as we move into ever more complex environments. Here again, we will have to modify or even abandon the old methodologies. Dave Olson's 1993 book, "Exploiting Chaos: Cashing in on the Realities of Software Development", describes a number of approaches to combining iterative development with milestones to get the best of both worlds, plus some fascinating digressions into the new concepts of chaos and "strange attractors". There are some very strange attractors in our business! I have also believed for some time that most prototypes should not just be thrown away once they have served their purpose. A prototype should be able to be "grown", step by step, into a full-fledged system. Since the importance of prototypes is that they reduce uncertainty, rewriting applications in a different language is liable to bring a lot of it back!

Another Programming Language Books
Download Continue Reading ...

Linux Clustering Building and Maintaining Linux Clusters

Table of Contents
Copyright
About the Author
About the Technical Reviewers
Acknowledgments
Tell Us What You Think
Introduction
Part I: An Overview of Clustering for Linux, Preparing Your Network, and Linux Servers
Chapter 1. Clustering Fundamentals
Clustering for the Enterprise
Clusters Aren’t Just for High Performance Anymore
SMP and the Primary Processor Paradigm
Quick and Dirty Clustering
Alternate File Systems
Networking 101 for Clusters
Summary
ownload ChapterDownload Chapter
Chapter 2. Preparing Your Linux Cluster
Planning the Topology
Select the Right Distribution
Planning the Environment
A Few Words About Security
Developing a Backup Policy
Summary
Chapter 3. Installing and Streamlining the Cluster
Setting Up the DHCP Server
Unattended Red Hat Install with Kickstart
SystemImager
Post-Installation Procedures
Summary

Chapter 4. Alternative File Systems
Ext2 Under a Microscope
Loopback File Systems
The Ext3 File System
ReiserFS
The Logical Volume Manager
Summary
Part II: Building Clusters

Chapter 5. High Availability and Fault-Tolerant Clusters
Haven’t We Heard of This Somewhere Before?
Heartbeat Connectivity
Houston: We Have a Problem
Putting It All Together
Summary

Chapter 6. Load Balancing
What Is This Load Balancing Thing, Anyway?
Balance
Eddie Mission
Configuring the Enhanced DNS Server
Linux Virtual Server
Summary

Chapter 7. Distributed Computing
One For All, and All For One
Distributed File Sharing
Distributed Denial of Service
Condor
Mosix, Kernel-Based Distributed Computing
Using Diskless Clients with Mosix
Summary

Chapter 8. Parallel Computing
Parallel Computing in a Nutshell
Cluster Installation
Summary
Part III: The Care and Feeding of a Cluster

Chapter 9. Programming a Parallel Cluster
Coarse Granularity in a Finely Granular World
Programming in a Clustered Environment
MPI
Summary

Chapter 10. Cluster Management
Learn to Use the Right Tools
Configuring syslogd for Your Cluster
General-Purpose Reporting with mon
Big Brother Is Watching
Summary
Chapter 11. Recovering When Disaster Str ikes
Troubleshooting Through Layers
Helpful Tools to Diagnose Your Cluster
When Worse Comes to Worst
This Too Shall Pass
Summary
Part IV: Appendixes
Appendix A. Cluster Resources
Designing a Cluster
Linux File Systems
Monitors
High Availability Clusters
Parallel Clusters
Load Balanced Clusters
Distributed Clusters
Appendix B. Kickstart Options

Another Parallel Prograamming Books
Download Continue Reading ...

Parallel Iterative Algorithms from Sequential to Grid Computing

Contents
List of Tables ix
List of Figures xi
Acknowledgments xiii
Introduction xv
1 Iterative Algorithms 1
1.1 Basic theory . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1.1 Characteristic elements of a matrix . . . . . . . . . . . 1
1.1.2 Norms . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Sequential iterative algorithms . . . . . . . . . . . . . . . . . 5
1.3 A classical illustration example . . . . . . . . . . . . . . . . . 8
2 Iterative Algorithms and Applications to Numerical Prob-
lems 11
2.1 Systems of linear equations . . . . . . . . . . . . . . . . . . . 11
2.1.1 Construction and convergence of linear iterative algo-
rithms . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.1.2 Speed of convergence of linear iterative algorithms . . 13
2.1.3 Jacobi algorithm . . . . . . . . . . . . . . . . . . . . . 15
2.1.4 Gauss-Seidel algorithm . . . . . . . . . . . . . . . . . . 17
2.1.5 Successive overrelaxation method . . . . . . . . . . . . 19
2.1.6 Block versions of the previous algorithms . . . . . . . 20
2.1.7 Block tridiagonal matrices . . . . . . . . . . . . . . . . 22
2.1.8 Minimization algorithms to solve linear systems . . . . 24
2.1.9 Preconditioning . . . . . . . . . . . . . . . . . . . . . . 33
2.2 Nonlinear equation systems . . . . . . . . . . . . . . . . . . . 39
2.2.1 Derivatives . . . . . . . . . . . . . . . . . . . . . . . . 40
2.2.2 Newton method . . . . . . . . . . . . . . . . . . . . . 41
2.2.3 Convergence of the Newton method . . . . . . . . . . 43
2.3 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
3 Parallel Architectures and Iterative Algorithms 49
3.1 Historical context . . . . . . . . . . . . . . . . . . . . . . . . 49
3.2 Parallel architectures . . . . . . . . . . . . . . . . . . . . . . 51
3.2.1 Classifications of the architectures . . . . . . . . . . . 51
3.3 Trends of used configurations . . . . . . . . . . . . . . . . . . 60
3.4 Classification of parallel iterative algorithms . . . . . . . . . 61
3.4.1 Synchronous iterations - synchronous communications
(SISC) . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
3.4.2 Synchronous iterations - asynchronous communications
(SIAC) . . . . . . . . . . . . . . . . . . . . . . . . . . 63
3.4.3 Asynchronous iterations - asynchronous communications
(AIAC) . . . . . . . . . . . . . . . . . . . . . . . . . . 64
3.4.4 What PIA on what architecture? . . . . . . . . . . . . 68
4 Synchronous Iterations 71
4.1 Parallel linear iterative algorithms for linear systems . . . . . 71
4.1.1 Block Jacobi and O’Leary and White multisplitting al-
gorithms . . . . . . . . . . . . . . . . . . . . . . . . . . 71
4.1.2 General multisplitting algorithms . . . . . . . . . . . . 76
4.2 Nonlinear systems: parallel synchronous Newton-multisplitting
algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79
4.2.1 Newton-Jacobi algorithms . . . . . . . . . . . . . . . . 79
4.2.2 Newton-multisplitting algorithms . . . . . . . . . . . . 80
4.3 Preconditioning . . . . . . . . . . . . . . . . . . . . . . . . . 82
4.4 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . 82
4.4.1 Survey of synchronous algorithms with shared memory
architecture . . . . . . . . . . . . . . . . . . . . . . . . 84
4.4.2 Synchronous Jacobi algorithm . . . . . . . . . . . . . . 85
4.4.3 Synchronous conjugate gradient algorithm . . . . . . . 88
4.4.4 Synchronous block Jacobi algorithm . . . . . . . . . . 88
4.4.5 Synchronous multisplitting algorithm for solving linear
systems . . . . . . . . . . . . . . . . . . . . . . . . . . 91
4.4.6 Synchronous Newton-multisplitting algorithm . . . . . 101
4.5 Convergence detection . . . . . . . . . . . . . . . . . . . . . . 104
4.6 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107
5 Asynchronous Iterations 111
5.1 Advantages of asynchronous algorithms . . . . . . . . . . . . 112
5.2 Mathematical model and convergence results . . . . . . . . . 113
5.2.1 The mathematical model of asynchronous algorithms . 113
5.2.2 Some derived basic algorithms . . . . . . . . . . . . . 115
5.2.3 Convergence results of asynchronous algorithms . . . . 116
5.3 Convergence situations . . . . . . . . . . . . . . . . . . . . . 118
5.3.1 The linear framework . . . . . . . . . . . . . . . . . . 118
5.3.2 The nonlinear framework . . . . . . . . . . . . . . . . 120
5.4 Parallel asynchronous multisplitting algorithms . . . . . . . . 120
5.4.1 A general framework of asynchronous multisplitting meth-
ods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121
5.4.2 Asynchronous multisplitting algorithms for linear prob-
lems . . . . . . . . . . . . . . . . . . . . . . . . . . . . 124
5.4.3 Asynchronous multisplitting algorithms for nonlinear
problems . . . . . . . . . . . . . . . . . . . . . . . . . 125
5.5 Coupling Newton and multisplitting algorithms . . . . . . . 129
5.5.1 Newton-multisplitting algorithms: multisplitting algo-
rithms as inner algorithms in the Newton method . . 129
5.5.2 Nonlinear multisplitting-Newton algorithms . . . . . . 131
5.6 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . 131
5.6.1 Some solutions to manage the communications using
threads . . . . . . . . . . . . . . . . . . . . . . . . . . 133
5.6.2 Asynchronous Jacobi algorithm . . . . . . . . . . . . . 135
5.6.3 Asynchronous block Jacobi algorithm . . . . . . . . . 135
5.6.4 Asynchronous multisplitting algorithm for solving linear
systems . . . . . . . . . . . . . . . . . . . . . . . . . . 138
5.6.5 Asynchronous Newton-multisplitting algorithm . . . . 140
5.6.6 Asynchronous multisplitting-Newton algorithm . . . . 142
5.7 Convergence detection . . . . . . . . . . . . . . . . . . . . . . 145
5.7.1 Decentralized convergence detection algorithm . . . . 145
5.8 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169
6 Programming Environments and Experimental Results 173
6.1 Implementation of AIAC algorithms with non-dedicated envi-
ronments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 174
6.1.1 Comparison of the environments . . . . . . . . . . . . 174
6.2 Two environments dedicated to asynchronous iterative algo-
rithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 176
6.2.1 JACE . . . . . . . . . . . . . . . . . . . . . . . . . . . 177
6.2.2 CRAC . . . . . . . . . . . . . . . . . . . . . . . . . . . 180
6.3 Ratio between computation time and communication time . 186
6.4 Experiments in the context of linear systems . . . . . . . . . 186
6.4.1 Context of experimentation . . . . . . . . . . . . . . . 186
6.4.2 Comparison of local and distant executions . . . . . . 189
6.4.3 Impact of the computation amount . . . . . . . . . . . 191
6.4.4 Larger experiments . . . . . . . . . . . . . . . . . . . . 192
6.4.5 Other experiments in the context of linear systems . . 193
6.5 Experiments in the context of partial differential equations us-
ing a finite difference scheme . . . . . . . . . . . . . . . . . . 196
Appendix 201
A-1 Diagonal dominance. Irreducible matrices . . . . . . . . . . . 201
A-1.1 Z-matrices, M-matrices and H-matrices . . . . . . . . 202
A-1.2 Perron-Frobenius theorem . . . . . . . . . . . . . . . . 203
A-1.3 Sequences and sets . . . . . . . . . . . . . . . . . . . . 203
References 205

Another Grid Computing
Download Continue Reading ...

Grid Computing A Practical Guide To Technology And Applications

by Ahmar Abbas ISBN:1584502762
Charles River Media © 2004 (408 pages)
This detailed guide provides guidelines for IT managers and technologists interested in implementing a workable grid computing technology.




Table of Contents
Grid Computing—A Practical Guide to Technology and Applications
Preface
Chapter 1 - IT Infrastructure Evolution
Chapter 2 - Productivity Paradox and Information Technology
Chapter 3 - Business Value of Grid Computing
Chapter 4 - Grid Computing Technology—An Overview
Chapter 5 - Desktop Grids
Chapter 6 - Cluster Grids
Chapter 7 - HPC Grids
Chapter 8 - Data Grids
Chapter 9 - The Open Grid Services Architecture
Chapter 10 - Creating and Managing Grid Services
Chapter 11 - Desktop Supercomputing—Native Programming for Grids
Chapter 12 - Grid-Enabling Software Applications
Chapter 13 - Application Integration
Chapter 14 - Grid-Enabling Network Services
Chapter 15 - Managing Grid Environments
Chapter 16 - Grid Computing Adoption in Research and Industry
Chapter 17 - Grids in Life Sciences
Chapter 18 - Grids in the Telecommunications Sector
Chapter 19 - Grids in Other Industries
Chapter 20 - Hive Computing for Transaction Processing Grids
Appendix A - About the CD-ROM
Index
List of Figures
List of Tables


Another Grid Computing Books
Download Continue Reading ...

Grid Computing for Electromagnetics

Contents
Acknowledgments xi
Introduction xiii
Grid Computing: What Is It? xiii
Grid Computing: Who Is Who? xv
Grid Computing: An Opportunity for Electromagnetics Research xv
How to Read This Book xvii
A Final Note xviii
References xviii
CHAPTER 1
General Concepts on Grids 1
1.1 Introduction 1
1.2 Parallel and Distributed Architectures 2
1.3 Parallel and Distributed Topologies 5
1.4 Parallel and Distributed Programming 7
1.4.1 Message Passing 8
1.4.2 Shared-Memory Programming 9
1.4.3 Concluding Remarks: Programming Paradigms and
1.4.3 Parallel Architectures 10
1.5 Performance Assessment 10
1.6 Web Computing 11
1.7 Computational Grids 14
1.7.1 Introduction 14
1.7.2 What Is a Grid? 15
1.7.3 Grid Architecture 17
1.7.4 Grid Middleware 19
1.7.5 Applications 20
1.8 Conclusions 21
References 21
CHAPTER 2
Enabling Technologies and Dedicated Tools 23
2.1 Introduction 23
2.2 Enabling Technologies: Object Orientation 24
2.2.1 Object Orientation for Software Engineering 24
2.2.2 Object Orientation for Enabling Technologies 25
2.2.3 CORBA 26
2.2.4 Java 27
2.2.5 Object Orientation and Electromagnetic Simulators 28
2.2.6 Conclusions 29
2.3 Dedicated Tools: Grid Middleware 30
2.4 The Globus Toolkit: An Overview 30
2.5 The Globus Toolkit: The Globus Security Infrastructure 31
2.5.1 Authorization 32
2.5.2 Mutual Authentication 33
2.5.3 Single Sign On and Delegation 35
2.5.4 Other Services 37
2.6 The Globus Toolkit: The Resource Management Pillar 38
2.7 The Globus Toolkit: The Information Services Pillar 42
2.7.1 MDS Directory Service: Lightweight Directory Access Protocol 43
2.7.2 MDS Information Model 43
2.8 The Globus Toolkit: The Data Management Pillar 46
2.8.1 Distributed Data Access and Management 46
2.8.2 Dataset Replicas Services 47
2.8.3 Conclusions 48
2.9 The Globus Tools API 48
2.10 The MPI with Globus 49
2.11 Dedicated Tools: Economy-Driven RM in Grids 51
2.12 Web-Based Technologies and Projects 51
2.13 Grid-Enabled HTC: Condor-G 53
References 53
CHAPTER 3
Building Up a Grid 57
3.1 Introduction 57
3.2 Recalling Globus Basic Concepts 58
3.3 Setting Up the Environment 60
3.3.1 Hardware Requirements 60
3.3.2 Software Requirements 60
3.3.3 Setting Up the Network 60
3.3.4 Before Installing Globus 61
3.4 Globus Installation 62
3.4.1 Downloading the Package 62
3.4.2 Installing the Toolkit 63
3.5 Globus Configuration 64
3.5.1 Authorization 65
3.5.2 Authentication 66
3.5.3 Using the Globus CA 66
3.5.4 Using a Local CA 68
3.6 Services Start Up 72
3.6.1 Resource Management 72
3.6.2 Information Services 72
3.6.3 Data Management 73
3.7 Introducing a New User to the Grid 74
3.7.1 Client Side 74
3.7.2 Server Side 74
3.8 Globus-Relevant Commands to Use the Grid 74
3.8.1 Authentication 75
3.8.2 Resource Management 75
3.8.3 Information Services 78
3.8.4 Data Management 80
3.9 Developing Grid-Enabled Applications 82
3.9.1 An Example with Globus API 83
3.10 Message Passing in a Grid Framework 85
3.11 Summary and Conclusions 87
References 87
CHAPTER 4
Applications: FDTD with MPI in Grid Environments 89
4.1 Introduction 89
4.2 The FDTD Approach: Theoretical Background 89
4.2.1 Yee’s Algorithm 89
4.2.2 Stability of the Algorithm 92
4.2.3 Numerical Dispersion 92
4.2.4 Excitation and Absorbing Boundary Conditions 93
4.2.5 CPU Time and Memory Requirements 95
4.3 Parallel FDTD 96
4.3.1 A Simple and Portable Parallel Algorithm 96
4.4 Migration Toward Computational Grids 108
4.4.1 Introduction 108
4.4.2 Practical Guidelines 109
4.4.3 Pthread Libraries and MPICH-G2 110
4.5 Numerical Performance 111
4.5.1 Performance Evaluation of Parallel Distributed FDTD 111
4.5.2 MPICH-G2 Performance Evaluation 112
4.5.3 Benchmarking Parallel FDTD on a Grid 115
4.6 Remarkable Achievements 116
4.7 Conclusions 117
Acknowledgments 117
References 117
CHAPTER 5
CAE of Aperture-Antenna Arrays 121
5.1 Introduction 121
5.2 Numerical Techniques for the Analysis of Flange-Mounted
Rectangular Apertures 123
5.2.1 Theoretical Background 123
5.2.2 Approaches Based on Waveguide Modes 125
5.2.3 Approaches Based on Gegenbauer’s Polynomials 127
5.3 A Tool for the CAE of Rectangular Aperture Antenna Arrays 128
5.3.1 Evaluation of the Horns’ Scattering Matrix 129
5.3.2 Evaluation of the Aperture Array’s Scattering Matrix 130
5.3.3 Evaluation of the Scattering Matrix at External Ports 132
5.3.4 Evaluation of the Radiation Pattern 134
5.4 Parallel CAE of Aperture Arrays 135
5.4.1 Preliminary Analysis 136
5.4.2 Parallelization 139
5.4.3 Results on MIMD Supercomputing Platforms 142
5.5 Migration Toward Grid Environments 144
5.5.1 Supporting Cooperative Engineering with GC 145
5.6 Conclusions 150
Acknowledgments 151
References 151
CHAPTER 6
Wireless Radio Base Station Networks 153
6.1 Introduction 153
6.2 Foundations of Cellular Systems 154
6.2.1 General Considerations 154
6.2.2 Frequency Reuse 155
6.2.3 Capacity and Traffic 157
6.2.4 How a Cellular System Connects Users 158
6.2.5 BS Antennas 158
6.3 Key Factors for Current and Future Wireless Communications 160
6.3.1 Power Control 160
6.3.2 Managing with More and More Users 161
6.3.3 System Standardization and Interoperability 161
6.3.4 Concerns in the Public Opinion 162
6.4 Planning Wireless Networks 162
6.5 An Integrated System for Optimum Wireless Network Planning 163
6.5.1 Overview of the System 164
6.6 A Candidate Architecture for an Effective ISNOP 169
6.7 GC and Its Role in the ISNOP 170
6.8 Wireless Network Planning with GC 170
6.8.1 Data Communication with GC in a Simplified ISNOP 173
6.8.2 ENC Module Simulation 178
6.9 Conclusions 180
Acknowledgments 181
References 181
CHAPTER 7
Conclusions and Future Trends 183
7.1 GC: Benefits and Limitations 183
7.2 GC Trends 184
References 185
APPENDIX A
Useful UNIX/Linux Hints 187
A.1 UNIX/Linux Operating System: An Overview 187
A.2 UNIX/Linux: The Architecture 188
A.3 The File System 188
A.3.1 Introduction 188
A.3.2 File System Relevant Commands 189
A.3.3 Pathnames 191
A.3.4 System Calls for File Management 192
A.3.5 Permissions 192
A.4 Processes 193
A.5 Administration 194
A.6 The Shell 194
A.6.1 Introduction 194
A.6.2 Background Command Execution 196
A.6.3 Redirection 196
A.6.4 Pipes 197
A.6.5 Environment Variables 197
References 198
APPENDIX B
Foundations of Cryptography and Security 199
B.1 Introduction 199
B.2 Confidentiality and Cryptography 200
B.3 Digital Signature 202
B.4 Certificates and Certification Authorities 203
References 205
APPENDIX C
Foundations for Electromagnetic Theory 207
C.1 Maxwell’s Equations in the Time Domain 207
C.2 Helmholtz and Dispersion Equations 208
C.3 TE and TM Modes 209
C.4 Fourier Representation of Green’s Functions 210
C.5 The Far-Field Approximation 212
Reference 213
APPENDIX D
List of Useful Web Sites 215
Glossary 217
List of Acronyms 227
Selected Bibliography 233
About the Authors 239
Index 241

Another Grid Computing Books
Another Electronic Books
Download Continue Reading ...

Policy-based Contracting in Semantic Web Service Markets

Another Web Programming Books
Download Continue Reading ...

Running Xen A Hands-On Guide to the Art of Virtualization

by Jeanna N. Matthews; Eli M. Dow; Todd Deshane; Wenjin Hu; Jeremy Bongio; Patrick F.
Wilbur; Brendan Johnson
Publisher: Prentice Hall
Pub Date: April 10, 2008
Print ISBN-10: 0-13-234966-3
Print ISBN-13: 978-0-13-234966-6
eText ISBN-10: 0-13-207467-2
eText ISBN-13: 978-0-13-207467-4
Pages: 624
Table of Contents
| Index
Copyright
Foreword
Preface
Acknowledgments
About the Authors
Chapter 1. Xen—Background and Virtualization Basics
Common Uses and Benefits of Virtualization
Types of Virtualization
Virtualization Heritage
Other Virtualization Systems for Commodity Hardware
Summary
References and Further Reading
Chapter 2. A Quick Tour with the Xen LiveCD
Running the LiveCD
Step 1: Downloading the LiveCD Image and Creating the CD
Step 2: Choosing a Domain0 Image from the GRUB Menu
Step 3: Logging In and the Desktop
Step 4: Creating Guests
Step 5: Deleting a Guest
Step 6: Interacting with Your Guests
Step 7: Testing Your Networking
Too Many Guests
Summary
References and Further Reading
Chapter 3. The Xen Hypervisor
Xen Hypervisor
A Privileged Position
Domain0
Xen Boot Options
Choosing an OS for Domain0
xend
XenStore
Summary
References and Further Reading
Chapter 4. Hardware Requirements and Installation of Xen Domain0
Xen Domain0 Processor Requirements
Hardware Device Support and Recommendations
Memory Requirements
Choosing and Obtaining a Version of Xen
Methods of Installing Domain0 Hosts
Linux Distributions
XenExpress
Non-Linux Domain0 Installations
Building from Source
Summary
References and Further Reading
Chapter 5. Using Prebuilt Guest Images
Introduction to DomU Guests
Working with Prebuilt Guest Images
Converting Images from Other Virtualization Platforms
Summary
References and Further Reading
Chapter 6. Managing Unprivileged Domains
Introduction to the xm Utility
The xm list Subcommand
The xm create Subcommand
Guest Configuration Files
Diagnosing Problems with Guest Creation
Automatically Starting DomUs
Shutting Down Guest Domains
Pausing Domains
Interacting with a Guest Nongraphically
Interacting with a Guest Graphically
Summary
References and Further Reading
Chapter 7. Populating Guest Images
Hardware Virtual Machine (HVM) Guest Population
Guest Image Customization
Converting Existing Installations
Summary
References and Further Reading
Chapter 8. Storing Guest Images
Logical Volumes
Network Image Storage Options
Guest Image Files
Summary
References and Further Reading
Chapter 9. Device Virtualization and Management
Device Virtualization
Backends and Frontends
Granting Control of a PCI Device
Exclusive Device Access Versus Trusted Driver Domains
Device Emulation with QEMU-DM
Future Directions
Summary
References and Further Reading
Chapter 10. Network Configuration
Network Virtualization Overview
Designing a Virtual Network Topology
Bridging, Routing, and Network Address Translation
Frontend and Backend Network Drivers and Naming
Overview of Network Configuration in Xen
Details of Bridging Mode
Details of Routing Mode
Details of NAT Mode
Configuring Purely Virtual Network Segments
Assigning MAC Addresses to Virtual Network Interfaces
Assigning IP Addresses
Handling Multiple Network Interfaces in a Domain
vnet—Domain Virtual Network
Summary
References and Further Reading
Chapter 11. Securing a Xen System
Structuring Your System for Security
Securing the Privileged Domain
Firewall and Network Monitors
Mandatory Access Control with sHype and Xen Security Modules
DomU Security
Summary
References and Further Reading
Chapter 12. Managing Guest Resources
Accessing Information about Guests and the Hypervisor
Allocating Guest Memory
Managing Guest Virtual CPUs
Tuning the Hypervisor Scheduler
Choosing a Guest IO Scheduler
Summary
References and Further Reading
Chapter 13. Guest Save, Restore, and Live Migration
Representing the State of a Virtual Machine
Basic Guest Domain Save and Restore
Types of Guest Relocation
Preparing for xm migrate
Experience with xm migrate
Summary
References and Further Reading
Chapter 14. An Overview of Xen Enterprise Management Tools
Programmatic Interfaces to the Xen Hypervisor
Citrix XenServer Enterprise, Standard, and XenExpress Editions
Virtual Iron
IBM Virtualization Manager
Enomalism
virt-manager
XenMan
Managing Multiple Systems
Summary
References and Further Reading
Appendix A. Resources
Xen Community
XenWiki
Xen Mailing Lists and Bug Reporting
Xen Summits
Xen Source Code
Academic Papers and Conferences
Distribution-Specific Resources
Appendix B. The xm Command
Appendix C. Xend Configuration Parameter
Appendix D. Guest Configuration Parameter
Appendix E. Xen Performance Evaluation
Xen Performance Measurements
Performance Isolation in Xen
Performance of Xen Virtual Network and Real Network
Summary
Index

Another Virtualization Books
Download Continue Reading ...

Virtualization and the On Demand Business

In this chapter, we introduce the concept of virtualization. We start by looking at general business and organization virtualization techniques, and then examine the key types of technical virtualization, discussing server, storage and network virtualization. Finally, we briefly review application virtualization and look at the emerging Web Services (WS) and service-oriented architecture (SOA) paradigm.


Increasingly through the 1990s business, governments, education and other segments
adopted virtualization techniques to maximize organizational and business opportunities, while simultaneously increasing their reach and reducing their costs. Simple examples of virtual organizations are businesses that outsourced departments and functions which other organizations could do better and more effectively; this included parts of their business which were not considered core, and areas in which the organization was not specialized.

Consider, for example, the areas of catering and building maintenance. Until the late 1980s, many businesses and organizations had departments and internal organizations that handled building planning and maintenance, as well as ordering, preparing and delivering food and beverage services to the employees of the organization. In the 1990s, it became commonplace for specialized companies to take over these roles and responsibilities. These specialized companies had better contacts, more buying power and flexibility, and could often deliver the same or improved services at lower cost than the organization itself. In many cases the organization’s own employees were transferred to the specialized company, and yet continued to work in the same place, doing much the same job—they had in essence become “virtual” employees.

Another Virtualization Books
Download
Continue Reading ...

Foundation and Empire

PROLOGUE
The Galactic Empire Was Falling.
It was a colossal Empire, stretching across millions of worlds from arm-end to arm-end of the mighty multi-spiral that was the Milky Way. Its fall was colossal, too - and a long one, for it had a long way to go.
It had been falling for centuries before one man became really aware of that fall. That man was Hari Seldon, the man who represented the one spark of creative effort left among the gathering decay. He developed and brought to its highest pitch the science of psychohistory.
Psychohistory dealt not with man, but with man-masses. It was the science of mobs; mobs in their billions. It could forecast reactions to stimuli with something of the accuracy that a lesser science could bring to the forecast of a rebound of a billiard ball. The reaction of one man could be forecast by no known mathematics; the reaction of a billion is something else again.
Hari Seldon plotted the social and economic trends of the time, sighted along the curves and foresaw the continuing and accelerating fall of civilization and the gap of thirty thousand years that must elapse before a struggling new Empire could emerge from the ruins.
It was too late to stop that fall, but not too late to narrow the gap of barbarism. Seldon established two Foundations at “opposite ends of the Galaxy” and their location was so designed that in one short millennium events would knit and mesh so as to force out of them a stronger, more permanent, more benevolent Second Empire.
Foundation (Gnome Press, 1951) has told the story of one of those Foundations during the first two centuries of life.
It began as a settlement of physical scientists on Terminus, a planet at the extreme end of one of the spiral arms of the Galaxy. Separated from the turmoil of the Empire, they worked as compilers of a universal compendium of knowledge, the Encyclopedia Galactica, unaware of the deeper role planned for them by the already-dead Seldon,
As the Empire rotted, the outer regions fell into the hands of independent “kings.” The Foundation was threatened by them. However, by playing one petty ruler against another, under the leadership of their first mayor, Salvor Hardin, they maintained a precarious independence. As sole possessors, of nuclear power among worlds which were losing their sciences and falling back on coal and oil, they even established an ascendancy. The Foundation became the “religious” center of the neighboring kingdoms.
Slowly, the Foundation developed a trading economy as the Encyclopedia receded into the background. Their Traders, dealing in nuclear gadgets which not even the Empire in its heyday could have duplicated for compactness, penetrated hundreds of light-years through the Periphery.
Under Hober Mallow, the first of the Foundation’s Merchant Princes, they developed the techniques of economic warfare to the point of defeating the Republic of Korell, even though that world was receiving support from one of the outer provinces of what was left of the Empire.
At the end of two hundred years, the Foundation was the most powerful state in the Galaxy, except for the remains of the Empire, which, concentrated in the inner third of the Milky Way, still controlled three quarters of the population and wealth of the Universe.
It seemed inevitable that the next danger the Foundation would have to face was the final lash of the dying Empire.
The way must he cleared for the battle of Foundation and Empire.

Another Novel Books
Download Continue Reading ...

Foundation and Earth

ON August 1, 1941, when I was a lad of twenty-one, I was a graduate student in chemistry at Columbia University and had been writing science fiction professionally for three years. I was hastening to see John Campbell, editor of Astounding, to whom I had sold five stories by then. I was anxious to tell him a new idea I had for a science fiction story.
It was to write a historical novel of the future; to tell the story of the fall of the Galactic Empire. My enthusiasm must have been catching, for Campbell grew as excited as I was. He didn’t want me to write a single story. He wanted a series of stories, in which the full history of the thousand years of turmoil between the fall of the First Galactic Empire and the rise of the Second Galactic Empire was to be outlined. It would all be illuminated by the science of “psychohistory” that Campbell and I thrashed out between us.
The first story appeared in the May 1942 Astounding and the second story appeared in the June 1942 issue. They were at once popular and Campbell saw to it that I wrote six more stories before the end of the decade. The stories grew longer, too. The first one was only twelve thousand words long. Two of the last three stories were fifty thousand words apiece.
By the time the decade was over, I had grown tired of the series, dropped it, and went on to other things. By then, however, various publishing houses were beginning to put out hardcover science fiction books. One such house was a small semiprofessional firm, Gnome Press. They published my Foundation series in three volumes: Foundation (1951); Foundation and Empire (1952); and Second Foundation (1953). The three books together came to be known as The Foundation Trilogy.
The books did not do very well, for Gnome Press did not have the capital with which to advertise and promote them. I got neither statements nor royalties from them.
In early 1961, my then editor at Doubleday, Timothy Seldes, told me he had received a request from a foreign publisher to reprint the Foundation books. Since they were not Doubleday books, he passed the request on to me.
I shrugged my shoulders. “Not interested, Tim. I don’t get royalties on those books.”
Seldes was horrified, and instantly set about getting the rights to the books from Gnome Press (which was, by that time, moribund) and in August of that year, the books (along with I, Robot) became Doubleday property.
From that moment on, the Foundation series took off and began to earn increasing royalties. Doubleday published the Trilogy in a single volume and distributed them through the Science Fiction Book Club. Because of that the Foundation series became enormously well-known.
In the 1966 World Science Fiction Convention, held in Cleveland, the fans were asked to vote on a category of “The Best All-Time Series.” It was the first time (and, so far, the last) the category had been included in the nominations for the Hugo Award. The Foundation Trilogy won the award, which further added to the popularity of the series.
Increasingly, fans kept asking me to continue the series. I was polite but I kept refusing. Still, it fascinated me that people who had not yet been born when the series was begun had managed to become caught up in it.
Doubleday, however, took the demands far more seriously than I did. They had humored me for twenty years but as the demands kept growing in intensity and number, they finally lost patience. In 1981, they told me that I simply had to write another Foundation novel and, in order to sugar-coat the demand, offered me a contract at ten times my usual advance.
Nervously, I agreed. It had been thirty-two years since I had written a Foundation story and now I was instructed to write one 140,000 words long, twice that of any of the earlier volumes and nearly three times as long as any previous individual story. I re-read The Foundation Trilogy and, taking a deep breath, dived into the task.
The fourth book of the series, Foundation’s Edge, was published in October 1982, and then a very strange thing happened. It appeared in the New York Times bestseller list at once. In fact, it stayed on that list for twenty-five weeks, much to my utter astonishment. Nothing like that had ever happened to me.
Doubleday at once signed me up to do additional novels and I wrote two that were part of another series, The Robot Novels -And then it was time to return to the Foundation.
So I wrote Foundation and Earth, which begins at the very moment that Foundation’s Edge ends, and that is the book you now hold. It might help if you glanced over Foundation’s Edge just to refresh your memory, but you don’t have to. Foundation and Earth stands by itself. I hope you enjoy it


Another Novel Books
Download
Continue Reading ...