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

Recommendations

Info

182 T. Abdullah et al. (except when d = n) and cannot search the resources of all participating nodes. Figure 3a and 3b compare the number of messages required to find a match in the varying the degree of neighborhood approach with centralized and multiple adaptive matchmakers approach, respectively, in the ad hoc grid. Although the distribution of ad hoc grid nodes among two or more matchmakers vary according to the workload of the matchmakers [12], we assume ni = n/m for the case of multiple adaptive matchmakers, while comparing the message complexity for varying the degree of neighborhood in completely decentralized approach with other two approaches in Figure 3a and 3b. 1MM represents one matchmaker of the centralized approach, whereas 2MM, ..., 5MM represent two or multiple matchmakers of the multiple adaptive matchmakers approach in Figure 3b. The number of messages exchanged in different resource discovery approaches are summarized in Table 1. 6 Experimental Setup and Results We developed our ad hoc grid experimental platform on top of Pastry [15]. Although we used Pastry, in principle any other structured overlay network can be used. Pastry is a self-organizing and adaptive overlay network. Pastry is used for node arrival/departure, node failure handling, and for message routing in this work. Node join/leave and Pastry message routing is explained in [15]. The experiments are executed on PlanetLab [16]. PlanetLab is a global, community-based effort and is used mostly for network related experiments. The PlanetLab nodes are connected through the Internet. Research institutions/ organizations contribute a minimum of 2 computing machines. The researchers of the corresponding institute/organization are granted access to a pool of more than 1000 PlanetLab nodes. The experiments are executed to answer the questions discussed in Section 1. The first set of experiments are executed to analyze the effect of varying the degree of neighborhood. In the second set of experiments, the experimental results with varying the degree of neighborhood are compared with total centralized approach and with multiple adaptive matchmakers approach for resource discovery in an ad hoc grid. The number of participating nodes varies from 15 to 650. The number of matchmakers varies from 1 to 5 in the experiments with multiple adaptive matchmakers. TTL of the request/offer messages is set to 10000 milliseconds in order to cater the delays observed in PlanetLab. In this work, we have only considered computational power (CPU cycle) as a resource. However, other resources like memory, bandwidth and disk storage can also be incorporated in this model. The job execution time, job deadline, budget, and request/offer computational resource amount are randomly generated from a predefined range. The request/offer resource quantity varies for each request/offer message. Data presented is obtained after the system reaches a steady state, when 1/4th of the experiment time is elapsed.
Effect of the Degree of Neighborhood on Resource Discovery 183 Matchmaking efficiency, response time and the message complexity are analyzed in these experiments. Message complexity analysis is explained in Section 5. The matchmaking efficiency in time interval T =[Tstart,Tend] is defined as: ( Tend � Tstart Tend � Matched Message/ Tstart T otal Message)∗100 Where Tstart and Tend represent the start and end time of the time interval T =[Tstart, Tend]. The response time denotes the time interval, starting from the time a message is received, and ends at the moment when a match is found for the received message. The response time is calculated as: RT = Tmatch−Treceive, where RT represents the response time, Tmatch is the time when the matchmaker agent found a matching offer/request for the received request/offer message and Treceive is the receiving time of the received request/offer message. All the experiments are executed in different network conditions, including task intensive (tasks >> resources), balanced (tasks ≈ resources) andresource intensive (tasks 1 in Figure 4a). The completely centralized approach shows higher matchmaking efficiency for small workloads. However, one matchmaker cannot maintain its matchmaking efficiency with the increasing work load. The matchmaking efficiency keeps on decreasing with increasing work load of the matchmaker. This phenomenon can be understood with the following explanation. With the increasing workload, the matchmaker has to process more messages, so it takes more time to find matched pairs. This results in an increased response time of the matchmaker. Since each request/offer message has a validity period (TTL), therefore the TTL of the request/offer messages start expiring with increased processing time of the matchmaker and consequently the matchmaking efficiency of the matchmaker decreases with increasing workload of the matchmaker. The work load threshold for one matchmaker system, decreasing matchmaking efficiency with increasing workload of a matchmaker are explained in our earlier work [13]. The matchmaking efficiency of multiple adaptive matchmakers approach is not affected by the increasing workload. The adaptive mechanism introduces
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 186 and 187: Effect of the Degree of Neighborhoo
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 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 ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?