12 research outputs found

    On The Energy Efficiency And Performance Of Irregular Application Executions On Multicore, Numa And Manycore Platforms

    No full text
    Until the last decade, performance of HPC architectures has been almost exclusively quantified by their processing power. However, energy efficiency is being recently considered as important as raw performance and has become a critical aspect to the development of scalable systems. These strict energy constraints guided the development of a new class of so-called light-weight manycore processors. This study evaluates the computing and energy performance of two well-known irregular NP-hard problems-the Traveling-Salesman Problem (TSP) and K-Means clustering-and a numerical seismic wave propagation simulation kernel-Ondes3D-on multicore, NUMA, and manycore platforms. First, we concentrate on the nontrivial task of adapting these applications to a manycore, specifically the novel MPPA-256 manycore processor. Then, we analyze their performance and energy consumption on those different machines. Our results show that applications able to fully use the resources of a manycore can have better performance and may consume from 3.8 × to 13 × less energy when compared to low-power and general-purpose multicore processors, respectively.763248Andreolli, C., Thierry, P., Borges, L., Yount, C., Skinner, G., Genetic algorithm based auto-tuning of seismic applications on multi and manycore computers (2014) EAGE Workshop on High Performance Computing for Upstream, Amsterdam, Netherlands, , http://dx.doi.org/10.3997/2214-4609.20141920, SeptemberAochi, H., Ulrich, T., Ducellier, A., Dupros, F., Michea, D., Finite difference simulations of seismic wave propagation for understanding earthquake physics and predicting ground motions: Advances and challenges (2013) J. Phys.: Conf. Ser., 454, p. 012010Aubry, P., Beaucamps, P.-E., Blanc, F., Bobin, B., Carpov, S., Cudennec, L., David, V., Sirdey, R., Extended cyclostatic dataflow program compilation and execution for an integrated manycore processor (2013) International Conference on Computational Science, ICCS, Vol. 18, pp. 1624-1633. , Elsevier Barcelona, SpainBoillot, L., Barucq, H., Calandra, H., Diaz, J., (Portable) task-based programming model for elastodynamics EAGE Workshop on HPC for Upstream, , Chania, GreeceBrooks, D., Bose, P., Schuster, S.E., Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors (2000) IEEE Micro, 20, pp. 26-44Castro, M., Francesquini, E., NguĂ©lĂ©, T.M., MĂ©haut, J.-F., Analysis of computing and energy performance of multicore, NUMA, and manycore platforms for an irregular application (2013) Workshop on Irregular Applications: Architectures & Algorithms (IA3) - Supercomputing Conference (SC), , ACM Denver, EUA p. Article No. 5Collino, F., Perfectly matched absorbing layers for the paraxial equations (1997) J. Comput. Phys., 131, pp. 164-180Cui, Y., Olsen, K., Jordan, T., Lee, K., Zhou, J., Small, P., Roten, D., Maechling, P., Scalable earthquake simulation on petascale supercomputers High Performance Computing, Networking, Storage and Analysis, SC, 2010 International Conference, pp. 1-20Datta, K., Kamil, S., Williams, S., Oliker, L., Shalf, J., Yelick, K., Optimization and performance modeling of stencil computations on modern microprocessors (2009) SIAM Rev., 51, pp. 129-159Dhillon, I., Modha, D., A data-clustering algorithm on distributed memory multiprocessors (2000) Large-Scale Parallel Data Mining, 1759, pp. 245-260. , M. Zaki, C.-T. Ho, Lecture Notes in Computer Science Springer Berlin, HeidelbergDupros, F., Aochi, H., Ducellier, A., Komatitsch, D., Roman, J., Exploiting intensive multithreading for the efficient simulation of 3D seismic wave propagation International Conference on Computational Science and Engineering, pp. 253-260. , SĂŁo Paulo, BrazilDupros, F., Do, H.-T., Aochi, H., On scalability issues of the elastodynamics equations on multicore platforms (2013) International Conference on Computational Science, ICCS, 18, pp. 1226-1234. , Procedia Computer Science Elsevier Barcelona, SpainDupros, F., Pousa, C., Carissimi, A., MĂ©haut, J.-F., Parallel simulations of seismic wave propagation on NUMA architectures (2010) International Parallel Computing Conference, ParCo, 19, pp. 67-74. , Advances in Parallel Computing IOS Press Lyon, FranceFleig, T., Mattes, O., Karl, W., Evaluation of adaptive memory management techniques on the Tilera TILE-Gx platform (2014) International Conference on Architecture of Computing Systems, ARCS, pp. 88-96. , VDE Verlag Luebeck, DeutschlandFurumura, T., Chen, L., Parallel simulation of strong ground motions during recent and historical damaging earthquakes in Tokyo, Japan (2005) Parallel Comput., 31, pp. 149-165. , Parallel Graphics and VisualizationGharaibeh, A., Santos-Neto, E., Costa, L.B.A., Ripeanu, M., The energy case for graph processing on hybrid CPU and GPU systems (2013) Proceedings of the 3rd Workshop on Irregular Applications: Architectures and Algorithms, pp. 21-28. , IA3'13 ACM New York, NY, USAGöddeke, D., Komatitsch, D., Geveler, M., Ribbrock, D., Rajovic, N., Puzovic, N., Ramirez, A., Energy efficiency vs. Performance of the numerical solution of PDEs: An application study on a low-Power ARM-Based cluster (2013) J. Comput. Phys., 237, pp. 132-150Gursoy, A., Data decomposition for parallel k-means clustering (2004) Parallel Processing and Applied Mathematics, 3019, pp. 241-248. , R. Wyrzykowski, J. Dongarra, M. Paprzycki, J. Was̈niewski, Lecture Notes in Computer Science Springer Berlin, HeidelbergHĂ€hnel, M., Döbel, B., Völp, M., HĂ€rtig, H., Measuring energy consumption for short code paths using RAPL (2012) ACM SIGMETRICS Perform. Eval. Rev., 40, pp. 13-17Jain, A.K., Dubes, R.C., (1988) Algorithms for Clustering Data, , Prentice-Hall, Inc. Upper Saddle River, NJ, USAKanungo, T., Mount, D., Netanyahu, N., Piatko, C., Silverman, R., Wu, A., An efficient k-means clustering algorithm: Analysis and implementation (2002) IEEE Trans. Pattern Anal. Mach. Intell., 24, pp. 881-892Kaufman, L., Rousseeuw, P.J., (1990) Finding Groups in Data: An Introduction to Cluster Analysis, , John Wiley and Sons New YorkLaporte, G., The traveling salesman problem: An overview of exact and approximate algorithms (1992) European J. Oper. Res., 59, pp. 231-247Larus, J., Spending Moore's dividend (2009) Commun. ACM, 52, pp. 62-69De Dinechin, B.D., De Massas, P.G., Lager, G., LĂ©ger, C., Orgogozo, B., Reybert, J., Strudel, T., A distributed run-time environment for the Kalray MPPA-256 integrated manycore processor (2013) Intl. Conference on Computational Science, ICCS, Vol. 18, pp. 1654-1663. , Elsevier Barcelona, SpainLi, H., Sudarsan, H.L., Stumm, M., Sevcik, K.C., Locality and loop scheduling on NUMA multiprocessors (1993) International Conference on Parallel Processing, ICPP, Vol. 2, pp. 140-147. , IEEE Computer Society Syracuse, USALove, R., Korner, K., CPU affinity (2003) Linux J., (111)Madariaga, R., Dynamics of an expanding circular fault (1976) Bull. Seismol. Soc. Amer., 66, pp. 639-666Moczo, P., Robertsson, J.O.A., Eisner, L., The finite-difference time-domain method for modeling of seismic wave propagation (2007) Advances in Wave Propagation in Heterogeneous Media, 48, pp. 421-516. , Advances in Geophysics Elsevier, Academic PressMorari, A., Tumeo, A., Villa, O., Secchi, S., Valero, M., Efficient sorting on the Tilera manycore architecture (2012) IEEE International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD, pp. 171-178. , IEEE Computer Society New York, USAOu, Z., Pang, B., Deng, Y., Nurminen, J., YlĂ€-JÀÀski, A., Hui, P., Energy and cost-efficiency analysis of ARM-based clusters (2012) IEEE/ACM Intl. Symposium on Cluster, Cloud and Grid Computing, CCGrid, pp. 115-123. , IEEE Computer Society Ottawa, CanadaPadoin, E.L., De Oliveira, D.A.G., Velho, P., Navaux, P., Time-to-solution and energy-to-solution: A comparison between ARM and Xeon (2012) Workshop on Applications for Multi-Core Architectures, WAMCA, pp. 48-53. , IEEE Computer Society New York, USARajovic, N., The low-power architecture approach towards exascale computing (2011) Workshop on Scalable Algorithms for Large-Scale Systems (ScalA), pp. 1-2. , ACM New York, USARao, S., Prasad, E.V., Venkateswarlu, N.B., A scalable k-means clustering algorithm on multi-core architecture (2009) Proceeding of International Conference on Methods and Models in Computer Science, pp. 1-9. , ICM2CS 2009Rodrigues, L., Zarate, L., Nobre, C., Freitas, H., Parallel and distributed kmeans to identify the translation initiation site of proteins Systems, Man, and Cybernetics, SMC, 2012 IEEE International Conference, pp. 1639-1645Rotem, E., Naveh, A., Ananthakrishnan, A., Weissmann, E., Rajwan, D., Power-management architecture of the intel microarchitecture code-named sandy bridge (2012) IEEE Micro, 32, pp. 20-27Tesser, R.K., Pilla, L.L., Dupros, F., Navaux, P.O.A., MĂ©haut, J.-F., Mendes, C., Improving the performance of seismic wave simulations with dynamic load balancing (2014) Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP, pp. 196-203. , IEEE Computer Society Turin, ItalyTotoni, E., Behzad, B., Comparing the power and performance of Intel's SCC to state-of-the-art CPUs and GPUs (2012) IEEE Intl. Symposium on Performance Analysis of Systems and Software, ISPASS, pp. 78-87. , IEEE Computer Society New Brunswick, CanadaXu, R., Wunsch, I.I.D., Survey of clustering algorithms (2005) IEEE Trans. Neural Netw., 16, pp. 645-67

    Using Simulation to Evaluate and Tune the Performance of Dynamic Load Balancing of an Over-decomposed Geophysics Application

    Get PDF
    Finite difference methods are, in general, well suited to execution on parallel machines and are thus commonplace in High Performance Computing. Yet, despite their apparent regularity, they often exhibit load imbalance that damages their efficiency. In this article, we first characterize the spatial and temporal load imbalance of Ondes3D, a seismic wave propagation simulator used to conduct regional scale risk assessment. Our analysis reveals that this imbalance originates from the structure of the input data and from low-level CPU optimizations. Such dynamic imbalance should, therefore, be quite common and can not be solved by any static approach or classical code reorganization. An effective solution for such scenarios, incurring minimal code modification, is to use AMPI/CHARM++. By over-decomposing the application, the CHARM++ runtime can dynamically rebalance the load by migrating data and computation at the granularity of an MPI rank. We show that this approach is effective to balance the spatial/temporal dynamic load of the application, thus drastically reducing its execution time. However, this approach requires a careful selection of the load balancing algorithm, its activation frequency, and of the over-decomposition level. These choices are, unfortunately, quite dependent on application structure and platform characteristics. Therefore, we propose a methodology that leverages the capabilities of the SimGrid simulation framework and allows to conduct such study at low experimental cost. Our approach relies on a combination of emulation, simulation, and application modeling that requires minimal code modification and yet manages to capture both spatial and temporal load imbalance and to faithfully predict the performance of dynamic load balancing. We evaluate the quality of our simulation by systematically comparing simulation results with the outcome of real executions and demonstrate how this approach can be used to quickly find the optimal load balancing configuration for a given application/hardware configuration.Les mĂ©thodes aux diffĂ©rences finies sont en gĂ©nĂ©ral bien adaptĂ©es au machines parallĂšles et donc assez courantes dans le domaine du calcul Ă  haute performance. Pourtant, en dĂ©pit de leurs apparentes rĂ©gularitĂ©s, il n'est pas rare qu'elles souffrent d'un dĂ©sĂ©quilibre de charge dommageable. Dans cet article, nous commençons par caractĂ©riser le dĂ©sĂ©quilibre de charge spatial et temporel d'Ondes3D, une application de simulation de propagation d'ondes sismiques utilisĂ©e pour faire de l'Ă©valuation de risque sismique Ă  l'Ă©chelle rĂ©gionale. Notre analyse rĂ©vĂšle que ce dĂ©sĂ©quilibre provient de la nature mĂȘme des donnĂ©es d'entrĂ©es et d'optimisations bas niveau du CPU. Ce type de dĂ©sĂ©quilibre dynamique est donc a priori relativement courant et ne peut ĂȘtre rĂ©solu par des approches statiques ou par des rĂ©organisations de code classiques. Une approche pragmatique et ne nĂ©cessitant que des modifications mineures du code consiste Ă  utiliser AMPI/CHARM++. En sur-dĂ©composant l'application, le runtime CHARM++ peut rĂ©Ă©quilibrer dynamiquement la charge en migrant les donnĂ©es et les calculs Ă  la granularitĂ© du processus MPI. Nous montrons que cette approche permet effectivement de rĂ©soudre le problĂšme de dĂ©sĂ©quilibre spatial et temporel de charge et ainsi de rĂ©duire drastiquement le temps d'exĂ©cution total. Cependant, cette approche nĂ©cessite a priori une sĂ©lection minutieuse de l'algorithme d'Ă©quilibrage de charge, de la frĂ©quence d'activation ou du niveau de sur-dĂ©composition. Ces choix sont hĂ©las en gĂ©nĂ©ral assez dĂ©pendants de la structure de l'application et des caractĂ©ristiques de la plate-forme (\ie le nombre de processeurs et leur vitesse, la topologie et la vitesse du rĂ©seau). Nous proposons donc une mĂ©thodologie se basant sur l'environnement de simulation SimGrid et permettant de rĂ©aliser ce type d'Ă©tude Ă  faible coĂ»t. Notre approche repose sur une combinaison d'Ă©mulation, de simulation et de modĂ©lisation d'application qui ne nĂ©cessite que des modifications minimes du code d'origine et permet Ă  la fois de capturer le dĂ©sĂ©quilibre spatial et temporel et de prĂ©dire de façon fiable les performances de l'Ă©quilibrage de charge. Nous Ă©valuons la qualitĂ© de notre proposition en comparant de façon systĂ©matique les rĂ©sultats de notre simulation avec ceux d'expĂ©riences rĂ©elles. Nous montrons ensuite comment cette approche peut ĂȘtre utilisĂ©e pour dĂ©terminer rapidement les paramĂštres optimaux d'Ă©quilibrage de charge pour une configuration applicative/matĂ©rielle donnĂ©e

    Influential parameters on 3-D synthetic ground motions in a sedimentary basin derived from global sensitivity analysis

    No full text
    International audienceSUMMARY Which physical parameters are the most influential when predicting earthquake ground motions in a 3-D sedimentary basin? We answer quantitatively by doing a global sensitivity analysis of two quantities of interest: the peak ground motions (PGMs) and a time–frequency representation (the S transform) of ground motions resulting from the synthetic anelastic responses of the EUROSEISTEST. This domain of interest is modeled by two layers with uncertain depth-dependent mechanical properties and is illuminated by a plane S-wave propagating vertically upward in an uncertain homogeneous elastic bedrock. The global sensitivity analysis is conducted on 800+ physics-based simulations of the EUROSEISTEST requiring 8+ million core-hours (i.e. ≈ 900 yr of mono-core computation). The analysis of the PGMs at the free surface displays the spatial influence of the uncertain input parameters over the entire basin scale, while the analysis of the time–frequency representation shows their influence at a specific location inside the basin. The global sensitivity analysis done on the PGMs points out that their most influential parameter in the middle of the basin is the quality factor QS (it controls up to 80 per cent of the PGMs in certain locations where the sediments thickness is larger than 200 m). On the other hand, the geological layering configuration (here represented by the depth of a geological interface controlling the geological layering) strongly influences the PGMs close to the basin edges, up to 90 per cent. We also found that the shear wave velocity at the free surface of the basin and the one of the bedrock underlying the basin are to be considered on an equal footing, both influencing the PGMs in the middle of the basin and close to its edges. We highlight that the bedrock to basin amplification of the PGMs shows a clear increase with respect to the thickness of the sediments, but this amplification saturates from 200 m of sediments around the value of three and is frequency dependent. This PGMs amplification starts from about one tenth of the mean S-wavelength propagating in the basin. The global sensitivity analysis done on the S transform of the ground motions shows that (i) the own effect of the parameters fully controls the first S-wave train and mostly controls the direct arrival of the basin-induced surfaces waves, (ii) the quality factor QS controls 40–60 per cent of the decay of amplitude of coda waves, the remaining part being mainly controlled by interaction effects due to the coupling effect of several parameters and (iii) the interaction effects between the parameters increases with time, suggesting under the hypotheses of our study that the own effects control the ballistic wave propagation while the interaction effects control the diffusive wave propagation
    corecore