|
Contents |
6 |
|
|
Preface |
10 |
|
|
I GRID SYSTEMS |
13 |
|
|
GLOGIN - INTERACTIVE CONNECTIVITY FOR THE GRID* |
15 |
|
|
1. Introduction |
15 |
|
|
2. Overview of Approach |
16 |
|
|
Limitations of Globus-Gatekeeper |
16 |
|
|
Getting Interactive Connections |
17 |
|
|
3. Details of the Implementation |
18 |
|
|
Connection Establishment |
18 |
|
|
Secure Connection Establishment |
19 |
|
|
Getting shells and other commands |
20 |
|
|
Traffic forwarding |
20 |
|
|
4. Related Work |
21 |
|
|
5. Conclusions and Future Work |
22 |
|
|
Acknowledgments |
22 |
|
|
Notes |
22 |
|
|
References |
23 |
|
|
PARALLEL PROGRAM EXECUTION SUPPORT IN THE JGRID SYSTEM* |
25 |
|
|
1. Introduction |
25 |
|
|
2. Execution Support for the Grid |
26 |
|
|
3. Parallel execution support in JGrid |
26 |
|
|
The Batch Execution Service |
27 |
|
|
The Compute Service |
30 |
|
|
4. Results |
32 |
|
|
5. Conclusions and Future Work |
32 |
|
|
References |
32 |
|
|
VL-E: APPROACHES TO DESIGN A GRID-BASED VIRTUAL LABORATORY |
33 |
|
|
Introduction |
33 |
|
|
1. The Virtual Laboratory Architecture |
34 |
|
|
2. The concept of study in VL-E |
36 |
|
|
3. Resource management in VL-E |
36 |
|
|
4. Related Work |
38 |
|
|
5. Conclusions |
39 |
|
|
References |
40 |
|
|
SCHEDULING AND RESOURCE BROKERING WITHIN THE GRID VISUALIZATION KERNEL* |
41 |
|
|
1. Introduction |
41 |
|
|
2. Related Work |
42 |
|
|
3. The GVK Visualization Planner |
43 |
|
|
4. Visualization Task Decomposition |
44 |
|
|
5. Resource Information Gathering |
44 |
|
|
6. Algorithm Selection and Resource Mapping |
45 |
|
|
7. Visualization Pipeline Construction |
46 |
|
|
8. Conclusions and Future Work |
47 |
|
|
References |
47 |
|
|
II CLUSTER TECHNOLOGY |
49 |
|
|
MESSAGE PASSING VS. VIRTUAL SHARED MEMORY A PERFORMANCE COMPARISON |
51 |
|
|
1. Introduction |
51 |
|
|
2. The Virtual Shared Memory Paradigm |
53 |
|
|
3. Benchmarks |
54 |
|
|
Benchmark 1: Approximation |
54 |
|
|
Benchmark 2: Tree Structured Matrix Multiplications |
55 |
|
|
Benchmark 3: Eigenvector Accumulation |
55 |
|
|
4. Experimental Results |
55 |
|
|
5. Conclusion and Future Work |
57 |
|
|
References |
58 |
|
|
MPI-I/O WITH A SHARED FILE POINTER USING A PARALLEL VIRTUAL FILE SYSTEM IN REMOTE I/ O OPERATIONS |
59 |
|
|
1. Introduction |
59 |
|
|
2. Implementation of PVFS in Stampi |
60 |
|
|
3. Performance measurement |
62 |
|
|
Inter-machine data transfer |
63 |
|
|
Local I/O operations |
63 |
|
|
Remote MPI-I/O operations |
64 |
|
|
4. Summary |
65 |
|
|
Acknowledgments |
66 |
|
|
References |
66 |
|
|
AN APPROACH TOWARD MPI APPLICATIONS IN |
67 |
|
|
WIRELESS NETWORKS |
67 |
|
|
1. Introduction |
67 |
|
|
2. Reviewing the Fault Detection Mechanism |
68 |
|
|
3. Unconstrained Global Optimization for n-Dimensional Functions |
69 |
|
|
Parallel Program Without Wireless Channel State Detection |
69 |
|
|
Parallel Program With Wireless Channel State Detection |
71 |
|
|
Experimental Results |
72 |
|
|
4. Conclusions and Future Work |
73 |
|
|
References |
74 |
|
|
DEPLOYING APPLICATIONS IN MULTI- SAN SMP CLUSTERS |
75 |
|
|
1. Introduction |
75 |
|
|
2. Our Approach |
76 |
|
|
3. Representation of Resources |
76 |
|
|
Basic Organization |
77 |
|
|
Virtual Views |
78 |
|
|
4. Application Modelling |
78 |
|
|
Entities for Application Design |
78 |
|
|
A Modelling Example |
79 |
|
|
5. Mapping Logical into Physical Resources |
80 |
|
|
Laying Out Logical Resources |
80 |
|
|
Dynamic Creation of Resources |
81 |
|
|
6. Discussion |
82 |
|
|
Notes |
82 |
|
|
References |
82 |
|
|
III PROGRAMMING TOOLS |
83 |
|
|
EXAMPLES OF MONITORING AND PROGRAM ANALYSIS ACTIVITIES WITH DEWIZ |
85 |
|
|
1. Introduction |
85 |
|
|
2. Overview of |
86 |
|
|
3. Analysis of OpenMP and PVM Pograms with DEWIZ |
87 |
|
|
4. User-defined Visualization of Event-Graphs using the Client |
89 |
|
|
5. Conclusions and Future Work |
92 |
|
|
References |
93 |
|
|
INTEGRATION OF FORMAL VERIFICATION AND DEBUGGING METHODS IN P- GRADE ENVIRONMENT* |
95 |
|
|
1. Introduction to P- GRADE and DIWIDE |
95 |
|
|
2. Coloured Petri- net and Occurrence Graph |
98 |
|
|
3. Transformation steps from GRAPNEL to CPN |
98 |
|
|
4. Steering the macrostep debugger based on simulation |
100 |
|
|
5. Related works |
103 |
|
|
6. Summary, future goals |
103 |
|
|
References |
104 |
|
|
TOOLS FOR SCALABLE PARALLEL PROGRAM ANALYSIS - VAMPIR NG AND DEWIZ |
105 |
|
|
1. Introduction |
105 |
|
|
2. Tools for Parallel Program Analysis |
106 |
|
|
3. High- Performance Program Analysis with VNG |
108 |
|
|
4. Distributed Program Analysis with DeWiz |
109 |
|
|
5. Comparison and Insights |
110 |
|
|
6. Summary and Future Work |
112 |
|
|
Acknowledgments |
113 |
|
|
Notes |
113 |
|
|
References |
113 |
|
|
PROCESS MIGRATION IN CLUSTERS AND CLUSTER GRIDS * |
115 |
|
|
1. Introduction |
115 |
|
|
2. The Hungarian ClusterGrid Project |
116 |
|
|
3. The P-GRADE software development tool |
117 |
|
|
4. Migration in the 1st generation ClusterGrid |
118 |
|
|
5. Migration in the 2nd generation ClusterGrid |
120 |
|
|
6. Performance and Related Work |
121 |
|
|
7. Conclusion |
121 |
|
|
References |
122 |
|
|
IV P-GRADE |
123 |
|
|
GRAPHICAL DESIGN OF PARALLEL PROGRAMS WITH CONTROL BASED ON GLOBAL APPLICATION STATES USING AN EXTENDED P- GRADE SYSTEM |
125 |
|
|
1. INTRODUCTION |
125 |
|
|
2. PS-GRADE - SYNCHRONIZATION -ORIENTED P-GRADE SYSTEM |
126 |
|
|
3. EXAMPLE: A TSP SOLVED BY B&B METHOD |
127 |
|
|
4. CONCLUSIONS |
131 |
|
|
5. BIBLIOGRAPHY |
132 |
|
|
PARALLELIZATION OF A QUANTUM SCATTERING CODE USING P- GRADE: A CASE STUDY |
133 |
|
|
1. Introduction |
133 |
|
|
2. Re-structuring of the FORTRAN code |
134 |
|
|
3. Setting up the parallel code using P-GRADE |
136 |
|
|
4. Program performance analysis |
137 |
|
|
5. Summary |
139 |
|
|
Acknowledgments |
139 |
|
|
References |
140 |
|
|
TRAFFIC SIMULATION IN P-GRADE AS A GRID SERVICE |
141 |
|
|
1. Introduction |
141 |
|
|
2. Traffic simulation using P-Grade |
142 |
|
|
3. Grid Execution Management for Legacy Code Architecture |
143 |
|
|
4. Integrating GEMLCA with the P-Grade portal |
145 |
|
|
5. Conclusion |
146 |
|
|
Acknowledgments |
147 |
|
|
References |
148 |
|
|
DEVELOPMENT OF A GRID ENABLED CHEMISTRY APPLICATION |
149 |
|
|
1. Introduction |
149 |
|
|
2. Reaction-diffusion equations |
150 |
|
|
3. Parallel implementation in P-GRADE |
151 |
|
|
4. Performance results on non-dedicated cluster |
152 |
|
|
5. Performance results in the Grid |
154 |
|
|
6. Related works |
155 |
|
|
7. Summary |
155 |
|
|
References |
156 |
|
|
V APPLICATIONS |
157 |
|
|
SUPPORTING NATIVE APPLICATIONS IN WEBCOM- G |
159 |
|
|
1. Introduction |
159 |
|
|
Program Execution in WebCom-G 2. |
161 |
|
|
Extraction |
161 |
|
|
Annotation |
164 |
|
|
3. Automatic Parallelization |
164 |
|
|
4. Conclusions and Future Work |
165 |
|
|
Acknowledgments |
165 |
|
|
References |
165 |
|
|
GRID SOLUTION FOR E-MARKETPLACES INTEGRATED WITH LOGISTICS |
167 |
|
|
1. INTRODUCTION |
167 |
|
|
2. INTEGRATING LOGISTICS INTO EMARKETPLACES |
168 |
|
|
3. ROLE OF GRID COMPUTING IN EMARKETPLACES |
171 |
|
|
4. GRID EXECUTION MANAGEMENT FOR LEGACY CODE ARCHITECTURE |
172 |
|
|
5. GRID SERVICES BASED E-MARKETPLACE MODEL WITH GEMLCA |
173 |
|
|
6. SUMMARY |
174 |
|
|
7. ACKNOWLEDGEMENTS |
175 |
|
|
8. REFERENCES |
175 |
|
|
INCREMENTAL PLACEMENT OF NODES IN A LARGE- SCALE ADAPTIVE DISTRIBUTED MULTIMEDIA SERVER |
177 |
|
|
1. Introduction |
177 |
|
|
2. Related Work |
178 |
|
|
3. The problem model |
178 |
|
|
4. Incremental algorithm |
180 |
|
|
5. Results |
181 |
|
|
6. Conclusions and Further Work |
183 |
|
|
References |
183 |
|
|
COMPONENT BASED FLIGHT SIMULATION IN DIS SYSTEMS |
185 |
|
|
Introduction |
185 |
|
|
1. DIS system architecture |
186 |
|
|
2. Component interaction model |
187 |
|
|
Simulation object |
188 |
|
|
Remote object interaction |
191 |
|
|
Human operator |
192 |
|
|
3. Summary |
193 |
|
|
Notes |
193 |
|
|
References |
193 |
|
|
VI ALGORITHMS |
195 |
|
|
MANAGEMENT OF COMMUNICATION ENVIRONMENTS FOR MINIMALLY SYNCHRONOUS PARALLEL ML |
197 |
|
|
1. Introduction |
197 |
|
|
2. Minimally Synchronous Parallel ML |
198 |
|
|
3. Management of Communication Environments |
200 |
|
|
4. Comparison to Related Work |
202 |
|
|
5. Conclusions and Future Work |
203 |
|
|
References |
204 |
|
|
ANALYSIS OF THE MULTI-PHASE COPYING GARBAGE COLLECTION ALGORITHM |
205 |
|
|
Introduction |
205 |
|
|
1. Multi-Phase Copying Garbage Collection Algorithm |
206 |
|
|
2. Analysis of the algorithm |
207 |
|
|
Number of phases in the MC-GC algorithm |
209 |
|
|
3. Conclusion |
212 |
|
|
References |
212 |
|
|
A CONCURRENT IMPLEMENTATION OF SIMULATED ANNEALING AND ITS APPLICATION TO THE VRPTW OPTIMIZATION PROBLEM |
213 |
|
|
1. INTRODUCTION |
213 |
|
|
2. SIMULATED ANNEALING |
214 |
|
|
3. COMMUNICATION SCHEME OF CONCURRENT SIMULATED ANNEALING |
215 |
|
|
3.1 Implementation of communication with synchronization at solution acceptance events |
216 |
|
|
3.2 Tuning of the algorithm |
217 |
|
|
4. EXPERIMENTAL RESULTS |
219 |
|
|
4.1 VRPTW |
219 |
|
|
5. IMPLEMENTATION |
219 |
|
|
6. CONCLUSIONS |
220 |
|
|
REFERENCES |
221 |
|
|
Author Index |
222 |
|