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

Recommendations

Info

186 T. Abdullah et al. show that the ad hoc grid becomes less efficient with increased degree of neighborhood in completely decentralized approach, due to the excessive messages being exchanged. The results also confirmed that an intermediate ad hoc grid infrastructure with multiple adaptive matchmakers is preferable in a local ad hoc grid. In future, we will investigate the resource discovery approaches in hybrid environments for multiple adaptive matchmakers approach, where both the centralized matchmaking and P2P matchmaking will occur. References 1. Anderson, D.P.: BOINC: A system for public-resource computing and storage. In: 5th IEEE/ACM International Workshop on Grid Computing (2004) 2. Chien, A., Calder, B., Elbert, S., Bhatia, K.: Entropia: Architecture and performance of an enterprise desktop grid system. JPDC 63(5), 597–610 (2003) 3. Germain, C., Néri, V., Fedak, G., Cappello, F.: XtremWeb: Building an experimental platform for global computing. In: Buyya, R., Baker, M. (eds.) GRID 2000. LNCS, vol. 1971, pp. 91–101. Springer, Heidelberg (2000) 4. Chien, A., Marlin, S., Elbert, S.T.: Resource management in the entropia system, pp. 431–450. Kluwer Academic Publishers, Dordrecht (2004) 5. Patil, A., Power, D.A., Morrison, J.P.: Economy-based computing with webcom. Journal of Computer and Information Science and Engineering 1(2), 82–89 (2007) 6. Cheema, A.S., Muhammad, M., Gupta, I.: Peer-to-peer discovery of computational resources for grid applications. In: Proceddings of GRID 2005 (2005) 7. Gupta, R., Sekhri, V., Somani, A.K.: CompuP2P: An architecture for internet computing using peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems 17(11), 1306–1320 (2006) 8. Iamnitchi, A., Foster, I.: On fully decentralized resource discovery in grid environments. In: Lee, C.A. (ed.) GRID 2001. LNCS, vol. 2242, pp. 51–62. Springer, Heidelberg (2001) 9. Moreno-Vozmediano, R.: A hybrid mechanism for resource/service discovery in ad-hoc grids. Future Generation Computer Systems (2008) (article in press) 10. Zhou, D., Lo, V.: Wavegrid: A scalable fast-turnaround heterogeneous peer-based desktop grid system. In: Proceedings of IPDPS 2006 (2006) 11. GRAPPA Project, http://ce.et.tudelft.nl/grappa/ 12. Abdullah, T., Alima, L.O., Sokolov, V., Calomme, D., Bertels, K.: Hybrid resource discovery mechanism in ad hoc grid using strucutred overlay. In: ARCS 2009 (2009) 13. Abdullah, T., Sokolov, V., Pourebrahimi, B., Bertels, K.: Self-organizing dynamic ad hoc grids. In: SASO 2008 Workshops (2008) 14. Pourebrahimi, B., Bertels, K., Kandru, G., Vassiliadis, S.: Market-based resource allocation in grids. In: Proceedings of e-Science 2006 (2006) 15. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001) 16. PlanetLab Online, https://www.planet-lab.org/
Compiler-Directed Performance Model Construction for Parallel Programs Martin Schindewolf 1 ,DavidKramer 1 , and Marcelo Cintra 2 1 Institute of Computer Science & Engineering Karlsruhe Institute of Technology (KIT) Haid-und-Neu-Straße 7 76131 Karlsruhe, Germany {schindewolf,kramer}@kit.edu 2 School of Informatics University of Edinburgh 10 Crichton Street Edinburgh EH8 9AB, United Kingdom mc@inf.ed.ac.uk Abstract. During the last decade, performance prediction for industrial and scientific workloads on massively parallel high-performance computing systems has been and still is an active research area. Due to the complexity of applications, the approach to deriving an analytical performance model from current workloads becomes increasingly challenging: automatically generated models often suffer from inaccurate performance prediction; manually constructed analytical models show better prediction, but are very labor-intensive. Our approach aims at closing the gap between compiler-supported automatic model construction and the manual analytical modeling of workloads. Commonly, performance-counter values are used to validate the model, so that prediction errors can be determined and quantified. Instead of manually instrumenting the executable for accessing performance counters, we modified the GCC compiler to insert calls to run-time system functions. Added compiler options enable the user to control the instrumentation process. Subsequently, the instrumentation focuses on frequently executed code parts. Similar to established frameworks, a run-time system is used to track the application behavior: traces are generated at run-time, enabling the construction of architecture independent models (using quadratic programming) and, thus, the prediction of larger workloads. In this paper, we introduce our framework and demonstrate its applicability to benchmarks as well as real world numerical workloads. The experiments reveal an average error rate of 9% for the prediction of larger workloads. 1 Introduction For many years, research in computer system architecture has aimed at modeling the performance of computer architectures and workloads. Performance modeling is widely applicable during a computing life-cycle: design, integration, C. Müller-Schloer, W. Karl, and S. Yehia (Eds.): ARCS 2010, LNCS 5974, pp. 187–198, 2010. c○ Springer-Verlag Berlin Heidelberg 2010
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 194 and 195: 182 T. Abdullah et al. (except when
Page 196 and 197: 184 T. Abdullah et al. % Matchmakin
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?