MARC보기
LDR00000nam u2200205 4500
001000000432924
00520200225104950
008200131s2019 ||||||||||||||||| ||eng d
020 ▼a 9781392498545
035 ▼a (MiAaPQ)AAI22587529
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 247004
0820 ▼a 004
1001 ▼a Ross, Caitlin J.
24510 ▼a Performance Analysis and Visualization Tools to Support the Codesign of Next Generation Computer Systems.
260 ▼a [S.l.]: ▼b Rensselaer Polytechnic Institute., ▼c 2019.
260 1 ▼a Ann Arbor: ▼b ProQuest Dissertations & Theses, ▼c 2019.
300 ▼a 128 p.
500 ▼a Source: Dissertations Abstracts International, Volume: 81-06, Section: B.
500 ▼a Advisor: Carothers, Christopher D.
5021 ▼a Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2019.
506 ▼a This item must not be sold to any third party vendors.
520 ▼a Discrete event simulation is a cost-effective tool for exploring the design space of next generation computer systems. Optimistic synchronization algorithms for PDES, such as Time Warp, allow for a model's inherent parallelism to be discovered using an out-of-order event detection and recovery scheme. When events are processed out of timestamp order, the simulation is rolled back to a prior state and events are re-executed in the correct order. Although optimistic protocols can be highly scalable, optimizing optimistic simulations to minimize time spent performing rolling backs is not a trivial task due to the number of factors that can affect the rollback behavior of the simulation.In this work, we demonstrate the efficacy of discrete event simulation in evaluating and improving the performance of parallel and distributed scientific analysis systems, such as the MG-RAST metagenomics analysis service provided by Argonne National Laboratory. We propose hardware and job scheduling changes to their system that can improve scalability under increased user workloads that are anticipated in the future. We use event-driven simulation to evaluate the proposed changes and compare them to the current infrastructure and job scheduling policies. However, the simulation exhibits poor parallel performance, which limits the size of the workloads able to be simulated for MG-RAST. This highlights the need for scalable analysis and visualization tools for use in optimistic PDES that can be used to gain insights to their rollback behavior and performance.To better our understanding of optimistic PDES, a dynamic instrumentation layer was introduced into the ROSS simulation framework that allows model developers to collect a variety of metrics across the model and simulation engine software layers. Because the instrumentation has the potential to collect large amounts of data that is infeasible for either storing to disk or transferring over a network from the supercomputer running the simulation to another system for analysis, we also developed the ROSS In Situ Analysis system (RISA) that can perform data reduction while the simulation data resides in memory. We demonstrate the usefulness of our instrumentation and analysis tools by performing visual analyses of high performance computing (HPC) network models built on top of the ROSS framework. With the visual analysis, we are able to find load and communication imbalances in the simulation and determine their causes. In addition, we perform perturbation studies of both the ROSS instrumentation and RISA. This compares instrumented and non-instrumented simulations to ensure that these tools do not significantly affect simulation performance nor introduce new performance bottlenecks.Finally, we also explore the use of three-dimensional animations for understanding both the time series model data as well as optimistic PDES performance of the CODES network models. Typically these simulations are visualized using information visualization techniques such as parallel coordinates and radial diagrams. However, adding spatial data to the compute nodes and routers of the HPC networks enables the visualization of simulation data in a context familiar with simulation users, such as network architects. Replaying time series model data, such as network congestion, over the network visualizations has helped to provide insight to hotspots that occur in HPC networks during simulation, and enable a visual comparison of different networks.
590 ▼a School code: 0185.
650 4 ▼a Computer science.
690 ▼a 0984
71020 ▼a Rensselaer Polytechnic Institute. ▼b Computer Science.
7730 ▼t Dissertations Abstracts International ▼g 81-06B.
773 ▼t Dissertation Abstract International
790 ▼a 0185
791 ▼a Ph.D.
792 ▼a 2019
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T15493002 ▼n KERIS ▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다.
980 ▼a 202002 ▼f 2020
990 ▼a ***1008102
991 ▼a E-BOOK