Skip to content

Commit 2305fd4

Browse files
committed
small edits
1 parent 3244cdc commit 2305fd4

1 file changed

Lines changed: 7 additions & 9 deletions

File tree

include/osp/bsp/model/BspSchedule.hpp

Lines changed: 7 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -19,9 +19,6 @@ limitations under the License.
1919
#pragma once
2020

2121
#include <algorithm>
22-
#include <iostream>
23-
#include <list>
24-
#include <map>
2522
#include <stdexcept>
2623
#include <unordered_set>
2724
#include <vector>
@@ -31,23 +28,24 @@ limitations under the License.
3128
#include "SetSchedule.hpp"
3229
#include "osp/bsp/model/cost/LazyCommunicationCost.hpp"
3330
#include "osp/concepts/computational_dag_concept.hpp"
34-
#include <numeric>
3531

3632
namespace osp {
3733

3834
/**
3935
* @class BspSchedule
4036
* @brief Represents a schedule for the Bulk Synchronous Parallel (BSP) model.
4137
*
42-
* The `BspSchedule` class manages the assignment of nodes to processors and supersteps within the BSP
43-
* model. It serves as a core component for scheduling algorithms, providing mechanisms to:
38+
* The `BspSchedule` class manages the assignment of nodes to processors and supersteps within the BSP model.
39+
* It serves as a core component for scheduling algorithms, providing mechanisms to:
4440
* - Store and retrieve node-to-processor and node-to-superstep assignments.
4541
* - Validate schedules against precedence, memory, and node type constraints.
46-
* - Compute costs associated with the schedule, such as work and communication costs.
42+
* - Compute costs associated with the schedule.
4743
* - Manipulate the schedule, including updating assignments and merging supersteps.
4844
*
49-
* This class is templated on `Graph_t`, which must satisfy the `computational_dag_concept`. It interacts closely with
50-
* `BspInstance` to access problem-specific data and constraints.
45+
* This class is templated on `Graph_t`, which must satisfy the `computational_dag_concept`.
46+
* Moreover, the work and communication weights of the nodes must be of the same type in order to properly compute the cost.
47+
*
48+
* It interacts closely with `BspInstance` to access problem-specific data and constraints. In fact, a `BspSchedule` object is tied to a `BspInstance` object.
5149
*
5250
* @tparam Graph_t The type of the computational DAG, which must satisfy `is_computational_dag_v`.
5351
* @see BspInstance

0 commit comments

Comments
 (0)