Architecture of Computing Systems (Lecture Notes in Computer ...

Recommendations

Info

Effect of the Degree of Neighborhood on Resource Discovery in Ad Hoc Grids Tariq Abdullah 1 ,KoenBertels 1 , Luc Onana Alima 2 , and Zubair Nawaz 1 1 Computer Engineering Laboratory, EEMCS, Delft University of Technology, Mekelweg 4, 2624 CD, Delft, The Netherlands {m.t.abdullah,k.l.m.bertels,z.nawaz}@tudelft.nl 2 LOA DEPENDABLE IT SYSTEMS S.A., 4, Rue d’Arlon, Luxemburg luc.onana.alima@loa-dits.com Abstract. Resource management is one of the important issues in the efficient use of grid computing, in general, and poses specific challenges in the context of ad hoc grids due to the heterogeneity, dynamism, and intermittent participation of participating nodes in the ad hoc grid. In this paper, we consider three different kinds of organizations in an ad hoc grid ranging from completely centralized to completely decentralized (P2P). On the basis of self organization mechanisms, we study the effect of the neighborhood degree of a node for finding resources on the efficiency of resource allocation. We investigate the message complexity of each organization and its corresponding efficiency in terms of task/resource matching and the response time. We show that the intermediate state of the ad hoc grid with multiple adaptive matchmakers outperforms both a completely centralized and a completely decentralized (P2P) infrastructure. 1 Introduction Recent advances in personal computer processing power and Internet bandwidth has enabled achieving tremendous computing power via opportunistic resource sharing [1,2,3]. Opportunistic resource sharing is done in very dynamic environments where the addition of new nodes, system/network failures or variation in resource availability is expected. Therefore, in this context, resource management becomes one of the most important and complex part of grid middleware. Resource discovery approaches for grids in general, and especially for ad hoc grids, can be categorized as completely centralized [1,3,4,5] and completely/ partially decentralized [6,7,8,9,10]. Generally, completely centralized resource discovery systems and peer-to-peer (P2P) systems are often considered to be mutually exclusive and residing on the two extremes of the infrastructural spectrum. In the GRAPPA project [11], we consider them to be a part of a continuum and study the effect of either of the extremes or any intermediate state between the two extremes using a micro-economic based resource discovery mechanism. This paper is based on our earlier work [12,13], where we presented the mechanisms and algorithms that enable the ad hoc grid to self-organize according to the C. Müller-Schloer, W. Karl, and S. Yehia (Eds.): ARCS 2010, LNCS 5974, pp. 174–186, 2010. c○ Springer-Verlag Berlin Heidelberg 2010
Effect of the Degree of Neighborhood on Resource Discovery 175 workload of the ad hoc grid. In this paper, we look at the impact of adoption of a particular infrastructure, taken from the infrastructural continuum. The contributions of this paper are as follow: First, we define the degree of neighborhood of a node for resource discovery in completely centralized, multiple adaptive matchmakers and in completely decentralized (P2P) environment in an ad hoc grid. Secondly, we analyze the effect of varying the degree of neighborhood in completely decentralized (P2P) ad hoc grid. Thirdly, we compare the results of varying the degree of neighborhood in completely decentralized approach with completely centralized approach and with multiple adaptive matchmakers approach. Fourthly, we perform the message complexity analysis of the above mentioned resource discovery approaches in order to understand the communication cost of a particular resource discovery approach. Finally, we give recommendations for trade offs in resource discovery on an infrastructural spectrum ranging from completely centralized to completely decentralized approaches in the ad hoc grids. The rest of the paper is organized as follows. Section 2 provides an overview of related work. Section 3 describes the required background knowledge to understand the proposed model. Section 4 explains the proposed model. Section 5 provides message complexity analysis. The experimental setup and results discussion are presented in Section 6, While section 7 concludes the paper and briefs about the future work. 2 Related Work Different approaches are used for resource discovery in the ad hoc grids. These approaches vary from completely centralized to completely decentralized ones. The completely centralized approaches [1,2,3,5] for the ad hoc grids employ a client-server architecture. A trusted server distributes the jobs to clients. The clients request jobs, the centralized server allocates the jobs to the clients, the clients run the jobs, and the server collects the results. The completely centralized approaches provide high throughput. However, robustness and reliability is maintained by the server. Furthermore, the above mentioned approaches have a single point of failure and the complete system becomes unavailable in case of network or server failure. In completely/semi decentralized approaches, each node or group of nodes negotiates for its required resources with other nodes. Iamnitchi et al. [8] proposed a resource discovery approach in completely decentralized grid environments and evaluated different request forwarding algorithms. Their approach employs time to live (TTL) for resource discovery. TTL represents the maximum hop count for forwarding a request to the neighboring nodes. The TTL approach is simple but may fail to find a resource, even though that resource exists somewhere in the grid. Attribute encoding [6,7] is used for resource discovery in structured overlay network. The available resources are mapped to the nodes of a P2P structured overlay network in the attribute encoding approach. There can be a load imbalance due to attribute encoding, when the majority of encoded attributes are mapped to a small set of nodes in the overlay network.
Page 2 and 3:
Lecture Notes in Computer Science 5
Page 4 and 5:
Volume Editors Christian Müller-Sc
Page 6 and 7:
General Chair Organization Christia
Page 8 and 9:
Organization IX Hartmut Schmeck Kar
Page 10 and 11:
Keynote Table of Contents HyVM - Hy
Page 12 and 13:
Table of Contents XIII JetBench:AnO
Page 14 and 15:
How to Enhance a Superscalar Proces
Page 16 and 17:
4 J. Mische et al. The Real-time Vi
Page 18 and 19:
6 J. Mische et al. 4.1 Instruction
Page 20 and 21:
8 J. Mische et al. Additionally the
Page 22 and 23:
10 J. Mische et al. % of unused pip
Page 24 and 25:
12 J. Mische et al. % of cycles spe
Page 26 and 27:
14 J. Mische et al. 16. Lickly, B.,
Page 28 and 29:
16 G. Aşılıoğlu, E.M. Kaya, and
Page 30 and 31:
Page 32 and 33:
Page 34 and 35:
Page 36 and 37:
Page 38 and 39:
26 T.B. Preußer, P. Reichel, and R
Page 40 and 41:
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
Page 50 and 51:
38 P. Bellasi, W. Fornaciari, and D
Page 52 and 53:
Page 54 and 55:
Page 56 and 57:
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
50 J. Zeppenfeld and A. Herkersdorf
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
62 B. Jakimovski, B. Meyer, and E.
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
Page 82 and 83:
Page 84 and 85:
Page 86 and 87:
74 M. Bonn and H. Schmeck Fig. 1. J
Page 88 and 89:
76 M. Bonn and H. Schmeck 2.2 Node
Page 90 and 91:
78 M. Bonn and H. Schmeck Uptime-ba
Page 92 and 93:
80 M. Bonn and H. Schmeck 2.4 Simul
Page 94 and 95:
82 M. Bonn and H. Schmeck done rate
Page 96 and 97:
84 M. Bonn and H. Schmeck Fig. 8. J
Page 98 and 99:
86 M. Bonn and H. Schmeck tells the
Page 100 and 101:
88 J.-P. Steghöfer et al. � �
Page 102 and 103:
90 J.-P. Steghöfer et al. mechanis
Page 104 and 105:
92 J.-P. Steghöfer et al. resource
Page 106 and 107:
94 J.-P. Steghöfer et al. Choose a
Page 108 and 109:
96 J.-P. Steghöfer et al. 1. Defin
Page 110 and 111:
98 J.-P. Steghöfer et al. and all
Page 112 and 113:
100 J.-P. Steghöfer et al. 19. Kim
Page 114 and 115:
102 K. Kloch et al. large-scale sys
Page 116 and 117:
104 K. Kloch et al. a�t� 1.0 0.
Page 118 and 119:
106 K. Kloch et al. constant. This
Page 120 and 121:
108 K. Kloch et al. Relative number
Page 122 and 123:
110 K. Kloch et al. (a) infection r
Page 124 and 125:
112 K. Kloch et al. (ii) Phase of a
Page 126 and 127:
114 P. Petoumenos et al. Studying t
Page 128 and 129:
116 P. Petoumenos et al. % of Misse
Page 130 and 131:
118 P. Petoumenos et al. IQ: n 4-in
Page 132 and 133:
120 P. Petoumenos et al. downsizing
Page 134 and 135:
122 P. Petoumenos et al. As long as
Page 136 and 137: 124 P. Petoumenos et al. comparable
Page 138 and 139: Exploiting Inactive Rename Slots fo
Page 140 and 141: 128 M. Kayaalp et al. In a supersca
Page 142 and 143: 130 M. Kayaalp et al. INSTRUCTION 1
Page 144 and 145: 132 M. Kayaalp et al. time. Alterna
Page 146 and 147: 134 M. Kayaalp et al. Fig. 3. Numbe
Page 148 and 149: 136 M. Kayaalp et al. The results o
Page 150 and 151: Efficient Transaction Nesting in Ha
Page 152 and 153: 140 Y. Liu et al. HTMs include TCC
Page 154 and 155: 142 Y. Liu et al. rollback T0 begin
Page 156 and 157: 144 Y. Liu et al. Processor core Pr
Page 158 and 159: 146 Y. Liu et al. 5.2 Results and A
Page 160 and 161: 148 Y. Liu et al. decreases, partia
Page 162 and 163: Decentralized Energy-Management to
Page 164 and 165: 152 B. Becker et al. Furthermore, t
Page 166 and 167: 154 B. Becker et al. An optimizing
Page 168 and 169: 156 B. Becker et al. smart-home man
Page 170 and 171: 158 B. Becker et al. freedom like w
Page 172 and 173: 160 B. Becker et al. Power [W] 4500
Page 174 and 175: EnergySaving Cluster Roll: Power Sa
Page 176 and 177: 164 M.F. Dolz et al. Themodulequeri
Page 178 and 179: 166 M.F. Dolz et al. This daemon al
Page 180 and 181: 168 M.F. Dolz et al. been submitted
Page 182 and 183: 170 M.F. Dolz et al. On the other h
Page 184 and 185: 172 M.F. Dolz et al. at the inactiv
Page 188 and 189: 176 T. Abdullah et al. A zone based
Page 190 and 191: 178 T. Abdullah et al. A consumer/p
Page 192 and 193: 180 T. Abdullah et al. Messages 140
Page 194 and 195: 182 T. Abdullah et al. (except when
Page 196 and 197: 184 T. Abdullah et al. % Matchmakin
Page 198 and 199: 186 T. Abdullah et al. show that th
Page 200 and 201: 188 M. Schindewolf, D. Kramer, and
Page 212 and 213: 200 R. Plyaskin and A. Herkersdorf
Page 224 and 225: 212 M.Y. Qadri, D. Matichard, and K
Page 234 and 235: A Tightly Coupled Accelerator Infra
Page 236 and 237:
224 F. Nowak and R. Buchty where A
Page 238 and 239:
226 F. Nowak and R. Buchty Fig. 3.
Page 240 and 241:
228 F. Nowak and R. Buchty Table 2.
Page 242 and 243:
230 F. Nowak and R. Buchty Table 4.
Page 244 and 245:
232 F. Nowak and R. Buchty 5.3 Comp
Page 246 and 247:
Optimizing Stencil Application on M
Page 248 and 249:
236 F. Xudong et al. compared to th
Page 250 and 251:
238 F. Xudong et al. stencil comput
Page 252 and 253:
240 F. Xudong et al. threads in the
Page 254 and 255:
242 F. Xudong et al. Speedup 14 12
Page 256 and 257:
244 F. Xudong et al. 5 Related Work
Page 258:
Abdullah, Tariq 174 Alima, Luc Onan
show all

Architecture of Computing Systems (Lecture Notes in Computer ...

Create successful ePaper yourself

Delete template?

Save as template?