Struct CartesianEmbedding

pub struct CartesianEmbedding { /* private fields */ }

Maps from a block into another following the natural embedding, keeping the coordinates of every node. Both block must have the same number of dimensions, and each dimension should be greater at the destination than at the source. This is intended to be used to place several small applications in a larger machine. It can combined with CartesianTransform to be placed at an offset, to set a stride, or others.

Example mapping nodes in a block of 16 nodes into one of 64 nodes.

CartesianEmbedding{
	source_sides: [4,4],
	destination_sides: [8,8],
}

Implementations

impl CartesianEmbedding

pub fn new(arg: PatternBuilderArgument<'_>) -> CartesianEmbedding

Trait Implementations

impl Debug for CartesianEmbedding

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

Formats the value using the given formatter.

impl Pattern for CartesianEmbedding

fn initialize( &mut self, source_size: usize, target_size: usize, _topology: &dyn Topology, _rng: &mut StdRng, )

Fix the input and output size, providing the topology and random number generator. Careful with using topology in sub-patterns. For example, it may be misleading to use the dragonfly topology when building a pattern among groups or a pattern among the routers of a single group. Even just a pattern of routers instead of a pattern of servers can lead to mistakes. Read the documentation of the traffic or meta-pattern using the pattern to know what its their input and output.

fn get_destination( &self, origin: usize, _topology: &dyn Topology, _rng: &mut StdRng, ) -> usize

Obtain a destination of a source. This will be called repeatedly as the traffic requires destination for its messages.

impl Quantifiable for CartesianEmbedding

fn total_memory(&self) -> usize

Get the total memory currently being employed by the implementing type. Both stack and heap.

fn print_memory_breakdown(&self)

Prints by stdout how much memory is used per component.

fn forecast_total_memory(&self) -> usize

Get an estimation on how much memory the type could reach during the simulation.