3d1d37b96a
Adds a new accommodation instruction 'best_effort' that allows the deployment to proceed even if the number of available compute nodes is less than what was requested. For example, this will create a single pair of agents on separate compute nodes if possible, but will fall back to creating them on the same compute node if only one is available: accommodation: pair, single_room, best_effort, compute_nodes: 2 Change-Id: I1986f550ac0dc934bfa5db84b40a6419d6608c7e Closes-Bug: 1807630
73 lines
1.5 KiB
YAML
73 lines
1.5 KiB
YAML
name: Shaker scenario schema
|
|
type: map
|
|
allowempty: True
|
|
mapping:
|
|
title:
|
|
type: str
|
|
description:
|
|
type: str
|
|
deployment:
|
|
type: map
|
|
mapping:
|
|
support_templates:
|
|
type: seq
|
|
sequence:
|
|
- type: map
|
|
mapping:
|
|
name:
|
|
type: str
|
|
template:
|
|
type: str
|
|
env_file:
|
|
type: str
|
|
template:
|
|
type: str
|
|
env_file:
|
|
type: str
|
|
agents:
|
|
type: any
|
|
accommodation:
|
|
type: seq
|
|
matching: any
|
|
sequence:
|
|
- type: str
|
|
enum: [pair, alone, double_room, single_room, mixed_room, cross_az, best_effort]
|
|
- type: map
|
|
mapping:
|
|
density:
|
|
type: number
|
|
compute_nodes:
|
|
type: number
|
|
zones:
|
|
type: seq
|
|
sequence:
|
|
- type: str
|
|
execution:
|
|
type: map
|
|
mapping:
|
|
progression:
|
|
type: str
|
|
enum: [linear, arithmetic, quadratic, geometric]
|
|
tests:
|
|
type: seq
|
|
required: True
|
|
sequence:
|
|
- type: map
|
|
allowempty: True
|
|
mapping:
|
|
title:
|
|
type: str
|
|
class:
|
|
type: str
|
|
required: True
|
|
method:
|
|
type: str
|
|
time:
|
|
type: int
|
|
range:
|
|
min: 1
|
|
sla:
|
|
type: seq
|
|
sequence:
|
|
- type: str
|