Fine-Grained Execution Trace & Conflict Resolution
InfiniSVM leverages a simulation stage to obtain estimated read-write sequences before transactions enter the scheduling phase.Optimized Scheduling via Shortest Makespan First (SMF)
The optimal scheduling problem is NP-hard, resembling a bin-packing problem. To achieve sub-millisecond scheduling times, InfiniSVM employs:-
Shortest Makespan First (SMF) Algorithm
- A greedy scheduling approach widely used in database systems.
- Produces a near-optimal transaction schedule in real-time.
-
Parallel Scheduler Ensemble
- Includes Solana’s account-based partitioning algorithms as baselines.
- Multiple scheduling strategies are evaluated concurrently.
- The scheduler selects the candidate with the least estimated execution cost.
Impact on Performance & Scalability
By implementing execution-aware scheduling and parallel scheduler ensembles, InfiniSVM achieves:- Lower lock contention while maintaining serializability guarantees.
- Higher transaction throughput through adaptive, conflict-free execution.
- Near-optimal scheduling in sub-millisecond latency.