/******************************************************************************** * Copyright (C) 2014-2018 GSI Helmholtzzentrum fuer Schwerionenforschung GmbH * * * * This software is distributed under the terms of the * * GNU Lesser General Public Licence (LGPL) version 3, * * copied verbatim in the file "LICENSE" * ********************************************************************************/ #include "FairMQBenchmarkSampler.h" #include #include "../FairMQLogger.h" #include "../options/FairMQProgOptions.h" #include #include using namespace std; FairMQBenchmarkSampler::FairMQBenchmarkSampler() : fMultipart(false) , fNumParts(1) , fMsgSize(10000) , fMsgRate(0) , fNumIterations(0) , fMaxIterations(0) , fOutChannelName() { } FairMQBenchmarkSampler::~FairMQBenchmarkSampler() { } void FairMQBenchmarkSampler::InitTask() { fMultipart = fConfig->GetValue("multipart"); fNumParts = fConfig->GetValue("num-parts"); fMsgSize = fConfig->GetValue("msg-size"); fMsgRate = fConfig->GetValue("msg-rate"); fMaxIterations = fConfig->GetValue("max-iterations"); fOutChannelName = fConfig->GetValue("out-channel"); } void FairMQBenchmarkSampler::Run() { // store the channel reference to avoid traversing the map on every loop iteration FairMQChannel& dataOutChannel = fChannels.at(fOutChannelName).at(0); FairMQMessagePtr baseMsg(dataOutChannel.NewMessage(fMsgSize)); LOG(info) << "Starting the benchmark with message size of " << fMsgSize << " and " << fMaxIterations << " iterations."; auto tStart = chrono::high_resolution_clock::now(); fair::mq::tools::RateLimiter rateLimiter(fMsgRate); while (!NewStatePending()) { if (fMultipart) { FairMQParts parts; for (size_t i = 0; i < fNumParts; ++i) { parts.AddPart(dataOutChannel.NewMessage(fMsgSize)); } if (dataOutChannel.Send(parts) >= 0) { if (fMaxIterations > 0) { if (fNumIterations >= fMaxIterations) { break; } } ++fNumIterations; } } else { FairMQMessagePtr msg(dataOutChannel.NewMessage(fMsgSize)); if (dataOutChannel.Send(msg) >= 0) { if (fMaxIterations > 0) { if (fNumIterations >= fMaxIterations) { break; } } ++fNumIterations; } } if (fMsgRate > 0) { rateLimiter.maybe_sleep(); } } auto tEnd = chrono::high_resolution_clock::now(); LOG(info) << "Done " << fNumIterations << " iterations in " << chrono::duration(tEnd - tStart).count() << "ms."; }