REVIEW 3 major objections 4 minor 12 references
The paper reports that a hybrid MPI-OpenMP version of the VisIVO Importer decreases execution time as node count rises from one to four on GADGET simulation datasets up to 320 GB, and presents this as evidence that the visualization pipelin
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
VisIVO, a long-standing astrophysics visualization toolkit, is being prepared for exascale systems, with preliminary MPI-OpenMP scaling tests on up to four nodes showing faster imports for large GADGET simulation files.
T0 review reviewed 2026-08-05 challenge →
load-bearing objection A modest, honest project-status paper whose only concrete result—a 4-node scaling test—is too thinly documented to carry the exascale title, but it is a reasonable roadmap paper for an astrophysics software audience. the 3 major comments →
High performance visualization for Astronomy and Cosmology: the VisIVO's pathway toward Exascale systems
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
Core claim
The central finding is preliminary but concrete: a hybrid MPI-OpenMP implementation of the VisIVO Importer reduces execution time when the node count grows from one to four for GADGET datasets up to 320 GB. Thread scaling is strongest up to four threads and gives no significant gain beyond eight. The authors interpret this as evidence that the importer stage can keep up with large simulation snapshots on high-performance systems, making in-situ or in-transit visualization feasible for the petabyte-scale outputs of codes like GADGET and PLUTO.
What carries the argument
The load-bearing component is the VisIVO Importer, the module that converts raw simulation output into a format the visualization tools can consume. The mechanism is hybrid MPI-OpenMP parallelism: one MPI process per node partitions the dataset across nodes, and OpenMP threads use the cores within each node. A parallel filesystem provides shared access to the large snapshot files. The importer's behavior determines the cost of the first pipeline stage, so its scalability sets an upper bound on how quickly a scientist can start exploring a new simulation.
Load-bearing premise
The scaling conclusion assumes the reported run times are accurate and representative, but no error bars or repeated-run statistics are given, so the one-to-four-node comparison could be distorted by I/O contention or caching.
What would settle it
Repeat the 320 GB GADGET import test on 8, 16, and 32 nodes, with several runs per configuration to estimate timing variance. If execution time does not continue to drop as nodes increase, or if the four-node speedup vanishes on a different parallel filesystem, the paper's scalability claim and its exascale pathway would be undermined.
If this is right
- If node-count scaling continues beyond four nodes, VisIVO Importer can ingest 100+ GB snapshots quickly enough for interactive visualization on HPC systems.
- The same hybrid MPI-OpenMP strategy can be extended to other VisIVO modules, not only the importer.
- Portable workflow descriptions and containerized modules let the pipeline run on HPC, cloud, or mixed resources without rewriting the code.
- Fast I/O middleware could relieve the dominant bottleneck of reading and converting huge files without changing VisIVO itself.
- An openly licensed, versioned workflow representation improves reproducibility and maintainability.
Where Pith is reading between the lines
- The four-node test is too small to prove exascale readiness; the decisive evidence would be a run on dozens or hundreds of nodes with repeated timing to measure variance.
- A natural next experiment is to vary the number of MPI processes per node, not just one per node, and to separate file-read time from format-conversion time.
- The same scaling protocol applied to PLUTO snapshots would show whether the node-scaling gain is specific to GADGET files or general across formats.
- If the workflow abstraction matures, VisIVO could become a standard front-end that lets scientists launch visualization directly on the machine holding the simulation data.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper reports on the ongoing evolution of VisIVO, a visualization tool for astrophysics, toward high-performance visualization on pre-exascale/exascale systems. The authors describe plans to port VisIVO to HPC facilities using containerization, workflow abstractions (CWL, StreamFlow), interactive computing services, and fast I/O middleware (CAPIO). Preliminary scalability tests of a hybrid MPI-OpenMP implementation of the VisIVO Importer are presented for GADGET datasets up to 320 GB on the Pleiadi cluster, with execution times reportedly decreasing as the number of nodes increases from 1 to 4. The paper is positioned as a work-in-progress report rather than a completed study.
Significance. The paper addresses a real and growing need: interactive visualization and analysis of petabyte-scale cosmological simulation data on HPC systems. Its main concrete contribution is a preliminary scalability measurement of the VisIVO Importer (Sec. 4.1), which, if robust, would support the feasibility of adapting VisIVO to larger HPC systems. The authors also contribute an open-source CWL workflow example (Apache 2.0) and a clear exposition of planned integration with StreamFlow, Jupyter, and CAPIO. These are useful incremental steps, though the results are preliminary and the exascale pathway is currently a roadmap rather than a demonstrated capability.
major comments (3)
- [Sec. 4.1, Fig. 1] The central quantitative claim—that VisIVO Importer execution time 'significantly decreases' as nodes increase—is not supported with numeric evidence. The figure appears to lack axis labels, units, and error bars; the text gives no execution-time values, speedup factors, number of runs, or measurement uncertainties. Since this single result underlies the paper's exascale-pathway claim, please provide a table of measured times (with units), run-to-run statistics, and a clear description of the measurement procedure (e.g., number of repetitions, whether the displayed values are medians or means, and the state of filesystem caches).
- [Sec. 4.1, experimental design] The reported test conflates strong scaling with per-node working-set reduction. With one MPI process per node and a fixed 320 GB dataset, increasing from 1 to 4 nodes reduces the data handled per node from 320 GB to 80 GB; concurrently, aggregate client-side page cache and BeeGFS I/O worker count increase. The observed wall-clock decrease could therefore be driven by caching or aggregate filesystem bandwidth rather than by the MPI-OpenMP importer itself. To make the scaling claim load-bearing, please decompose the execution time into I/O and compute components, or run a weak-scaling experiment with per-node data size held constant, and report cache-warming conditions.
- [Sec. 3, Sec. 4.1] The phrase 'pathway toward Exascale systems' is not supported by the 4-node, 144-core test, which is several orders of magnitude below pre-exascale scale. This is not inherently an error, but the paper should explicitly acknowledge that the presented scalability test is a very early-stage proof-of-concept and that extrapolation to exascale is not yet justified. Alternatively, add a performance model or a discussion of what scaling would be required. This is a framing/evidence issue that affects the paper's central claim.
minor comments (4)
- [Fig. 1] The figure is not self-contained: axis labels and units are missing. If the figure is a screenshot, please replace it with a clear plot, including labels for execution time and node/thread count.
- [Sec. 1] Typo: 'e fficiently' should be 'efficiently'.
- [Sec. 4.3] The acronym 'VLV A' appears with a stray space; presumably 'VLVA' (ViaLactea Visual Analytic).
- [Sec. 4.2] The sentence describing the CWL workflow is a single long clause; it would be clearer to split it into two sentences.
Circularity Check
No circularity: the central scalability result is a direct measurement, not derived from fitted inputs or self-cited premises.
full rationale
The paper's concrete finding is the MPI-OpenMP scaling measurement of VisIVO Importer on 320 GB GADGET datasets (Sec. 4.1, Fig. 1). This is an empirical result reported as execution time versus node count; it is not derived from an equation, fitted to a model, or predicted from a parameter. There is no derivation chain connecting assumptions to the result, so the standard circularity patterns (self-definition, fitted input called prediction, uniqueness imported from authors, ansatz smuggled via citation, renaming) do not apply. The paper does contain many self-references (Gheller et al. 2006, Becciani et al. 2015, Sciacca et al. 2022, Vitello et al. 2018), but these are used only as background about VisIVO's history and prior deployments, not as load-bearing evidence for the new scalability claim. The absence of error bars, run-to-run statistics, or I/O/compute separation is a legitimate concern about evidentiary strength and reproducibility, but it is a correctness/verification issue, not a circularity issue. The exascale 'pathway' is explicitly an intended direction ('we intend', 'we are planning'), so it does not claim to be proven by the preliminary test. Overall, the paper is self-contained in the sense that its reported timing result stands as a direct measurement; no step reduces to its own input by construction.
Axiom & Free-Parameter Ledger
axioms (4)
- domain assumption The hybrid MPI-OpenMP parallelization is an appropriate and effective way to improve VisIVO Importer performance on HPC nodes.
- domain assumption The Pleiadi platform (Xeon E5-2697 v4, BeeGFS, 36 cores/node) and GADGET datasets of 4, 16, and 320 GB are representative of pre-exascale/exascale astrophysics workloads.
- domain assumption Workflow abstractions (CWL, StreamFlow, Jupyter) will deliver portability and reproducibility for VisIVO without significant overhead.
- domain assumption CAPIO can be integrated into VisIVO workflows to improve I/O without modifying the existing codebase.
Cite this review
Pith. "Pith review of High performance visualization for Astronomy and Cosmology: the VisIVO's pathway toward Exascale systems." pith.science (2026). https://pith.science/paper/VQPJOVKE
@misc{pith2026250820603,
author = {Pith},
title = {Pith review of: High performance visualization for Astronomy and Cosmology: the VisIVO's pathway toward Exascale systems},
year = {2026},
howpublished = {\url{https://pith.science/paper/VQPJOVKE}},
note = {Machine review of arXiv:2508.20603}
}
read the original abstract
Petabyte-scale data volumes are generated by observations and simulations in modern astronomy and astrophysics. Storage, access, and data analysis are significantly hampered by such data volumes and are leading to the development of a new generation of software tools. The Visualization Interface for the Virtual Observatory (VisIVO) has been designed, developed and maintained by INAF since 2005 to perform multi-dimensional data analysis and knowledge discovery in multivariate astrophysical datasets. Utilizing containerization and virtualization technologies, VisIVO has already been used to exploit distributed computing infrastructures including the European Open Science Cloud (EOSC). We intend to adapt VisIVO solutions for high performance visualization of data generated on the (pre-)Exascale systems by HPC applications in Astrophysics and Cosmology (A\&C), including GADGET (GAlaxies with Dark matter and Gas) and PLUTO simulations, thanks to the collaboration within the SPACE Center of Excellence, the H2020 EUPEX Project, and the ICSC National Research Centre. In this work, we outline the evolution's course as well as the execution strategies designed to achieve the following goals: enhance the portability of the VisIVO modular applications and their resource requirements; foster reproducibility and maintainability; take advantage of a more flexible resource exploitation over heterogeneous HPC facilities; and, finally, minimize data-movement overheads and improve I/O performances.
Figures
Reference graph
Works this paper leans on
-
[1]
, " * write output.state after.block = add.period write newline
ENTRY address archive author booktitle chapter collaboration edition editor eid eprint howpublished institution journal key month note number numpages organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.con...
-
[2]
" write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in " " * FUNCTION format....
-
[3]
2015, Concurrency and Computation: Practice and Experience, 27, 306
Becciani, U., Sciacca, E., Costa, A., Massimino, P., Pistagna, C., Riggi, S., Vitello, F., Petta, C., Bandieramonte, M., & Krokos, M. 2015, Concurrency and Computation: Practice and Experience, 27, 306
work page 2015
-
[4]
2022, Future Generation Computer Systems, 128, 282
Colonnelli, I., Aldinucci, M., Cantalupo, B., Padovani, L., Rabellino, S., Spampinato, C., Morelli, R., Di Carlo , R., Magini, N., & Cavazzoni, C. 2022, Future Generation Computer Systems, 128, 282
work page 2022
-
[5]
2021, IEEE Transactions on Emerging Topics in Computing, 9, 1723
Colonnelli, I., Cantalupo, B., Merelli, I., & Aldinucci, M. 2021, IEEE Transactions on Emerging Topics in Computing, 9, 1723
work page 2021
-
[6]
2006, in Astronomical Data Analysis Software and Systems XV, vol
Gheller, C., Comparato, M., & Becciani, U. 2006, in Astronomical Data Analysis Software and Systems XV, vol. 351, 29
work page 2006
-
[7]
The Cosmological Simulation Code OpenGadget3 -- Implementation of Meshless Finite Mass
Groth, F., Steinwandel, U. P., Valentini, M., & Dolag, K. 2023, arXiv preprint arXiv:2301.03612
work page internal anchor Pith review Pith/arXiv arXiv 2023
-
[8]
2009, The Fourth Paradigm: Data-Intensive Scientific Discovery (Microsoft Research)
Hey, T., Tansley, S., Tolle, K., & Gray, J. 2009, The Fourth Paradigm: Data-Intensive Scientific Discovery (Microsoft Research). ://www.microsoft.com/en-us/research/publication/fourth-paradigm-data-intensive-scientific-discovery/
work page 2009
-
[9]
R., Torquati, M., Colonnelli, I., Cantalupo, B., & Aldinucci, M
Martinelli, A. R., Torquati, M., Colonnelli, I., Cantalupo, B., & Aldinucci, M. 2023, in 30th IEEE International Conference on High Performance Computing, Data, and Analytics, HiPC 2023 (New York, NY, USA: IEEE )
work page 2023
-
[10]
2011, The Astrophysical Journal Supplement Series, 198, 7
Mignone, A., Zanni, C., Tzeferacos, P., Van Straalen, B., Colella, P., & Bodo, G. 2011, The Astrophysical Journal Supplement Series, 198, 7
work page 2011
-
[11]
2022, Journal of Grid Computing, 20, 7
Sciacca, E., Krokos, M., Bordiu, C., Brandt, C., Vitello, F., Bufano, F., Becciani, U., Raciti, M., Tudisco, G., Riggi, S., et al. 2022, Journal of Grid Computing, 20, 7
work page 2022
- [12]
This paper was first reviewed by deepseek-v4-flash on August 5, 2026.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.