3.1 MB - Evernote

More documents

Recommendations

Info

3.1.2 Service Migration 17 Ad Hoc Grid Aspects Because Ad Hoc Grids allow a transient collaboration of nodes and the fact that nodes can join or leave the collaboration at different times a Grid application cannot rely on the discovered resources to be available for the whole runtime of the application. One solution to reach some degree of certainty about the availability of resources within an Ad Hoc Grid is the introduction of a scheme where individual nodes of the Grid guarantee the availability of the resources provided by them for a certain time as suggested in [1]. But such guaranties might not be possible for all transient nodes, especially for personal individual nodes as shown in the example Ad hoc Grid B in section 2.1.1. Whether or not guarantees are used for the availability of resources an application running within an Ad Hoc Grid will have to migrate services or other resources from a node that wishes to leave the collaboration to another node that is available. The migration of services or processes within distributed systems is a known problem and a detailed description can be found in [32]. A Grid environment for Ad Hoc Grids will have to support service migration in order to adapt to the dynamically changing structure of the Grid. 3.1.3 Fault Tolerance Ad Hoc Grids can contain transient nodes like personal computer and there might be no guarantee for how long such nodes are available to the Grid application. In addition Ad Hoc Grids might be based on off-the-shelf computing and networking hardware that is more susceptible to hardware faults than special purpose build hardware. A Grid environment suitable for Ad Hoc Grids will therefore have to provide mechanisms that offer fault tolerance and that can handle the loss of the connection to a node or the unexpected disappearing of a node in a manner that is transparent to Grid applications using the Ad Hoc Grid. 3.1.4 Resource Discovery Resource discovery is one of the main tasks of Grid environments. It is often implemented by a special resource discovery service that keeps a directory of available
18 Ad Hoc Grid Aspects resources and their specifications. But in an Ad Hoc Grid this becomes more of a challenge because of its dynamically changing structure. The task of the resource discovery can be divided further into the sub tasks of node discovery and node property assessment [27]. The node discovery task deals with the detection of new nodes that are joining and existing nodes that are leaving the collaboration. In an Ad Hoc Grid this detection has to be optimised towards the detection of frequent changes in the Grid structure. When a new node has joined the collaboration then its properties and shared resources will have to be discovered which is described by the node property assessment task. In addition to this high-level resource information some Grid environments also provide low-level resource information about the nodes. Such low- level resource information can include properties like the operating system type and available hardware resources. But depending on the abstraction level implemented by the Grid environment such low-level resource information might not be needed nor be accessible for Grid applications. The minimum resource discovery functionality that an Ad Hoc Grid environment has to provide is the node discovery and more specifically the detection of new nodes joining the Grid structure and existing nodes that are leaving the structure. 3.2 ProActive ProActive is a Grid middleware implemented in Java that supports parallel, distributed, and concurrent computing including mobility and security features within a uniform framework [15]. It is developed and maintained as an open-source project at INRIA 4 and uses the Active Object pattern to provide remotely accessible objects that can act as Grid services or mobile agents. Calls to such active objects can be performed asynchronous using a future-based synchronisation scheme known as wait-by-necessity for return values. A detailed documentation including programming tutorials as well as the full source code can be found at the ProActive Web site [15]. 4 Institut national de recherche en informatique et en automatique (National Institute for Research in Computer Science and Control)
Page 1 and 2: TRANSACTION-ORIENTED SIMULATION IN
Page 3 and 4: Table of Content II Table of Conten
Page 5 and 6: IV Table of Content 6 VALIDATION OF
Page 7 and 8: Figures VI Figures Figure 1: Ad Hoc
Page 9 and 10: Tables VIII Tables Table 1: Change
Page 11 and 12: 2 Introduction synchronisation algo
Page 13 and 14: 2 Fundamental Concepts Fundamental
Page 15 and 16: Figure 1: Ad Hoc Grid architecture
Page 17 and 18: 8 Fundamental Concepts In continuou
Page 19 and 20: 10 Fundamental Concepts Two other a
Page 21 and 22: 12 Fundamental Concepts known as st
Page 23 and 24: 14 Fundamental Concepts event execu
Page 25: 3 Ad Hoc Grid Aspects 16 Ad Hoc Gri
Page 29 and 30: 20 Ad Hoc Grid Aspects means that a
Page 31 and 32: Parallel Transaction-oriented Simul
Page 33 and 34: 24 Parallel Transaction-oriented Si
Page 35 and 36: 4.2 Synchronisation algorithm 26 Pa
Page 49 and 50: 5 Implementation 40 Implementation
Page 51 and 52: 42 Implementation confirm a provisi
Page 53 and 54: 44 Implementation large numerical p
Page 55 and 56: 46 Implementation A detailed descri
Page 57 and 58: 48 Implementation But in a parallel
Page 59 and 60: 50 Implementation GPSS test models
Page 61 and 62: Simulation Controller side 52 Imple
Page 63 and 64: 54 Implementation technique describ
Page 65 and 66: Implementation Euclidean distance b
Page 67 and 68: 58 Implementation chain at the corr
Page 69 and 70: 60 Implementation The algorithm wil
Page 71 and 72: No Start Is Active Object body acti
Page 73 and 74: 5.3.2 GVT Calculation and End of Si
Page 75 and 76: 66 Implementation provisional simul
Page 77 and 78:
Implementation relatively basic per
Page 79 and 80:
70 Implementation log4j.logger.para
Page 81 and 82:
proactive-log4j 72 Implementation T
Page 83 and 84:
74 Implementation Memory Allocation
Page 85 and 86:
76 Validation of the Parallel Simul
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
6.4 Validation 4 84 Validation of t
Page 95 and 96:
Page 97 and 98:
… LpccEnabled=true LpccClusterNum
Page 99 and 100:
Validation 5.2 Validation of the Pa
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
7 Conclusions 96 Conclusions Even s
Page 107 and 108:
References 98 References [1] Amin K
Page 109 and 110:
[19] Krafft G. Parallelisation of T
Page 111 and 112:
Appendix A: Detailed GPSS Syntax 10
Page 113 and 114:
Reserved word: DEPART Syntax: [] DE
Page 115 and 116:
Reserved word: SEIZE Syntax: [] SEI
Page 117 and 118:
Setting: LpccClusterNumber Default
Page 119 and 120:
Appendix C: Simulator log4j loggers
Page 121 and 122:
Logger: parallelJavaGpssSimulator.l
Page 123 and 124:
114 Appendix D: Structure of the at
Page 125 and 126:
Appendix E: Documentation of select
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
!"#"$$%$&"'"(!))*+,-$"./#0$! 1$"))
Page 133 and 134:
Page 135 and 136:
!/+/.7/8$ Appendix E: Documentation
Page 137 and 138:
Returns: Appendix E: Documentation
Page 139 and 140:
!"#$%&''$()*)")$ +',)$-)$. #,/. !"#
Page 141 and 142:
!"#$%&'()#%*+,"-*.# Appendix E: Doc
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Constructor Detail !"#$%&'$(#$)*$%+
Page 155 and 156:
Page 157 and 158:
Validation 1.1, output of simulate:
Page 159 and 160:
Validation 2, output of LP: Appendi
Page 161 and 162:
Appendix F: Validation output logs
Page 163 and 164:
Validation 2, output of simulate: A
Page 165 and 166:
Validation 3.1, output of LP1: Appe
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Validation 4, output of LP1: Append
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
simulation for time 2000) (628) 20:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Validation 4, output of simulate: A
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
(135) 19:37:56,477 Total transactio
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
(68) 19:37:56,619 by the transactio
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
(1295) 14:25:22,740 Simulation stop
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
Page 237 and 238:
(68) 14:25:22,888 by the transactio
Page 239 and 240:
Validation 6.2, output of LP2: (1)
Page 241:
(32) (1,2) 0 765 Block: TRANSFER 0.
show all

3.1 MB - Evernote

Create successful ePaper yourself

Delete template?

Save as template?