Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
N
ngraph
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Packages
Packages
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
submodule
ngraph
Commits
be7aef0b
Commit
be7aef0b
authored
Jul 23, 2019
by
Robert Kimball
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
fix CI errors
parent
ec9ed92c
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
8 additions
and
11 deletions
+8
-11
benchmark_pipelined.cpp
src/tools/nbench/benchmark_pipelined.cpp
+1
-1
benchmark_utils.hpp
src/tools/nbench/benchmark_utils.hpp
+7
-10
No files found.
src/tools/nbench/benchmark_pipelined.cpp
View file @
be7aef0b
...
@@ -14,6 +14,7 @@
...
@@ -14,6 +14,7 @@
// limitations under the License.
// limitations under the License.
//*****************************************************************************
//*****************************************************************************
#include <array>
#include <condition_variable>
#include <condition_variable>
#include <mutex>
#include <mutex>
#include <thread>
#include <thread>
...
@@ -165,7 +166,6 @@ vector<runtime::PerformanceCounter> run_benchmark_pipelined(shared_ptr<Function>
...
@@ -165,7 +166,6 @@ vector<runtime::PerformanceCounter> run_benchmark_pipelined(shared_ptr<Function>
}
}
}
}
size_t
current_iteration
=
0
;
thread
threads
[
pipeline_depth
];
thread
threads
[
pipeline_depth
];
for
(
size_t
i
=
0
;
i
<
pipeline_depth
;
i
++
)
for
(
size_t
i
=
0
;
i
<
pipeline_depth
;
i
++
)
{
{
...
...
src/tools/nbench/benchmark_utils.hpp
View file @
be7aef0b
...
@@ -24,21 +24,18 @@
...
@@ -24,21 +24,18 @@
#include "ngraph/serializer.hpp"
#include "ngraph/serializer.hpp"
#include "ngraph/util.hpp"
#include "ngraph/util.hpp"
using
namespace
std
;
using
namespace
ngraph
;
void
set_denormals_flush_to_zero
();
void
set_denormals_flush_to_zero
();
void
random_init
(
s
hared_ptr
<
runtime
::
Tensor
>
tensor
);
void
random_init
(
s
td
::
shared_ptr
<
ngraph
::
runtime
::
Tensor
>
tensor
);
std
::
default_random_engine
&
get_random_engine
();
std
::
default_random_engine
&
get_random_engine
();
template
<
typename
T
>
template
<
typename
T
>
void
init_int_tensor
(
s
hared_ptr
<
runtime
::
Tensor
>
tensor
,
T
min
,
T
max
)
void
init_int_tensor
(
s
td
::
shared_ptr
<
ngraph
::
runtime
::
Tensor
>
tensor
,
T
min
,
T
max
)
{
{
size_t
size
=
tensor
->
get_element_count
();
size_t
size
=
tensor
->
get_element_count
();
uniform_int_distribution
<
T
>
dist
(
min
,
max
);
std
::
uniform_int_distribution
<
T
>
dist
(
min
,
max
);
vector
<
T
>
vec
(
size
);
std
::
vector
<
T
>
vec
(
size
);
for
(
T
&
element
:
vec
)
for
(
T
&
element
:
vec
)
{
{
element
=
dist
(
get_random_engine
());
element
=
dist
(
get_random_engine
());
...
@@ -47,11 +44,11 @@ void init_int_tensor(shared_ptr<runtime::Tensor> tensor, T min, T max)
...
@@ -47,11 +44,11 @@ void init_int_tensor(shared_ptr<runtime::Tensor> tensor, T min, T max)
}
}
template
<
typename
T
>
template
<
typename
T
>
void
init_real_tensor
(
s
hared_ptr
<
runtime
::
Tensor
>
tensor
,
T
min
,
T
max
)
void
init_real_tensor
(
s
td
::
shared_ptr
<
ngraph
::
runtime
::
Tensor
>
tensor
,
T
min
,
T
max
)
{
{
size_t
size
=
tensor
->
get_element_count
();
size_t
size
=
tensor
->
get_element_count
();
uniform_real_distribution
<
T
>
dist
(
min
,
max
);
std
::
uniform_real_distribution
<
T
>
dist
(
min
,
max
);
vector
<
T
>
vec
(
size
);
std
::
vector
<
T
>
vec
(
size
);
for
(
T
&
element
:
vec
)
for
(
T
&
element
:
vec
)
{
{
element
=
dist
(
get_random_engine
());
element
=
dist
(
get_random_engine
());
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment