Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
Slurm
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
tud-zih-energy
Slurm
Commits
d6894958
Commit
d6894958
authored
16 years ago
by
Moe Jette
Browse files
Options
Downloads
Patches
Plain Diff
optimize task/affinity's locality for jobs that need more than one cpu per task
parent
f776cb6d
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/plugins/task/affinity/dist_tasks.c
+83
-3
83 additions, 3 deletions
src/plugins/task/affinity/dist_tasks.c
with
83 additions
and
3 deletions
src/plugins/task/affinity/dist_tasks.c
+
83
−
3
View file @
d6894958
...
@@ -58,6 +58,8 @@ static int _task_layout_lllp_block(launch_tasks_request_msg_t *req,
...
@@ -58,6 +58,8 @@ static int _task_layout_lllp_block(launch_tasks_request_msg_t *req,
uint32_t
node_id
,
bitstr_t
***
masks_p
);
uint32_t
node_id
,
bitstr_t
***
masks_p
);
static
int
_task_layout_lllp_cyclic
(
launch_tasks_request_msg_t
*
req
,
static
int
_task_layout_lllp_cyclic
(
launch_tasks_request_msg_t
*
req
,
uint32_t
node_id
,
bitstr_t
***
masks_p
);
uint32_t
node_id
,
bitstr_t
***
masks_p
);
static
int
_task_layout_lllp_multi
(
launch_tasks_request_msg_t
*
req
,
uint32_t
node_id
,
bitstr_t
***
masks_p
);
static
void
_lllp_map_abstract_masks
(
const
uint32_t
maxtasks
,
static
void
_lllp_map_abstract_masks
(
const
uint32_t
maxtasks
,
bitstr_t
**
masks
);
bitstr_t
**
masks
);
...
@@ -262,7 +264,10 @@ void lllp_distribution(launch_tasks_request_msg_t *req, uint32_t node_id)
...
@@ -262,7 +264,10 @@ void lllp_distribution(launch_tasks_request_msg_t *req, uint32_t node_id)
rc
=
_task_layout_lllp_cyclic
(
req
,
node_id
,
&
masks
);
rc
=
_task_layout_lllp_cyclic
(
req
,
node_id
,
&
masks
);
break
;
break
;
default:
default:
rc
=
_task_layout_lllp_cyclic
(
req
,
node_id
,
&
masks
);
if
(
req
->
cpus_per_task
>
1
)
rc
=
_task_layout_lllp_multi
(
req
,
node_id
,
&
masks
);
else
rc
=
_task_layout_lllp_cyclic
(
req
,
node_id
,
&
masks
);
req
->
task_dist
=
SLURM_DIST_BLOCK_CYCLIC
;
req
->
task_dist
=
SLURM_DIST_BLOCK_CYCLIC
;
break
;
break
;
}
}
...
@@ -565,6 +570,82 @@ static void _expand_masks(uint16_t cpu_bind_type, const uint32_t maxtasks,
...
@@ -565,6 +570,82 @@ static void _expand_masks(uint16_t cpu_bind_type, const uint32_t maxtasks,
}
}
}
}
/*
* _task_layout_lllp_multi
*
* A variant of _task_layout_lllp_cyclic for use with allocations having
* more than one CPU per task, put the tasks as close as possible (fill
* core rather than going next socket for the extra task)
*
*/
static
int
_task_layout_lllp_multi
(
launch_tasks_request_msg_t
*
req
,
uint32_t
node_id
,
bitstr_t
***
masks_p
)
{
int
last_taskcount
=
-
1
,
taskcount
=
0
;
uint16_t
c
,
i
,
s
,
t
,
hw_sockets
=
0
,
hw_cores
=
0
,
hw_threads
=
0
;
uint16_t
num_threads
,
num_cores
,
num_sockets
;
int
size
,
maxtasks
=
req
->
tasks_to_launch
[(
int
)
node_id
];
bitstr_t
*
avail_map
;
bitstr_t
**
masks
=
NULL
;
info
(
"_task_layout_lllp_multi "
);
avail_map
=
_get_avail_map
(
req
,
&
hw_sockets
,
&
hw_cores
,
&
hw_threads
);
if
(
!
avail_map
)
return
SLURM_ERROR
;
*
masks_p
=
xmalloc
(
maxtasks
*
sizeof
(
bitstr_t
*
));
masks
=
*
masks_p
;
size
=
bit_set_count
(
avail_map
);
if
(
!
size
||
size
<
req
->
cpus_per_task
)
{
error
(
"task/affinity: no set bits in avail_map!"
);
bit_free
(
avail_map
);
return
SLURM_ERROR
;
}
size
=
bit_size
(
avail_map
);
num_sockets
=
MIN
(
req
->
max_sockets
,
hw_sockets
);
num_cores
=
MIN
(
req
->
max_cores
,
hw_cores
);
num_threads
=
MIN
(
req
->
max_threads
,
hw_threads
);
i
=
0
;
while
(
taskcount
<
maxtasks
)
{
if
(
taskcount
==
last_taskcount
)
fatal
(
"_task_layout_lllp_multi failure"
);
last_taskcount
=
taskcount
;
for
(
s
=
0
;
s
<
hw_sockets
;
s
++
)
{
for
(
c
=
0
;
c
<
hw_cores
;
c
++
)
{
for
(
t
=
0
;
t
<
num_threads
;
t
++
)
{
uint16_t
bit
=
s
*
(
hw_cores
*
hw_threads
)
+
c
*
(
hw_threads
)
+
t
;
if
(
bit_test
(
avail_map
,
bit
)
==
0
)
continue
;
if
(
masks
[
taskcount
]
==
NULL
)
masks
[
taskcount
]
=
(
bitstr_t
*
)
bit_alloc
(
size
);
bit_set
(
masks
[
taskcount
],
bit
);
if
(
++
i
<
req
->
cpus_per_task
)
continue
;
i
=
0
;
if
(
++
taskcount
>=
maxtasks
)
break
;
}
if
(
taskcount
>=
maxtasks
)
break
;
}
if
(
taskcount
>=
maxtasks
)
break
;
}
}
bit_free
(
avail_map
);
/* last step: expand the masks to bind each task
* to the requested resource */
_expand_masks
(
req
->
cpu_bind_type
,
maxtasks
,
masks
,
hw_sockets
,
hw_cores
,
hw_threads
);
return
SLURM_SUCCESS
;
}
/*
/*
* _task_layout_lllp_cyclic
* _task_layout_lllp_cyclic
...
@@ -620,9 +701,8 @@ static int _task_layout_lllp_cyclic(launch_tasks_request_msg_t *req,
...
@@ -620,9 +701,8 @@ static int _task_layout_lllp_cyclic(launch_tasks_request_msg_t *req,
num_threads
=
MIN
(
req
->
max_threads
,
hw_threads
);
num_threads
=
MIN
(
req
->
max_threads
,
hw_threads
);
i
=
0
;
i
=
0
;
while
(
taskcount
<
maxtasks
)
{
while
(
taskcount
<
maxtasks
)
{
if
(
taskcount
==
last_taskcount
)
{
if
(
taskcount
==
last_taskcount
)
fatal
(
"_task_layout_lllp_cyclic failure"
);
fatal
(
"_task_layout_lllp_cyclic failure"
);
}
last_taskcount
=
taskcount
;
last_taskcount
=
taskcount
;
for
(
t
=
0
;
t
<
num_threads
;
t
++
)
{
for
(
t
=
0
;
t
<
num_threads
;
t
++
)
{
for
(
c
=
0
;
c
<
hw_cores
;
c
++
)
{
for
(
c
=
0
;
c
<
hw_cores
;
c
++
)
{
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment