Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

WIP: PMU data collection #4

Open
wants to merge 9 commits into
base: dev
Choose a base branch
from
Open

WIP: PMU data collection #4

Changes from 1 commit
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
ab9df0e
add collector
haojiang66 Jul 28, 2023
6042ca2
L1_DCM
haojiang66 Jul 29, 2023
c0db651
7_31
haojiang66 Jul 31, 2023
b7e5b5e
7_31_2
haojiang66 Jul 31, 2023
360233c
using vector and changed forms
haojiang66 Aug 1, 2023
f76f828
Add: dataq store
zhengly123 Aug 3, 2023
46d83cd
Add: new test case sketch
zhengly123 Aug 3, 2023
e9c42d3
do some storing and std
haojiang66 Aug 8, 2023
a0d2a36
add io and pictures
haojiang66 Aug 28, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 20 additions & 11 deletions test/test_collector.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -34,13 +34,13 @@ int main() {
// test0();
Controller controller;

DataVec d1, d2, d3, d4, d5, d6;
DataVec d1, d2, d3, d4, d5, d6, d7, d8;

const int N = 1000000;
const int N = 10000000000;

int test_data[N];
int *test_data = new int[N];

int test_index[N];
int *test_index = new int[N];
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Use vector or shared_ptr


for (int i = 0; i < N; i++) {
test_data[i] = i;
Expand All @@ -57,14 +57,16 @@ int main() {
result(d1, d2);

// TOOD: compare the whether the printed data matches your expectation

for (int i = 0; i < N; i++) {
test_data[i] = i;
}
d3 = controller.readData();
workload(test_data, test_index, N);
d4 = controller.readData();
result(d3, d4);
printf("%d %d %d %d %d %d %d %d\n", test_index[0], test_index[1],
test_index[2], test_index[3], test_index[4], test_index[5],
test_index[6], test_index[7]);

//以下为非顺序访问测试

for (int i = 0; i < N; i++) {
test_data[i] = i;
test_index[i] = i;
Expand All @@ -75,9 +77,16 @@ int main() {
workload(test_data, test_index, N);
d6 = controller.readData();
result(d5, d6);
printf("%d %d %d %d %d %d %d %d\n", test_index[0], test_index[1],
test_index[2], test_index[3], test_index[4], test_index[5],
test_index[6], test_index[7]);

for (int i = 0; i < N; i++) {
test_data[i] = i;
test_index[i] = i;
}

d7 = controller.readData();
workload(test_data, test_index, N);
d8 = controller.readData();
result(d7, d8);

printf("end test\n");
return 0;
Expand Down