PSDP — Same-Language Parallelization
Inject deterministic parallelization into your existing applications — without rewriting source code.
PSDP (Phase-Synchronous Deterministic Parallelism) is JAVATEL's independent runtime-injection product line for parallelizing existing Java, C#, Rust, Go, and Kotlin applications, delivering 2.97–4.23× speedup with bit-exact output and a hash-chained audit trail.
Supported languages
PSDP generates a sequential / parallel pair within the same language — Java→Java, C#→C#, Rust→Rust, Go→Go, Kotlin→Kotlin are the primary targets. 12+ additional languages are implemented as research targets.
Use cases
Financial trading systems
Parallelize overnight batch and risk computation; cut window time by 3× with cent-exact bit-exact guarantee. SAFETY_MAX profile satisfies audit needs.
Regulated Java / C# parallelization
Parallelize finance and insurance core systems under J-SOX / SEC oversight, with hash-chained audit trail. Result invariance enables recompute, comparison, and audit.
Cloud cost reduction
3–4× speedup on existing workloads = 1/3 the infrastructure. Compress AWS / GCP / Azure instance count and size with no code changes.
HFT (high-frequency trading)
Low-latency order processing and market-data parallelization. GAME_MIN profile minimizes safety overhead to prioritize frame time.
Scientific computing
Bit-exact parallelization of FFT, Conv2D, LU decomposition. Eliminates the "parallel result differs, can't compare" failure mode.
ML inference acceleration
Parallelize trained-model inference pipelines with deterministic guarantees. Compatible with A/B comparison, regression validation, and security audit.
How it works — commutator-norm phase synchronization
The sufficient condition for parallel execution to return the same result as sequential is derived from the commutator norm ‖[A,B]‖ of the relational operators. PSDP enforces phase-sync to keep the commutator below a threshold at runtime, and the Böttcher–Wenzel inequality gives an analytic upper bound on numerical drift — eliminating the "numbers change when parallelized" phenomenon at the theory level.
// PSDP applied (OrderBatchProcessor_PSDP.java, excerpt) // - sha256 of input/output exactly matches the original // sequential code (OrderBatchProcessor_ORIGINAL.java) public class OrderBatchProcessor { public Result process(List<Order> orders) { return orders.parallelStream() // only the parallel call differs .map(this::settle) .collect(PSDP.phaseSyncReduce(...)); // phase-synchronized reduce } }
The diff between sequential and parallel is a few API calls only; no logic rewrites. Bench regression-tests sha256 equality between sequential and parallel output every CI run.
Technical specifications
- Injection methodRuntime injection. No source code rewrites; rebuild only.
- Bit-exact guaranteesha256 of sequential and parallel outputs match exactly. Eliminates the typical "parallel changes the numbers" failure mode.
- Phase-sync guarantee‖[A,B]‖ ≤ ε enforced at runtime. Böttcher–Wenzel gives an analytic upper bound on drift.
- Hash-chained auditFNV1a64 + SHA-256 monotonic chain. 1-byte tampering is DETECTED. Append-only, no after-the-fact edits.
- Fault-injection rollback90/90 scenarios with zero barrier violations. Tombstone-based past-state restoration.
- 11 safety mechanismsCovered by claims 29-32, configurable across 5 profiles (GAME_MIN to SAFETY_MAX).
Verified benchmarks
| Category | Kernel | Speedup | Notes |
|---|---|---|---|
| Compute | NENC (numerical equivalence) | 3.38 × | Near-linear in cores, CPU-bound |
| Graph | GRA (graph kernels) | 2.17 × | Memory-bandwidth ceiling, bit-exact preserved |
| Database | TPC (transaction) | 1.02 × | I/O-bound, but result-invariance still guaranteed |
| SIMD | svt_av1_quantize_fp (AVX-512) | 3072 / 3072 | Bit-exact PASS, ±5% vs AVX2 (memory-bound) |
378 runs all bit-exact / 90/90 fault-injection rollbacks / 99.9995% determinism bound are detailed in the PSDP paper (JP v5d, 910 KB PDF, 2026-03-04).
Versus alternatives
| Intel TBB | Parallelization framework, but requires source rewrites; no bit-exact guarantee. PSDP: no source changes + bit-exact + audit trail. |
|---|---|
| OpenMP | pragma-based, requires explicit annotation; reproducibility is implementation-dependent. PSDP: runtime injection + result-invariance + audit fitness. |
| Java parallelStream | Result order non-deterministic; reduce on floats is non-reproducible. PSDP's phaseSyncReduce makes reduce order deterministic too. |
| C# Parallel.ForEach | Same: side-effect order non-deterministic. PSDP provides bit-exact within-language parallelism. |
| GPU parallelism (CUDA / Metal) | Cross-language, results are arch-dependent. PSDP stays within the same language and same binary, runs on CPU. |
Licensing
| SlimeNENC customers | Free deployment right. Pay only the runtime fee at 2%/year of conversion cost. No contractual renegotiation needed (same patent 2026-046620). |
|---|---|
| Direct customers | Runtime-billed, separate pricing. Editions: Trial / Individual / Corporate / OEM. |
| Method | Ed25519-signed license + 3-hop air-gap activation (for financial institutions). |
| License server | license.javatel.jp (AWS Lightsail, HSTS / OCSP stapling) |
Patents
- JP Patent App. 2026-046620 (PSDP core / Phase-Synchronous Deterministic Parallelism)
- JP Patent App. 2026-046625 (phase-sync implementation, 11 safety mechanisms, claims 29-32)
- Additional applications in preparation (SIMD / GPU extensions, SlimeSyCUDA)