dmlc--dgl
Lingfan Yu
a1d50f0f53
* include/dgl/runtime * include * src/runtime * src/graph * src/scheduler * src * clean up CMakeLists * further clean up in cmake * install commands * python/dgl/_ffi/_cython * python/dgl/_ffi/_ctypes * python/dgl/_ffi * python/dgl * some fix * copy right
40 行
1.2 KiB
C++
40 行
1.2 KiB
C++
/*!
|
|
* Copyright (c) 2018 by Contributors
|
|
* \file dgl/scheduler.h
|
|
* \brief Operations on graph index.
|
|
*/
|
|
#ifndef DGL_SCHEDULER_H_
|
|
#define DGL_SCHEDULER_H_
|
|
|
|
#include <vector>
|
|
#include "runtime/ndarray.h"
|
|
|
|
namespace dgl {
|
|
|
|
typedef dgl::runtime::NDArray IdArray;
|
|
|
|
namespace sched {
|
|
|
|
/*!
|
|
* \brief Generate degree bucketing schedule
|
|
* \param msg_ids The edge id for each message
|
|
* \param vids The destination vertex for each message
|
|
* \param recv_ids The recv nodes (for checking zero degree nodes)
|
|
* \note If there are multiple messages going into the same destination vertex, then
|
|
* there will be multiple copies of the destination vertex in vids
|
|
* \return a vector of 5 IdArrays for degree bucketing. The 5 arrays are:
|
|
* degrees: of degrees for each bucket
|
|
* nids: destination node ids
|
|
* nid_section: number of nodes in each bucket (used to split nids)
|
|
* mids: message ids
|
|
* mid_section: number of messages in each bucket (used to split mids)
|
|
*/
|
|
std::vector<IdArray> DegreeBucketing(const IdArray& msg_ids, const IdArray& vids,
|
|
const IdArray& recv_ids);
|
|
|
|
} // namespace sched
|
|
|
|
} // namespace dgl
|
|
|
|
#endif // DGL_SCHEDULER_H_
|