GPU-accelerated factorization sets in numerical semigroups via parallel bounded lexicographic streams
Thomas Barron

TL;DR
This paper introduces a GPU-accelerated method for enumerating factorization sets in numerical semigroups using parallel lexicographic streams, significantly improving computational efficiency.
Contribution
It presents a novel parallelization approach for lexicographic enumeration in numerical semigroups, leveraging GPU and distributed computing.
Findings
CUDA implementation demonstrates practical runtime improvements
Parallel streams enable efficient enumeration of factorization sets
Method extends computational capabilities for numerical semigroup analysis
Abstract
We describe a method for parallelizing the lexicographic enumeration algorithm for the factorization set of an element in a numerical semigroup via bounds. This enables the use of GPU and distributed computing methods. We provide a CUDA implementation with measured runtimes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions
