pacman.operations.routing_info_allocator_algorithms package

Subpackages

• pacman.operations.routing_info_allocator_algorithms.field_based_routing_allocator package
  • Module contents
• pacman.operations.routing_info_allocator_algorithms.malloc_based_routing_allocator package
  • Submodules
  • pacman.operations.routing_info_allocator_algorithms.malloc_based_routing_allocator.compressible_malloc_based_routing_info_allocator module
  • pacman.operations.routing_info_allocator_algorithms.malloc_based_routing_allocator.key_field_generator module
  • pacman.operations.routing_info_allocator_algorithms.malloc_based_routing_allocator.malloc_based_routing_info_allocator module
  • pacman.operations.routing_info_allocator_algorithms.malloc_based_routing_allocator.utils module
  • Module contents

Submodules

pacman.operations.routing_info_allocator_algorithms.basic_routing_info_allocator module

class pacman.operations.routing_info_allocator_algorithms.basic_routing_info_allocator.BasicRoutingInfoAllocator

Bases: object

An basic algorithm that can produce routing keys and masks for edges in a graph based on the x,y,p of the placement of the preceding vertex.

Note

No constraints are supported, and that the number of keys required by each edge must be 2048 or less, and that all edges coming out of a vertex will be given the same key/mask assignment.

pacman.operations.routing_info_allocator_algorithms.destination_based_key_allocator module

class pacman.operations.routing_info_allocator_algorithms.destination_based_key_allocator.DestinationBasedRoutingInfoAllocator

Bases: object

A routing key allocator that operates for people who wish to have a separate key for each destination (making a multicast into a point-to-point cast).

MASK = 4294965248

MAX_KEYS_SUPPORTED = 2048

pacman.operations.routing_info_allocator_algorithms.zoned_routing_info_allocator module

class pacman.operations.routing_info_allocator_algorithms.zoned_routing_info_allocator.ZonedRoutingInfoAllocator

Bases: object

An basic algorithm that can produce routing keys and masks for edges in a graph based on the x,y,p of the placement of the preceding vertex.

Note

No constraints are supported, and that the number of keys required by each edge must be 2048 or less, and that all edges coming out of a vertex will be given the same key/mask assignment.

Module contents

class pacman.operations.routing_info_allocator_algorithms.BasicRoutingInfoAllocator

Bases: object

An basic algorithm that can produce routing keys and masks for edges in a graph based on the x,y,p of the placement of the preceding vertex.

Note

No constraints are supported, and that the number of keys required by each edge must be 2048 or less, and that all edges coming out of a vertex will be given the same key/mask assignment.

class pacman.operations.routing_info_allocator_algorithms.CompressibleMallocBasedRoutingInfoAllocator

Bases: pacman.utilities.algorithm_utilities.element_allocator_algorithm.ElementAllocatorAlgorithm

A Routing Info Allocation Allocator algorithm that keeps track of free keys and attempts to allocate them as requested, but that also looks at routing tables in an attempt to make things more compressible

class pacman.operations.routing_info_allocator_algorithms.DestinationBasedRoutingInfoAllocator

Bases: object

A routing key allocator that operates for people who wish to have a separate key for each destination (making a multicast into a point-to-point cast).

MASK = 4294965248

MAX_KEYS_SUPPORTED = 2048

class pacman.operations.routing_info_allocator_algorithms.MallocBasedRoutingInfoAllocator

Bases: pacman.utilities.algorithm_utilities.element_allocator_algorithm.ElementAllocatorAlgorithm

A Routing Info Allocation Allocator algorithm that keeps track of free keys and attempts to allocate them as requested