latest/doxygen/TileAllocation_8hpp_source.html

// Copyright (c) 2019 Graphcore Ltd. All rights reserved.

#ifndef INCLUDE_GCL_TILEALLOCATION_HPP

#define INCLUDE_GCL_TILEALLOCATION_HPP


#include <poplar/Graph.hpp>

#include <vector>


#if __cplusplus >= 201603L

#define GCL_NO_DISCARD [[nodiscard]]

#else

#define GCL_NO_DISCARD

#endif


namespace gcl {


GCL_NO_DISCARD unsigned getMinIoTiles(const poplar::Graph &graph);


GCL_NO_DISCARD std::vector<unsigned>

perIPUTiles(const poplar::Graph &graph, unsigned offset, unsigned count,

            bool sorted = true, bool tilePairs = true);


} // namespace gcl

#endif // INCLUDE_GCL_TILEALLOCATION_HPP

GCL_NO_DISCARD
#define GCL_NO_DISCARD
Produce compile time warning for unused return values.
Definition: TileAllocation.hpp:19

poplar::Graph
This class represents a graph program to be executed on the IPU.
Definition: Graph.hpp:52

gcl
Graphcore Communications Library.

gcl::getMinIoTiles
unsigned getMinIoTiles(const poplar::Graph &graph)
Get the minimum number of IO tiles required for GCL operations.

gcl::perIPUTiles
std::vector< unsigned > perIPUTiles(const poplar::Graph &graph, unsigned offset, unsigned count, bool sorted=true, bool tilePairs=true)
Return a list of tile IDs optimal for GCL collective operations.