Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/design/dedicated-volume.md
Original file line number Diff line number Diff line change
Expand Up @@ -80,7 +80,7 @@ type VolumeSpec struct {
- By default, this is empty. The task instance will use volumes defined in `JobSpec.Volumes` and `TaskSpec.Template`.

- If `Volumes` are specified, these pvcs are referenced by all the pods of the task.
If the the VolumeSpec specifies the `GenerateName` while the `VolumeClaimName` left empty, the pvc name is generated with task index suffixed by job controller.
If the VolumeSpec specifies the `GenerateName` while the `VolumeClaimName` left empty, the pvc name is generated with task index suffixed by job controller.
Otherwise, the explicitly declared pvc will be shared by all pods of a task.

- If the pvcs does not exist, job controller will create them.
Expand Down
2 changes: 1 addition & 1 deletion docs/design/queue-resource-reservation-design.md
Original file line number Diff line number Diff line change
Expand Up @@ -121,7 +121,7 @@ lokced,The smaller the impact on the cluster.
##### Lock Strategy
* schedule relock

for every 5s or 10s. the worker in the queueController will find the best combination nodes for a a queue.
for every 5s or 10s. the worker in the queueController will find the best combination nodes for a queue.
and update the queue's locked nodes,and caculate the idle resources on the locked nodes.


Expand Down
2 changes: 1 addition & 1 deletion pkg/scheduler/plugins/numaaware/policy/policy.go
Original file line number Diff line number Diff line change
Expand Up @@ -128,7 +128,7 @@ func iterateAllProviderTopologyHints(allProviderHints [][]TopologyHint, callback
}

// Loop through all hints for provider 'i', and recurse to build the
// the permutation of this hint with all hints from providers 'i++'.
// permutation of this hint with all hints from providers 'i++'.
for j := range allProviderHints[i] {
iterate(i+1, append(accum, allProviderHints[i][j]))
}
Expand Down