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
1437bdda
Commit
1437bdda
authored
17 years ago
by
Moe Jette
Browse files
Options
Downloads
Patches
Plain Diff
svn merge -r12089:12093
https://eris.llnl.gov/svn/slurm/branches/slurm-1.2
parent
2a14a769
No related branches found
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
NEWS
+2
-0
2 additions, 0 deletions
NEWS
src/slurmctld/node_scheduler.c
+12
-8
12 additions, 8 deletions
src/slurmctld/node_scheduler.c
with
14 additions
and
8 deletions
NEWS
+
2
−
0
View file @
1437bdda
...
@@ -48,6 +48,8 @@ documents those changes that are of interest to users and admins.
...
@@ -48,6 +48,8 @@ documents those changes that are of interest to users and admins.
-- Added PMI timing information to srun debug mode to aid in tuning.
-- Added PMI timing information to srun debug mode to aid in tuning.
Use "srun -vv ..." to see the information.
Use "srun -vv ..." to see the information.
-- Added checkpoint/ompi (OpenMPI) plugin (still under development).
-- Added checkpoint/ompi (OpenMPI) plugin (still under development).
-- Fix bug in load leveling logic added to v1.2.13 which can cause an
infinite loop and hang slurmctld when sharing nodes between jobs.
* Changes in SLURM 1.2.13
* Changes in SLURM 1.2.13
=========================
=========================
...
...
This diff is collapsed.
Click to expand it.
src/slurmctld/node_scheduler.c
+
12
−
8
View file @
1437bdda
...
@@ -289,24 +289,28 @@ _pick_best_load(struct job_record *job_ptr, bitstr_t * bitmap,
...
@@ -289,24 +289,28 @@ _pick_best_load(struct job_record *job_ptr, bitstr_t * bitmap,
uint32_t
req_nodes
,
bool
test_only
)
uint32_t
req_nodes
,
bool
test_only
)
{
{
bitstr_t
*
basemap
;
bitstr_t
*
basemap
;
int
i
,
error_code
,
node_cnt
,
prev_cnt
=
0
,
equal
=
0
;
int
i
,
error_code
=
EINVAL
,
node_cnt
=
0
,
prev_cnt
=
0
,
set_cnt
;
basemap
=
bit_copy
(
bitmap
);
basemap
=
bit_copy
(
bitmap
);
if
(
basemap
==
NULL
)
if
(
basemap
==
NULL
)
fatal
(
"bit_copy malloc failure"
);
fatal
(
"bit_copy malloc failure"
);
for
(
i
=
0
;
1
;
i
++
)
{
set_cnt
=
bit_set_count
(
bitmap
);
if
((
set_cnt
<
min_nodes
)
||
((
req_nodes
>
min_nodes
)
&&
(
set_cnt
<
req_nodes
)))
return
error_code
;
/* not usable */
for
(
i
=
0
;
node_cnt
<
set_cnt
;
i
++
)
{
node_cnt
=
_job_count_bitmap
(
basemap
,
bitmap
,
i
);
node_cnt
=
_job_count_bitmap
(
basemap
,
bitmap
,
i
);
if
((
node_cnt
==
0
)
||
(
node_cnt
==
prev_cnt
))
if
((
node_cnt
==
0
)
||
(
node_cnt
==
prev_cnt
))
continue
;
continue
;
/* nothing new to test */
if
((
node_cnt
<
min_nodes
)
||
if
((
node_cnt
<
min_nodes
)
||
((
req_nodes
>
min_nodes
)
&&
(
node_cnt
<
req_nodes
)))
((
req_nodes
>
min_nodes
)
&&
(
node_cnt
<
req_nodes
)))
continue
;
continue
;
/* need more nodes */
equal
=
bit_equal
(
basemap
,
bitmap
);
error_code
=
select_g_job_test
(
job_ptr
,
bitmap
,
error_code
=
select_g_job_test
(
job_ptr
,
bitmap
,
min_nodes
,
max_nodes
,
min_nodes
,
max_nodes
,
req_nodes
,
test_only
);
req_nodes
,
test_only
);
if
(
!
error_code
||
equal
)
if
(
!
error_code
)
break
;
break
;
prev_cnt
=
node_cnt
;
prev_cnt
=
node_cnt
;
}
}
...
...
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