| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189 | /* * * Copyright 2015-2016, Google Inc. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are * met: * *     * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. *     * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following disclaimer * in the documentation and/or other materials provided with the * distribution. *     * Neither the name of Google Inc. nor the names of its * contributors may be used to endorse or promote products derived from * this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * */#include <memory>#include <set>#include <grpc++/impl/codegen/config_protobuf.h>#include <gflags/gflags.h>#include <grpc/support/log.h>#include "test/cpp/qps/driver.h"#include "test/cpp/qps/parse_json.h"#include "test/cpp/qps/report.h"#include "test/cpp/util/benchmark_config.h"DEFINE_string(scenarios_file, "",              "JSON file containing an array of Scenario objects");DEFINE_string(scenarios_json, "",              "JSON string containing an array of Scenario objects");DEFINE_bool(quit, false, "Quit the workers");DEFINE_double(initial_offered_load, 1000.0, "Set up for intial offered load");DEFINE_double(targeted_cpu_load, 99.0, "targeted cpu load");namespace grpc {namespace testing {static double GetCpuLoad(Scenario * scenario, double offered_load) {  scenario->mutable_client_config()->mutable_load_params()->mutable_poisson()->    set_offered_load(offered_load);  auto result =      RunScenario(scenario->client_config(), scenario->num_clients(),                  scenario->server_config(), scenario->num_servers(),                  scenario->warmup_seconds(), scenario->benchmark_seconds(),                  scenario->spawn_local_worker_count());  GetReporter()->ReportQPS(*result);  GetReporter()->ReportQPSPerCore(*result);  GetReporter()->ReportLatency(*result);  GetReporter()->ReportTimes(*result);  GetReporter()->ReportCpuUsage(*result);  bool success = true;  for (int i = 0; success && i < result->client_success_size(); i++) {    success = result->client_success(i);  }  for (int i = 0; success && i < result->server_success_size(); i++) {    success = result->server_success(i);  }  return success ? result->summary().server_cpu_usage() : -1;}static double BinarySearch(Scenario * scenario, double targeted_cpu_load,                        double low_offered_load, double high_offered_load) {  int low = int(low_offered_load);  int high = int(high_offered_load);  while (low <= high - 500) {    int mid = low + (high - low) /2;    double current_cpu_load = GetCpuLoad(scenario, double(mid));    gpr_log(GPR_INFO, "binary search: current_offered_load %d", mid);    if (targeted_cpu_load < current_cpu_load) {      high = mid -1;    }    else if (targeted_cpu_load > current_cpu_load) {      low = mid + 1;    }    else {      high = mid - 1;    }  }  return double(low);}static double SearchOfferedLoad(double initial_offered_load, double targeted_cpu_load,                                Scenario * scenario) {    std::cerr << "RUNNING SCENARIO: " << scenario->name() << "\n";    double current_offered_load = initial_offered_load;    double current_cpu_load = GetCpuLoad(scenario, current_offered_load);    if (current_cpu_load > targeted_cpu_load) {      gpr_log(GPR_ERROR, "Initial offered load too high");      return -1;    }    do {      current_offered_load *= 2;      current_cpu_load = GetCpuLoad(scenario, current_offered_load);      gpr_log(GPR_INFO, "do while: current_offered_load %f", current_offered_load);    } while (current_cpu_load < targeted_cpu_load);    double targeted_offered_load = BinarySearch(scenario, targeted_cpu_load,                                                current_offered_load / 2,                                                current_offered_load);    gpr_log(GPR_INFO, "targeted_offered_load %f", targeted_offered_load);    return targeted_offered_load;}static bool CpuLoadDriver() {  grpc::string json;  bool scfile = (FLAGS_scenarios_file != "");  bool scjson = (FLAGS_scenarios_json != "");  if ((!scfile && !scjson && !FLAGS_quit) ||      (scfile && (scjson || FLAGS_quit)) || (scjson && FLAGS_quit)) {    gpr_log(GPR_ERROR,            "Exactly one of --scenarios_file, --scenarios_json, "            "or --quit must be set");    abort();  }  if (scfile) {    // Read the json data from disk    FILE *json_file = fopen(FLAGS_scenarios_file.c_str(), "r");    GPR_ASSERT(json_file != NULL);    fseek(json_file, 0, SEEK_END);    long len = ftell(json_file);    char *data = new char[len];    fseek(json_file, 0, SEEK_SET);    GPR_ASSERT(len == (long)fread(data, 1, len, json_file));    fclose(json_file);    json = grpc::string(data, data + len);    delete[] data;  } else if (scjson) {    json = FLAGS_scenarios_json.c_str();  } else if (FLAGS_quit) {    return RunQuit();  }  // Parse into an array of scenarios  Scenarios scenarios;  ParseJson(json.c_str(), "grpc.testing.Scenarios", &scenarios);  // Make sure that there is at least some valid scenario here  GPR_ASSERT(scenarios.scenarios_size() > 0);  bool success = true;  for (int i = 0; i < scenarios.scenarios_size(); i++) {    Scenario *scenario = scenarios.mutable_scenarios(i);    SearchOfferedLoad(FLAGS_initial_offered_load, FLAGS_targeted_cpu_load, scenario);    // GetCpuLoad(scenario, FLAGS_initial_offered_load);  }  return success;}}  // namespace testing}  // namespace grpcint main(int argc, char **argv) {  grpc::testing::InitBenchmark(&argc, &argv, true);  bool ok = grpc::testing::CpuLoadDriver();  return ok ? 0 : 1;}
 |