Method get_schedule

include/core/solver.h:519–575

Determine the schedule of partitions */

    /** Determine the schedule of partitions */
    virtual std::vector<std::vector<std::pair<int, int>>> get_schedule() const {
        std::vector<std::vector<std::pair<int, int>>> schedule;
        std::vector<std::pair<int, int>> assignment(num_worker);

        if (num_partition == 1)
            return {{{0, 0}}};

        if (naive_parallel) {
            for (int i = 0; i < num_worker; i++)
                assignment[i] = {i, 0};
            return {assignment};
        }

        if (tied_weights)
            for (int x = 0; x < num_partition; x += num_worker * 2)
                for (int y = 0; y < num_partition; y += num_worker * 2) {
                    // diagonal
                    for (int i = 0; i < num_worker; i++) {
                        int head_partition_id = x + i;
                        int tail_partition_id = y + i;
                        assignment[i] = {head_partition_id, tail_partition_id};
                    }
                    schedule.push_back(assignment);
                    for (int i = 0; i < num_worker; i++) {
                        int head_partition_id = x + num_worker + i;
                        int tail_partition_id = y + num_worker + i;
                        assignment[i] = {head_partition_id, tail_partition_id};
                    }
                    schedule.push_back(assignment);
                    for (int group_size = 1; group_size <= num_worker; group_size *= 2)
                        for (int offset = 0; offset < group_size; offset++) {
                            for (int i = 0; i < num_worker; i++) {
                                int head_partition_id = x + (i / group_size * 2) * group_size + i % group_size;
                                int tail_partition_id = y + (i / group_size * 2 + 1) * group_size
                                                        + (i + offset) % group_size;
                                assignment[i] = {head_partition_id, tail_partition_id};
                            }
                            schedule.push_back(assignment);
                            for (int i = 0; i < num_worker; i++)
                                std::swap(assignment[i].first, assignment[i].second);
                            schedule.push_back(assignment);
                        }
                }
        else
            for (int x = 0; x < num_partition; x += num_worker)
                for (int y = 0; y < num_partition; y += num_worker)
                    for (int offset = 0; offset < num_worker; offset++) {
                        for (int i = 0; i < num_worker; i++) {
                            int head_partition_id = x + (i + offset) % num_worker;
                            int tail_partition_id = y + i;
                            assignment[i] = {head_partition_id, tail_partition_id};
                        }
                        schedule.push_back(assignment);
                    }

        return schedule;
    }