Struct Demand 

pub struct Demand {
    pub weights: f64,
    pub rewritten: f64,
    pub appended: f64,
    pub array: f64,
    pub lanes: f64,
    pub vector: f64,
}

The work one command asks of each unit.

Fields

weights: f64

Weight bytes streamed from the card’s memory: the command’s tensors, the embedding’s rows.

rewritten: f64

Bytes of the rows’ sequences’ recurrent states read and written back in place.

appended: f64

Cache, ring, log and state bytes the rows’ sequences read in long runs and append their rows after.

array: f64

Multiply-adds of the 4-bit array.

lanes: f64

Block-scale lane cycles.

vector: f64

f32 operations of the vector units.

Implementations

impl Demand

pub fn memory_s(&self, card: &Card, weights: f64) -> f64

Seconds card’s memory takes to move the demand’s state and cache traffic and weights bytes of its weights, each at its own stream’s share of the peak.

Trait Implementations

impl AddAssign for Demand

fn add_assign(&mut self, o: Demand)

Performs the += operation.

impl Clone for Demand

fn clone(&self) -> Demand

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Demand

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Demand

fn default() -> Demand

Returns the “default value” for a type.

impl PartialEq for Demand

fn eq(&self, other: &Demand) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for Demand

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for Demand

impl StructuralPartialEq for Demand