Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
snf-ganeti
Manage
Activity
Members
Labels
Plan
Issues
0
Issue boards
Milestones
Wiki
Code
Merge requests
0
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
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
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
itminedu
snf-ganeti
Commits
c6702e5e
Commit
c6702e5e
authored
15 years ago
by
Iustin Pop
Browse files
Options
Downloads
Patches
Plain Diff
Add man page and .gitignore entry for hail
parent
8c2ebac8
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
.gitignore
+1
-0
1 addition, 0 deletions
.gitignore
hail.1
+47
-0
47 additions, 0 deletions
hail.1
with
48 additions
and
0 deletions
.gitignore
+
1
−
0
View file @
c6702e5e
...
...
@@ -14,6 +14,7 @@ NEWS.html
hn1
hbal
hscan
hail
*.prof*
*.stat
...
...
This diff is collapsed.
Click to expand it.
hail.1
0 → 100644
+
47
−
0
View file @
c6702e5e
.TH HAIL 1 2009-03-23 htools "Ganeti H-tools"
.SH NAME
hail \- Ganeti IAllocator plugin
.SH SYNOPSIS
.B hail
.I "input-file"
.B hail
.B --version
.SH DESCRIPTION
hail is a Ganeti IAllocator plugin that allows automatic instance
placement and automatic instance secondary node replacement using the
same algorithm as \fBhbal\fR(1).
The program takes input via a JSON-file containing current cluster
state and the request details, and output (on stdout) a JSON-formatted
response. In case of critical failures, the error message is printed
on stderr and the exit code is changed to show failure.
.SS ALGORITHM
The program uses a simplified version of the hbal algorithm.
For relocations, we try to change the secondary node of the instance
to all the valid other nodes; the node which results in the best
cluster score is chosen.
For single-node allocations (non-mirrored instances), again we select
the node which, when chosen as the primary node, gives the best score.
For dual-node allocations (mirrored instances), we chose the best
pair; this is the only choice where the algoritm is non-trivial
with regard to cluster size.
For all choices, the cluster scoring is identical to the hbal
algorithm.
.SH EXIT STATUS
The exist status of the command will be zero, unless for some reason
the algorithm fatally failed (e.g. wrong node or instance data).
.SH SEE ALSO
.BR hn1 "(1), " hscan "(1), " ganeti "(7), " gnt-instance "(8), "
.BR gnt-node "(8)"
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