TY - GEN
T1 - Exacution
T2 - 37th IEEE International Conference on Distributed Computing Systems, ICDCS 2017
AU - Klasky, Scott
AU - Suchyta, Eric
AU - Ainsworth, Mark
AU - Liu, Qing
AU - Whitney, Ben
AU - Wolf, Matthew
AU - Choi, Jong
AU - Foster, Ian
AU - Kim, Mark
AU - Logan, Jeremy
AU - Mehta, Kshitij
AU - Munson, Todd
AU - Ostrouchov, George
AU - Parashar, Manish
AU - Podhorszki, Norbert
AU - Pugmire, David
AU - Wan, Lipeng
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/13
Y1 - 2017/7/13
N2 - As we continue toward exascale, scientific data volume is continuing to scale and becoming more burdensome to manage. In this paper, we lay out opportunities to enhance state of the art data management techniques. We emphasize well-principled data compression, and using it to achieve progressive refinement. This can both accelerate I/O and afford the user increased flexibility when she interacts with the data. The formulation naturally maps onto enabling partitioning of the progressively improving-quality representations of a data quantity into different media-type destinations, to keep the highest priority information as close as possible to the computation, and take advantage of deepening memory/storage hierarchies in ways not previously possible. Careful monitoring is requisite to our vision, not only to verify that compression has not eliminated salient features in the data, but also to better understand the performance of massively parallel scientific applications. Increased mathematical rigor would be ideal,to help bring compression on a better-understood theoretical footing, closer to the relevant scientific theory, more aware of constraints imposed by the science, and more tightly error-controlled. Throughout, we highlight pathfinding research we have begun exploring related these topics, and comment toward future work that will be needed.
AB - As we continue toward exascale, scientific data volume is continuing to scale and becoming more burdensome to manage. In this paper, we lay out opportunities to enhance state of the art data management techniques. We emphasize well-principled data compression, and using it to achieve progressive refinement. This can both accelerate I/O and afford the user increased flexibility when she interacts with the data. The formulation naturally maps onto enabling partitioning of the progressively improving-quality representations of a data quantity into different media-type destinations, to keep the highest priority information as close as possible to the computation, and take advantage of deepening memory/storage hierarchies in ways not previously possible. Careful monitoring is requisite to our vision, not only to verify that compression has not eliminated salient features in the data, but also to better understand the performance of massively parallel scientific applications. Increased mathematical rigor would be ideal,to help bring compression on a better-understood theoretical footing, closer to the relevant scientific theory, more aware of constraints imposed by the science, and more tightly error-controlled. Throughout, we highlight pathfinding research we have begun exploring related these topics, and comment toward future work that will be needed.
KW - Compression
KW - Data management
KW - Progressive refinement
UR - http://www.scopus.com/inward/record.url?scp=85027248804&partnerID=8YFLogxK
U2 - 10.1109/ICDCS.2017.256
DO - 10.1109/ICDCS.2017.256
M3 - Conference contribution
AN - SCOPUS:85027248804
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 1927
EP - 1937
BT - Proceedings - IEEE 37th International Conference on Distributed Computing Systems, ICDCS 2017
A2 - Lee, Kisung
A2 - Liu, Ling
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 5 June 2017 through 8 June 2017
ER -