memgraph/tests/feature_benchmark/disabled_apollo_runs.yaml

- name: feature_benchmark__ha__read
  cd: ha/read
  commands: ./runner.sh
  infiles:
    - runner.sh # runner script
    - raft.json # raft configuration file
    - coordination.json # coordination configuration file
    - ../../../../build_release/tests/feature_benchmark/ha/read/benchmark # benchmark binary
    - ../../../../build_release/memgraph_ha # memgraph binary
  enable_network: true

- name: feature_benchmark__ha__write
  cd: ha/write
  commands: ./runner.sh
  infiles:
    - runner.sh # runner script
    - raft.json # raft configuration file
    - coordination.json # coordination configuration file
    - ../../../../build_release/tests/feature_benchmark/ha/write/benchmark # benchmark binary
    - ../../../../build_release/memgraph_ha # memgraph binary
  enable_network: true
Measure read throughput in HA Summary: This macro benchmark measures read throughput in HA. The test first creates a random graph with a given number of nodes and edges. After that, it concurently performs the following query for 10 seconds: ``` MATCH (n {id:$random_id})-[e]->(m) RETURN e, m; ``` In other words, it randomly picks a node and returns all its neighbours. Locally measured results are as follows: \| nodes \| edges \| queries per second \| \| 100 \| 500 \| 8900 \| \| 1000 \| 5000 \| 2700 \| \| 10000 \| 50000 \| 1200 \| Running the same test on Memgraph single node yields very similar results (up to a few hundred queries). Reviewers: msantl Reviewed By: msantl Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D1916 2019-03-12 21:06:14 +08:00			`- name: feature_benchmark__ha__read`
			`cd: ha/read`
Fix flaky ha feature benchmark Reviewers: msantl Reviewed By: msantl Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D1820 2019-01-21 18:10:32 +08:00			`commands: ./runner.sh`
			`infiles:`
			`- runner.sh # runner script`
			`- raft.json # raft configuration file`
			`- coordination.json # coordination configuration file`
Measure read throughput in HA Summary: This macro benchmark measures read throughput in HA. The test first creates a random graph with a given number of nodes and edges. After that, it concurently performs the following query for 10 seconds: ``` MATCH (n {id:$random_id})-[e]->(m) RETURN e, m; ``` In other words, it randomly picks a node and returns all its neighbours. Locally measured results are as follows: \| nodes \| edges \| queries per second \| \| 100 \| 500 \| 8900 \| \| 1000 \| 5000 \| 2700 \| \| 10000 \| 50000 \| 1200 \| Running the same test on Memgraph single node yields very similar results (up to a few hundred queries). Reviewers: msantl Reviewed By: msantl Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D1916 2019-03-12 21:06:14 +08:00			`- ../../../../build_release/tests/feature_benchmark/ha/read/benchmark # benchmark binary`
			`- ../../../../build_release/memgraph_ha # memgraph binary`
			`enable_network: true`

			`- name: feature_benchmark__ha__write`
			`cd: ha/write`
			`commands: ./runner.sh`
			`infiles:`
			`- runner.sh # runner script`
			`- raft.json # raft configuration file`
			`- coordination.json # coordination configuration file`
			`- ../../../../build_release/tests/feature_benchmark/ha/write/benchmark # benchmark binary`
			`- ../../../../build_release/memgraph_ha # memgraph binary`
Fix flaky ha feature benchmark Reviewers: msantl Reviewed By: msantl Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D1820 2019-01-21 18:10:32 +08:00			`enable_network: true`