Skip to main content

// Chapter 09 · Concepts

Workloads and Roadmap

One workload is live.

1 min0 sectionsConcepts

One workload is live. The rest are the roadmap.

// 9.0 · AI inference today · open marketplace later

// What the network runs today

ParalleliX AI inference. Each request is served whole by one node; parallelism is at the request level across the pool.

The live demand on the network is ParalleliX AI: operators stake on NodeRegistryLocker, run the Node CLI, and serve inference requests for the reward share their stake, tier, and uptime earn. That is the whole live loop. The four classes below, scientific computing, big-data analytics, blockchain, and rendering, are genuinely parallelizable and segment into sub-tasks, but they belong to the open compute marketplace that opens to third-party submitters after launch. They are shown here as the addressable roadmap, not as work you can submit today.

The live workload: AI inference

// 9.1 · ParalleliX AI · served whole, request-level parallelism

// 9.1 · artificial intelligenceLive

Artificial intelligence

Inference is the live demand on the network today through ParalleliX AI. Each inference request is autoregressive and runs whole on one capable node; parallelism is request-level across the pool. Training is a genuinely parallelizable workload reserved for the broader marketplace path.

// What

Inference at request scale for ParalleliX AI: open-source models, each request served whole by one node. Distributed model training across heterogeneous GPUs and dataset preprocessing belong to the broader parallelizable-workload path.

// Sub-task shape

Inference (live): the inference request is the unit of work, dispatched whole to one node. Never split across machines. Training (general path): one sub-task per mini-batch replica (data parallelism), per layer shard (tensor parallelism), or per pipeline stage per micro-batch (pipeline parallelism).

// Segmentation

  • Request-level inference (live)

    A single inference is not segmented. The whole request routes to one capable node; many requests run concurrently across the pool, so throughput scales with the number of online nodes.

  • Data parallelism (training, general path)

    Identical model replicas process disjoint mini-batches; gradients aggregate at synchronisation barriers. One sub-task per replica per step.

  • Tensor and pipeline parallelism (training, general path)

    Layer-level matrix multiplications shard across devices, and forward/backward passes split across pipeline stages. One sub-task per shard per layer, or per stage per micro-batch.

// Hardware fit

Tier 2 (mid-GPU) or tier 3 for inference depending on model size. Tier 3 (A100, H100) for training. Tier 1 (CPU) for preprocessing and tokenisation.

// Latency posture

Inference: latency-sensitive; each request is served whole, target p95 under 200ms per request. Training: latency-tolerant; steps take seconds to minutes.

// Failure + mitigation

Inference: a slow or dropped node stalls only the requests routed to it; re-dispatch the request whole to another capable node. Training (general path): synchronisation barriers couple nodes, so a slow node delays the whole step; mitigation is deadline-bounded sub-tasks plus re-dispatch on the slowest tail.

Planned: the open compute marketplace

// 9.2 → 9.5 · parallelizable workloads · post-launch, third-party submitters

// planned

Scientific research

Climate and atmospheric simulation. Genomics (sequence alignment, mutation analysis, drug discovery). Physics simulation across particle, materials, and astrophysics workloads. Long-running, highly parallel, historically gated by hyperscale pricing.

Tier 4 wins

// planned

Big data analytics

Financial risk modelling, fraud detection, algorithmic trading research. Healthcare data analysis and real-time diagnostics. Logistics and supply-chain optimisation at network scale.

Tier 1 to 3 spread

// planned

Blockchain applications

zk-SNARK proof generation offloaded from L1 and L2 validators. Decentralised oracle aggregation across external data sources. Resource-intensive smart-contract execution that does not fit cleanly into a single block context.

Tier 2 to 4 spread

// planned

Media and rendering

2D and 3D rendering for animation, games, virtual reality. Frame extraction, colour correction, video encoding pipelines. AR/VR scene generation with real-time updates.

Tier 2 to 3 spread

Workload-class routing

// 9.6 · one scheduler now · per-class allocation planned

Caveat·Workload-class optimisation is planned

The live scheduler is workload-agnostic: capability declarations on nodes are the routing key, the same for all five classes. A planned optimiser layers workload-class-specific allocation policies on top of the same primitives. The reason to wait: until network telemetry can validate per-class scheduling gains, premature class-specific tuning costs more than it returns.

// Where to go next · reading path