def make_routing_tables(): # Create a perfect SpiNNaker machine to build against machine = Machine(12, 12) # Assign a vertex to each of the 17 application cores on each chip vertices = OrderedDict( ((x, y, p), object()) for x, y in machine for p in range(1, 18) ) # Generate the vertex resources, placements and allocations (required for # routing) vertices_resources = OrderedDict( (vertex, {Cores: 1}) for vertex in itervalues(vertices) ) placements = OrderedDict( (vertex, (x, y)) for (x, y, p), vertex in iteritems(vertices) ) allocations = OrderedDict( (vertex, {Cores: slice(p, p+1)}) for (x, y, p), vertex in iteritems(vertices) ) # Compute the distance dependent probabilities - this is a geometric # distribution such that each core has a 50% chance of being connected to # each core on the same chip, 25% on chips one hop away, 12.5% on chips two # hops away, etc. p = 0.5 probs = {d: p*(1 - p)**d for d in range(max(machine.width, machine.height))} p = 0.3 dprobs = {d: p*(1 - p)**d for d in range(max(machine.width, machine.height))} # Compute offsets to get to centroids vector_centroids = list() for d in (5, 6, 7): for i in range(d + 1): for j in range(d + 1 - i): vector_centroids.append((i, j, d - i - j)) # Make the nets, each vertex is connected with distance dependent # probability to other vertices. random.seed(123) nets = OrderedDict() for source_coord, source in iteritems(vertices): # Convert source_coord to xyz form source_coord_xyz = minimise_xyz(to_xyz(source_coord[:-1])) # Add a number of centroids x, y, z = source_coord_xyz possible_centroids = [minimise_xyz((x + i, y + j, z + k)) for i, j, k in vector_centroids] n_centroids = random.choice(17*(0, ) + (1, 1) + (2, )) centroids = random.sample(possible_centroids, n_centroids) # Construct the sinks list sinks = list() for sink_coord, sink in iteritems(vertices): # Convert sink_coord to xyz form sink_coord = minimise_xyz(to_xyz(sink_coord[:-1])) # Get the path length to the original source dist = shortest_torus_path_length(source_coord_xyz, sink_coord, machine.width, machine.height) if random.random() < probs[dist]: sinks.append(sink) continue # See if the sink is connected to the centre of any of the # centroids. for coord in centroids: dist = shortest_torus_path_length( coord, sink_coord, machine.width, machine.height ) if random.random() < dprobs[dist]: sinks.append(sink) break # Add the net nets[source_coord] = Net(source, sinks) rig_nets = list(itervalues(nets)) # Just the nets # Determine how many bits to use in the keys xyp_fields = BitField(32) xyp_fields.add_field("x", length=8, start_at=24) xyp_fields.add_field("y", length=8, start_at=16) xyp_fields.add_field("p", length=5, start_at=11) xyzp_fields = BitField(32) xyzp_fields.add_field("x", length=8, start_at=24) xyzp_fields.add_field("y", length=8, start_at=16) xyzp_fields.add_field("z", length=8, start_at=8) xyzp_fields.add_field("p", length=5, start_at=3) hilbert_fields = BitField(32) hilbert_fields.add_field("index", length=16, start_at=16) hilbert_fields.add_field("p", length=5, start_at=11) random.seed(321) rnd_fields = BitField(32) rnd_fields.add_field("rnd", length=12, start_at=20) rnd_seen = set() # Generate the routing keys net_keys_xyp = OrderedDict() net_keys_xyzp = OrderedDict() net_keys_hilbert = OrderedDict() net_keys_rnd = OrderedDict() for i, (x, y) in enumerate(chip for chip in hilbert_chip_order(machine) if chip in machine): # Add the key for each net from each processor for p in range(1, 18): # Get the net net = nets[(x, y, p)] # Construct the xyp key/mask net_keys_xyp[net] = xyp_fields(x=x, y=y, p=p) # Construct the xyzp mask x_, y_, z_ = minimise_xyz(to_xyz((x, y))) net_keys_xyzp[net] = xyzp_fields(x=x_, y=y_, z=abs(z_), p=p) # Construct the Hilbert key/mask net_keys_hilbert[net] = hilbert_fields(index=i, p=p) # Construct the random 12 bit value field val = None while val is None or val in rnd_seen: val = random.getrandbits(12) rnd_seen.add(val) net_keys_rnd[net] = rnd_fields(rnd=val) # Route the network and then generate the routing tables constraints = list() print("Routing...") routing_tree = route(vertices_resources, rig_nets, machine, constraints, placements, allocations) # Write the routing tables to file for fields, desc in ((net_keys_xyp, "xyp"), (net_keys_xyzp, "xyzp"), (net_keys_hilbert, "hilbert"), (net_keys_rnd, "rnd")): print("Getting keys and masks...") keys = OrderedDict( (net, (bf.get_value(), bf.get_mask())) for net, bf in iteritems(fields) ) print("Constructing routing tables for {}...".format(desc)) tables = routing_tree_to_tables(routing_tree, keys) print([len(x) for x in itervalues(tables)]) print("Writing to file...") fn = "uncompressed/centroid_{}_{}_{}.bin".format( machine.width, machine.height, desc) with open(fn, "wb+") as f: dump_routing_tables(f, tables)
def my_minimize(chip, table): print("Minimising {}, {} entries...".format(chip, len(table))) t = time.clock() table, _ = ordered_covering(table, None) total = time.clock() - t print("... to {} entries in {} s".format(len(table), total)) return chip, table if __name__ == "__main__": # Parse the arguments parser = argparse.ArgumentParser() parser.add_argument("routing_table") parser.add_argument("output") args = parser.parse_args() # Load and minimise all routing tables print("Loading routing tables...") with open(args.routing_table, "rb") as f: uncompressed = common.read_routing_tables(f) print("Minimising routing tables...") compressed = dict( my_minimize(chip, table) for chip, table in iteritems(uncompressed)) print("Dumping minimised routing tables to {}...".format(args.output)) with open(args.output, "wb+") as f: common.dump_routing_tables(f, compressed)
assert table_is_subset_of(table, new_table) sys.stdout.write( "\033[{}m{:4d}\033[39m\t{:.2f}%\n".format( 32 if len(new_table) < 1024 else 31, len(new_table), 100.0 * float(len(table) - len(new_table)) / len(table) ) ) return chip, new_table if __name__ == "__main__": # Parse the arguments parser = argparse.ArgumentParser() parser.add_argument("routing_table") parser.add_argument("out") args = parser.parse_args() # Load and minimise all routing tables print("Loading routing tables...") with open(args.routing_table, "rb") as f: uncompressed = common.read_routing_tables(f) print("Minimising routing tables...") compressed = dict(my_minimize(chip, table) for chip, table in iteritems(uncompressed)) fn = args.out print("Dumping minimised routing tables to {}...".format(fn)) with open(fn, "wb+") as f: common.dump_routing_tables(f, compressed)
def make_routing_tables(): # Create a perfect SpiNNaker machine to build against machine = Machine(12, 12) # Assign a vertex to each of the 17 application cores on each chip vertices = OrderedDict( ((x, y, p), object()) for x, y in machine for p in range(1, 18)) # Generate the vertex resources, placements and allocations (required for # routing) vertices_resources = OrderedDict((vertex, { Cores: 1 }) for vertex in itervalues(vertices)) placements = OrderedDict( (vertex, (x, y)) for (x, y, p), vertex in iteritems(vertices)) allocations = OrderedDict((vertex, { Cores: slice(p, p + 1) }) for (x, y, p), vertex in iteritems(vertices)) # Compute the distance dependent probabilities - this is a geometric # distribution such that each core has a 50% chance of being connected to # each core on the same chip, 25% on chips one hop away, 12.5% on chips two # hops away, etc. p = 0.5 probs = { d: p * (1 - p)**d for d in range(max(machine.width, machine.height)) } p = 0.3 dprobs = { d: p * (1 - p)**d for d in range(max(machine.width, machine.height)) } # Compute offsets to get to centroids vector_centroids = list() for d in (5, 6, 7): for i in range(d + 1): for j in range(d + 1 - i): vector_centroids.append((i, j, d - i - j)) # Make the nets, each vertex is connected with distance dependent # probability to other vertices. random.seed(123) nets = OrderedDict() for source_coord, source in iteritems(vertices): # Convert source_coord to xyz form source_coord_xyz = minimise_xyz(to_xyz(source_coord[:-1])) # Add a number of centroids x, y, z = source_coord_xyz possible_centroids = [ minimise_xyz((x + i, y + j, z + k)) for i, j, k in vector_centroids ] n_centroids = random.choice(17 * (0, ) + (1, 1) + (2, )) centroids = random.sample(possible_centroids, n_centroids) # Construct the sinks list sinks = list() for sink_coord, sink in iteritems(vertices): # Convert sink_coord to xyz form sink_coord = minimise_xyz(to_xyz(sink_coord[:-1])) # Get the path length to the original source dist = shortest_torus_path_length(source_coord_xyz, sink_coord, machine.width, machine.height) if random.random() < probs[dist]: sinks.append(sink) continue # See if the sink is connected to the centre of any of the # centroids. for coord in centroids: dist = shortest_torus_path_length(coord, sink_coord, machine.width, machine.height) if random.random() < dprobs[dist]: sinks.append(sink) break # Add the net nets[source_coord] = Net(source, sinks) rig_nets = list(itervalues(nets)) # Just the nets # Determine how many bits to use in the keys xyp_fields = BitField(32) xyp_fields.add_field("x", length=8, start_at=24) xyp_fields.add_field("y", length=8, start_at=16) xyp_fields.add_field("p", length=5, start_at=11) xyzp_fields = BitField(32) xyzp_fields.add_field("x", length=8, start_at=24) xyzp_fields.add_field("y", length=8, start_at=16) xyzp_fields.add_field("z", length=8, start_at=8) xyzp_fields.add_field("p", length=5, start_at=3) hilbert_fields = BitField(32) hilbert_fields.add_field("index", length=16, start_at=16) hilbert_fields.add_field("p", length=5, start_at=11) random.seed(321) rnd_fields = BitField(32) rnd_fields.add_field("rnd", length=12, start_at=20) rnd_seen = set() # Generate the routing keys net_keys_xyp = OrderedDict() net_keys_xyzp = OrderedDict() net_keys_hilbert = OrderedDict() net_keys_rnd = OrderedDict() for i, (x, y) in enumerate(chip for chip in hilbert_chip_order(machine) if chip in machine): # Add the key for each net from each processor for p in range(1, 18): # Get the net net = nets[(x, y, p)] # Construct the xyp key/mask net_keys_xyp[net] = xyp_fields(x=x, y=y, p=p) # Construct the xyzp mask x_, y_, z_ = minimise_xyz(to_xyz((x, y))) net_keys_xyzp[net] = xyzp_fields(x=x_, y=y_, z=abs(z_), p=p) # Construct the Hilbert key/mask net_keys_hilbert[net] = hilbert_fields(index=i, p=p) # Construct the random 12 bit value field val = None while val is None or val in rnd_seen: val = random.getrandbits(12) rnd_seen.add(val) net_keys_rnd[net] = rnd_fields(rnd=val) # Route the network and then generate the routing tables constraints = list() print("Routing...") routing_tree = route(vertices_resources, rig_nets, machine, constraints, placements, allocations) # Write the routing tables to file for fields, desc in ((net_keys_xyp, "xyp"), (net_keys_xyzp, "xyzp"), (net_keys_hilbert, "hilbert"), (net_keys_rnd, "rnd")): print("Getting keys and masks...") keys = OrderedDict((net, (bf.get_value(), bf.get_mask())) for net, bf in iteritems(fields)) print("Constructing routing tables for {}...".format(desc)) tables = routing_tree_to_tables(routing_tree, keys) print([len(x) for x in itervalues(tables)]) print("Writing to file...") fn = "uncompressed/centroid_{}_{}_{}.bin".format( machine.width, machine.height, desc) with open(fn, "wb+") as f: dump_routing_tables(f, tables)
def make_routing_tables(): # Create a perfect SpiNNaker machine to build against machine = Machine(12, 12) # Assign a vertex to each of the 17 application cores on each chip vertices = OrderedDict( ((x, y, p), object()) for x, y in machine for p in range(1, 18) ) # Generate the vertex resources, placements and allocations (required for # routing) vertices_resources = OrderedDict( (vertex, {Cores: 1}) for vertex in itervalues(vertices) ) placements = OrderedDict( (vertex, (x, y)) for (x, y, p), vertex in iteritems(vertices) ) allocations = OrderedDict( (vertex, {Cores: slice(p, p+1)}) for (x, y, p), vertex in iteritems(vertices) ) # Compute the distance dependent probabilities probs = {d: .5*math.exp(-.65*d) for d in range(max(machine.width, machine.height))} # Make the nets, each vertex is connected with distance dependent # probability to other vertices. random.seed(123) nets = OrderedDict() for source_coord, source in iteritems(vertices): # Convert source_coord to xyz form source_coord_xyz = minimise_xyz(to_xyz(source_coord[:-1])) # Construct the sinks list sinks = list() for sink_coord, sink in iteritems(vertices): # Convert sink_coord to xyz form sink_coord = minimise_xyz(to_xyz(sink_coord[:-1])) # Get the path length dist = shortest_torus_path_length(source_coord_xyz, sink_coord, machine.width, machine.height) if random.random() < probs[dist]: sinks.append(sink) # Add the net nets[source_coord] = Net(source, sinks) rig_nets = list(itervalues(nets)) # Just the nets # Determine how many bits to use in the keys xyp_fields = BitField(32) xyp_fields.add_field("x", length=8, start_at=24) xyp_fields.add_field("y", length=8, start_at=16) xyp_fields.add_field("p", length=5, start_at=11) xyzp_fields = BitField(32) xyzp_fields.add_field("x", length=8, start_at=24) xyzp_fields.add_field("y", length=8, start_at=16) xyzp_fields.add_field("z", length=8, start_at=8) xyzp_fields.add_field("p", length=5, start_at=3) hilbert_fields = BitField(32) hilbert_fields.add_field("index", length=16, start_at=16) hilbert_fields.add_field("p", length=5, start_at=11) random.seed(321) rnd_fields = BitField(32) rnd_fields.add_field("rnd", length=12, start_at=20) rnd_seen = set() # Generate the routing keys net_keys_xyp = OrderedDict() net_keys_xyzp = OrderedDict() net_keys_hilbert = OrderedDict() net_keys_rnd = OrderedDict() for i, (x, y) in enumerate(chip for chip in hilbert_chip_order(machine) if chip in machine): # Add the key for each net from each processor for p in range(1, 18): # Get the net net = nets[(x, y, p)] # Construct the xyp key/mask net_keys_xyp[net] = xyp_fields(x=x, y=y, p=p) # Construct the xyzp mask x_, y_, z_ = minimise_xyz(to_xyz((x, y))) net_keys_xyzp[net] = xyzp_fields(x=x_, y=y_, z=abs(z_), p=p) # Construct the Hilbert key/mask net_keys_hilbert[net] = hilbert_fields(index=i, p=p) # Construct the random 12 bit value field val = None while val is None or val in rnd_seen: val = random.getrandbits(12) rnd_seen.add(val) net_keys_rnd[net] = rnd_fields(rnd=val) # Route the network and then generate the routing tables constraints = list() print("Routing...") routing_tree = route(vertices_resources, rig_nets, machine, constraints, placements, allocations) # Write the routing tables to file for fields, desc in ((net_keys_xyp, "xyp"), (net_keys_xyzp, "xyzp"), (net_keys_hilbert, "hilbert"), (net_keys_rnd, "rnd")): print("Getting keys and masks...") keys = {net: (bf.get_value(), bf.get_mask()) for net, bf in iteritems(fields)} print("Constructing routing tables for {}...".format(desc)) tables = routing_tree_to_tables(routing_tree, keys) print([len(x) for x in itervalues(tables)]) print("Writing to file...") fn = "uncompressed/gaussian_{}_{}_{}.bin".format( machine.width, machine.height, desc) with open(fn, "wb+") as f: dump_routing_tables(f, tables)
rng = np.random.RandomState(seed=2804) centroid_routes, local_routes = get_network(machine, rng) # Find the necessary number of random bits rnd_bits = int(np.ceil(np.log2(machine.width * machine.height * 17))) # Construct the keys and routing tables algs = (common.assign_xyp_keys, common.assign_xyzp_keys, common.assign_hilbert_keys, common.assign_random_keys, common.assign_random_keys) all_args = (tuple(), tuple(), (machine, ), (machine, 2804, 21), (machine, 2804, rnd_bits)) fps = ("xyp", "xyzp", "hilbert", "rnd21", "rnd{:d}".format(rnd_bits)) for routes, prefix in ((centroid_routes, "centroid"), (local_routes, "locally_connected")): for alg, args, fp in zip(algs, all_args, fps): logger.info("Generating keys...") keys = alg(iterkeys(routes), *args) # Generate the routing tables logger.info("Building routing tables...") tables = routing_tree_to_tables(routes, keys) # Dump to file logger.info("Writing to file...") with open("benchmarks/{}_{}.bin".format(prefix, fp), 'wb+') as f: common.dump_routing_tables(f, tables)
# Build the network logger.info("Building netlist...") rng = np.random.RandomState(seed=2804) centroid_routes, local_routes = get_network(machine, rng) # Find the necessary number of random bits rnd_bits = int(np.ceil(np.log2(machine.width * machine.height * 17))) # Construct the keys and routing tables algs = (common.assign_xyp_keys, common.assign_xyzp_keys, common.assign_hilbert_keys, common.assign_random_keys, common.assign_random_keys) all_args = (tuple(), tuple(), (machine, ), (machine, 2804, 21), (machine, 2804, rnd_bits)) fps = ("xyp", "xyzp", "hilbert", "rnd21", "rnd{:d}".format(rnd_bits)) for routes, prefix in ((centroid_routes, "centroid"), (local_routes, "locally_connected")): for alg, args, fp in zip(algs, all_args, fps): logger.info("Generating keys...") keys = alg(iterkeys(routes), *args) # Generate the routing tables logger.info("Building routing tables...") tables = routing_tree_to_tables(routes, keys) # Dump to file logger.info("Writing to file...") with open("benchmarks/{}_{}.bin".format(prefix, fp), 'wb+') as f: common.dump_routing_tables(f, tables)