pub struct ServingPlan {Show 13 fields
pub tensor_parallel: usize,
pub data_parallel: usize,
pub ctx: usize,
pub hbm_bytes_per_chip: usize,
pub weights_per_chip_bytes: usize,
pub sequence_bytes_per_chip: usize,
pub max_sequences_per_replica: usize,
pub max_sequences: usize,
pub sram_bytes_per_chip: usize,
pub activation_bytes_per_sequence: usize,
pub sequences_resident_in_sram: usize,
pub provenance: &'static str,
pub no_speed_claim: bool,
}Expand description
How Qwen3.8 is served on a chip’s scale-up domain at one context length — every choice read off the chips’ memory
hierarchy and topology and the model’s structure, none typed. provenance: modeled; no field is a time.
Fields§
§tensor_parallel: usizeThe chips one tensor-parallel group spans (qwen38_tensor_parallel).
data_parallel: usizeThe chips of the scale-up domain (default_tensor_parallel) the group does not span, as whole replicas.
ctx: usize§hbm_bytes_per_chip: usizeOne chip’s HBM, its slice of the weights, and ONE sequence’s carried state on it at ctx: the KV cache (sharded
over the KV heads, replicated beyond them), the Gated-DeltaNet memory and the conv rings.
weights_per_chip_bytes: usize§sequence_bytes_per_chip: usize§max_sequences_per_replica: usizeThe most sequences a replica holds at once: their carried state beside the weights in every chip’s HBM.
max_sequences: usize§sram_bytes_per_chip: usizeOne chip’s SRAM, one sequence’s per-step activation working set, and the most sequences whose working set — with their recurrent state — stays on-chip for a step.
activation_bytes_per_sequence: usize§sequences_resident_in_sram: usize§provenance: &'static str§no_speed_claim: boolTrait Implementations§
Source§impl Clone for ServingPlan
impl Clone for ServingPlan
Source§fn clone(&self) -> ServingPlan
fn clone(&self) -> ServingPlan
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for ServingPlan
impl Debug for ServingPlan
Source§impl PartialEq for ServingPlan
impl PartialEq for ServingPlan
Source§impl Serialize for ServingPlan
impl Serialize for ServingPlan
impl Eq for ServingPlan
impl StructuralPartialEq for ServingPlan
Auto Trait Implementations§
impl Freeze for ServingPlan
impl RefUnwindSafe for ServingPlan
impl Send for ServingPlan
impl Sync for ServingPlan
impl Unpin for ServingPlan
impl UnsafeUnpin for ServingPlan
impl UnwindSafe for ServingPlan
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.