A Case Study in Computational Caching Microservices for HPC

A case study is presented that provides computation caching (memoization) through a microservice architecture to high-performance computing (HPC) applications, particularly the ExMatEx proxy application CoEVP (Co-designed Embedded ViscoPlasticity Scale-bridging). CoEVP represents a class of multiscale physics methods in which inexpensive coarse-scale models are combined with expensive fine-scale models to simulate physical phenomena scalably across multiple time and length scales. Recently, CoEVP has employed interpolation based on previously executed fine-scale models in order to reduce the number of fine-scale evaluations needed to advance the simulation. Building on this work, we envision that distributed microservices composed to provide new capabilities to large-scale parallel applications can be an important component in simulating ever-larger systems at ever-greater fidelities. We explore three aspects of a microservice composition for interpolation-based memoization in our study. First, we present a cost assessment of CoEVP's current fine-scale modeling and interpolation approach. Second, we present an alternative interpolation strategy in which interpolation models are directly constructed on demand from previous fine-scale evaluations: a "database of points" rather than a "database of models." Third, we evaluate the characteristics of the two approaches with and without cross-process sharing of database entries. Lessons learned from the study are used to inform designs for future work in developing distributed, large-scale memoization services for HPC.

[1]  Alexandr Andoni,et al.  Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[2]  George Bosilca,et al.  The Common Communication Interface (CCI) , 2011, 2011 IEEE 19th Annual Symposium on High Performance Interconnects.

[3]  Blas P. Uberuaga,et al.  The parallel replica dynamics method – Coming of age , 2015 .

[4]  Mayank Bawa,et al.  LSH forest: self-tuning indexes for similarity search , 2005, WWW '05.

[5]  Richard I. Hartley,et al.  Optimised KD-trees for fast image descriptor matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Samuel Greengard Better memory , 2016, Commun. ACM.

[7]  David Novak,et al.  Large-scale similarity data management with distributed Metric Index , 2012, Inf. Process. Manag..

[8]  Evgueni I. Kassianov,et al.  The multi-scale aerosol-climate model PNNL-MMF: model description and evaluation , 2010 .

[9]  Richard D. Hornung,et al.  Embedded polycrystal plasticity and adaptive sampling , 2008 .

[10]  Richard D. Hornung,et al.  Adaptive sampling in hierarchical simulation , 2007 .

[11]  Christoph Junghans,et al.  Database assisted distribution to improve fault tolerance for multiphysics applications , 2015, Co-HPC@SC.

[12]  Martin Schulz,et al.  Exploring Traditional and Emerging Parallel Programming Models Using a Proxy Application , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[13]  Edzer Pebesma,et al.  Spatial interpolation in massively parallel computing environments , 2011 .

[14]  Pietro Perona,et al.  Distributed Kd-Trees for Retrieval from Very Large Image Collections , 2011 .

[15]  David G. Lowe,et al.  Scalable Nearest Neighbor Algorithms for High Dimensional Data , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Robert B. Ross,et al.  Mercury: Enabling remote procedure call for high-performance computing , 2013, 2013 IEEE International Conference on Cluster Computing (CLUSTER).

[17]  Kipton Barros,et al.  Spatial adaptive sampling in multiscale simulation , 2014, Comput. Phys. Commun..

[18]  Ricardo A. Lebensohn,et al.  A self-consistent anisotropic approach for the simulation of plastic deformation and texture development of polycrystals : application to zirconium alloys , 1993 .

[19]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[20]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.

[21]  Robert B. Ross,et al.  Enabling NVM for Data-Intensive Scientific Services , 2016, INFLOW@OSDI.