Asynchronous Many-Task Algorithm for Unstructured SN Transport

A 1.3 KB CSV dataset authored by Alex Elwood, last updated on May 25, 2026. It likely contains performance data comparing a new Asynchronous Many-Task algorithm for unstructured SN transport solvers against an existing shared memory parallelization method across various compute hardware.

Use Cases

• Benchmarking computational performance improvements based on the described AMT algorithm.
• Analyzing scalability bottlenecks of transport solvers on unstructured meshes.
• Evaluating shared memory parallelization schemes for high-dimensional domains.
• Comparing algorithm performance across different modern compute hardware.

Strengths

• Dataset is openly licensed under CC-BY-4.0.
• File size is precisely 1.3 KB.
• Last update timestamp is explicitly provided.

Limitations

• Row count is unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred after download.
• Description metadata is limited; actual data quality requires manual inspection after download.

Provenance

Source

Alex Elwood

Freshness

Last updated 2026-05-25 12:07:30; freshness should be verified.