A Case Study in Computational Caching Microservices for HPC

被引:4
作者
Jenkins, John [1 ]
Shipman, Galen [2 ]
Mohd-Yusof, Jamaludin [2 ]
Barros, Kipton [2 ]
Carns, Philip [1 ]
Ross, Robert [1 ]
机构
[1] Argonne Natl Lab, Argonne, IL 60439 USA
[2] Los Alamos Natl Lab, Los Alamos, NM USA
来源
2017 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW) | 2017年
关键词
NEAREST-NEIGHBOR; ALGORITHMS;
D O I
10.1109/IPDPSW.2017.40
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1309 / 1316
页数:8
相关论文
共 27 条
[1]   Distributed Kd-Trees for Retrieval from Very Large Image Collections [J].
Aly, Mohamed ;
Munich, Mario ;
Perona, Pietro .
PROCEEDINGS OF THE BRITISH MACHINE VISION CONFERENCE 2011, 2011,
[2]   Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions [J].
Andoni, Alexandr ;
Indyk, Piotr .
COMMUNICATIONS OF THE ACM, 2008, 51 (01) :117-122
[3]  
[Anonymous], 2016, ARBITRARY LAGRANGIAN
[4]  
[Anonymous], 2016, 4 WORKSH INT NVM FLA
[5]  
[Anonymous], 2013, CLUSTER, DOI DOI 10.1109/CLUSTER.2013.6702617
[6]  
Atchley S., 2011, Proceedings of the 2011 IEEE 19th Annual Symposium on High-Performance Interconnects (HOTI 2011), P51, DOI 10.1109/HOTI.2011.17
[7]   Embedded polycrystal plasticity and adaptive sampling [J].
Barton, Nathan R. ;
Knap, Jaroslaw ;
Arsenlis, Athanasios ;
Becker, Richard ;
Hornung, Richard D. ;
Jefferson, David R. .
INTERNATIONAL JOURNAL OF PLASTICITY, 2008, 24 (02) :242-266
[8]  
Bawa M, 2005, WWW 05, DOI [DOI 10.1145/1060745.1060840, 10.1145/1060745.1060840]
[9]  
Dorr M, 2014, LLNLSM655180
[10]  
Dorr MR, 2012, LLNLSM595112