Closed yzh119 closed 2 years ago
Implement the format decomposing algorithm described in Figure 11 of sparsetir paper in C++. To make the preprocessing faster.
Function signatures be like (std::vector<int> bucket_sizes, int num_col_partitions, std::vector<int> indptr, std::vector<int> indices).
(std::vector<int> bucket_sizes, int num_col_partitions, std::vector<int> indptr, std::vector<int> indices)
Return type: std::vector<std::vector<int32_t>>.
std::vector<std::vector<int32_t>>
Order be like:
Done
Description
Implement the format decomposing algorithm described in Figure 11 of sparsetir paper in C++. To make the preprocessing faster.
Input
Function signatures be like
(std::vector<int> bucket_sizes, int num_col_partitions, std::vector<int> indptr, std::vector<int> indices)
.Output
Return type:
std::vector<std::vector<int32_t>>
.Order be like:
Padding behavior