IEEE Symposium on Large Data Analysis and Visualization (LDAV) 2012
DOI: 10.1109/ldav.2012.6378983
|View full text |Cite
|
Sign up to set email alerts
|

In situ fragment detection at scale

Abstract: We explore the problem of characterizing fragments using Par-aView in situ with an explosion simulation. By running in situ we can see a much higher temporal view of the data as well as potentially compress the output to only those statistics about fragments we care about. However, the fragment finding must be able to scale as well as the simulation. In order to achieve the necessary scales, we borrow operations the simulation is already doing and take advantage of them within ParaView, demonstrating the resul… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
4
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 3 publications
2
4
0
Order By: Relevance
“…The refined version dramatically improves the performance. This corroborates our previous work [11], but we are now able to take the scaling out to a larger scale to see that the performance appears to be flattening out (although this might be in part due to a small number of blocks per core).…”
Section: Total Execution Timesupporting
confidence: 89%
See 2 more Smart Citations
“…The refined version dramatically improves the performance. This corroborates our previous work [11], but we are now able to take the scaling out to a larger scale to see that the performance appears to be flattening out (although this might be in part due to a small number of blocks per core).…”
Section: Total Execution Timesupporting
confidence: 89%
“…With this data, our refined algorithm skips the global communication leaving only the more scalable boundary-data passing. Our analysis shows that the refined algorithm is much more scalable than the baseline algorithm [11]. Unfortunately, we cannot apply the refined algorithm in the in transit workflow because this workflow redistributes the data and invalidates this neighborhood information from CTH.…”
Section: Experiments Drivermentioning
confidence: 98%
See 1 more Smart Citation
“…With this data, our refined algorithm skips the global communication leaving only the more scalable boundary-data passing. Our analysis shows that the refined algorithm is much more scalable than the baseline algorithm [10]. Unfortunately, we cannot apply the refined algorithm in the in transit workflow because this workflow redistributes the data and invalidates this neighborhood information from CTH.…”
Section: Application Drivermentioning
confidence: 98%
“…Subsequent work lead to the development of Catalyst [11] and the scaling of algorithms used in conjunction with CTH [10].…”
Section: Catalystmentioning
confidence: 99%