[go: up one dir, main page]

Menu

[5a71d8]: / utils / createdisks.cpp  Maximize  Restore  History

Download this file

235 lines (186 with data), 5.1 kB

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
/***************************************************************************
* createdisks.cpp
*
* Fri May 2 11:40:30 2003
* Copyright 2003 Roman Dementiev
* dementiev@mpi-sb.mpg.de
****************************************************************************/
#include "../io/io.h"
#include "stdio.h"
#include <vector>
#include <unistd.h>
#include "../common/aligned_alloc.h"
using namespace stxxl;
#ifdef BLOCK_ALIGN
#undef BLOCK_ALIGN
#endif
#define BLOCK_ALIGN 4096
#define NOREAD
//#define DO_ONLY_READ
#define POLL_DELAY 1000
#define RAW_ACCESS
//#define WATCH_TIMES
#ifdef WATCH_TIMES
void watch_times(request_ptr reqs[],unsigned n,double * out)
{
bool * finished = new bool[n];
unsigned count = 0;
unsigned i=0;
for(i=0;i<n;i++)
finished[i] = false;
while(count != n)
{
usleep(POLL_DELAY);
i=0;
for(i=0;i<n;i++)
{
if(! finished[i])
if(reqs[i]->poll())
{
finished[i] = true;
out[i] = stxxl_timestamp();
count++;
}
}
}
delete [] finished;
}
void out_stat(double start,double end, double * times, unsigned n, const std::vector<std::string> & names)
{
for(unsigned i=0;i<n;i++)
{
std::cout << i <<" " <<names[i] << " took "<<
100.*(times[i]-start)/(end-start)<< " %"<<std::endl;
}
}
#endif
int main(int argc, char * argv[])
{
unsigned ndisks = 8;
unsigned buffer_size = 1024*1024*64;
unsigned buffer_size_int = buffer_size / sizeof(int);
unsigned i=0,j=0;
if(argc < 3)
{
STXXL_MSG("Usage: "<<argv[0]<<" filesize_in_MB filename1 [filename2 [filename3 ...]]");
return 0;
}
#define MB (1024*1024)
#define GB (1024*1024*1024)
off_t offset = 0;
std::vector<std::string> disks_arr;
for(i=1;i<unsigned(argc - 1) ;i++)
{
unlink(argv[i+1]);
std::cout << "Add disk: " << argv[i+1] << std::endl;
disks_arr.push_back(argv[i+1]);
}
ndisks = argc - 2;
unsigned chunks = 32;
request_ptr * reqs = new request_ptr [ndisks*chunks];
file **disks = new file *[ndisks];
int * buffer = (int *)aligned_alloc<BLOCK_ALIGN>(buffer_size * ndisks);
#ifdef WATCH_TIMES
double * r_finish_times = new double[ndisks];
double * w_finish_times = new double[ndisks];
#endif
int count = (off_t(atoi(argv[1]))*MB)/buffer_size + 1;
for(i=0;i<ndisks*buffer_size_int;i++)
buffer[i] = i;
for(i=0;i<ndisks;i++)
{
#ifdef RAW_ACCESS
disks[i] = new syscall_file(disks_arr[i],
file::CREAT | file::RDWR | file::DIRECT ,i);
#else
disks[i] = new syscall_file(disks_arr[i],
file::CREAT | file::RDWR ,i);
#endif
}
while(count --)
{
std::cout << "Disk offset "<< offset/MB <<" MB ";
double begin = stxxl_timestamp(),end;
#ifndef DO_ONLY_READ
for(i=0;i<ndisks;i++)
{
for(j=0;j<chunks;j++)
reqs[i*chunks + j] =
disks[i]->awrite( buffer + buffer_size_int*i + buffer_size_int*j/chunks,
offset + buffer_size*j/chunks,
buffer_size/chunks,
stxxl::default_completion_handler() );
}
#ifdef WATCH_TIMES
watch_times(reqs,ndisks,w_finish_times);
#else
wait_all( reqs, ndisks*chunks );
#endif
end = stxxl_timestamp();
/*
std::cout << "WRITE\nDisks: " << ndisks
<<" \nElapsed time: "<< end-begin
<< " \nThroughput: "<< int(1e-6*(buffer_size*ndisks)/(end-begin))
<< " Mb/s \nPer one disk:"
<< int(1e-6*(buffer_size)/(end-begin)) << " Mb/s"
<< std::endl;
*/
#ifdef WATCH_TIMES
out_stat(begin,end,w_finish_times,ndisks,disks_arr);
#endif
std::cout << int(1e-6*(buffer_size)/(end-begin)) << " MB/s,";
#endif
#ifndef NOREAD
begin = stxxl_timestamp();
for(i=0;i<ndisks;i++)
{
for(j=0;j<chunks;j++)
reqs[i*chunks + j] = disks[i]->aread( buffer + buffer_size_int*i + buffer_size_int*j/chunks,
offset + buffer_size*j/chunks,
buffer_size/chunks,
stxxl::default_completion_handler() );
}
#ifdef WATCH_TIMES
watch_times(reqs,ndisks,r_finish_times);
#else
wait_all( reqs, ndisks*chunks );
#endif
end = stxxl_timestamp();
/*
std::cout << "READ\nDisks: " << ndisks
<<" \nElapsed time: "<< end-begin
<< " \nThroughput: "<< int(1e-6*(buffer_size*ndisks)/(end-begin))
<< " Mb/s \nPer one disk:"
<< int(1e-6*(buffer_size)/(end-begin)) << " Mb/s"
<< std::endl;
*/
std::cout << int(1e-6*(buffer_size)/(end-begin)) << " MB/s"<<std::endl;
#else
std::cout << std::endl;
#endif
#ifdef WATCH_TIMES
out_stat(begin,end,r_finish_times,ndisks,disks_arr);
#endif
/*
std::cout << "Checking..." <<std::endl;
for(i=0;i<ndisks*buffer_size_int;i++)
{
if(buffer[i] != i)
{
int ibuf = i/buffer_size_int;
int pos = i%buffer_size_int;
i = (ibuf+1)*buffer_size_int; // jump to next
std::cout << "Error on disk "<<ibuf<< " position"<< pos * sizeof(int) << std::endl;
}
} */
offset+= /* 4*off_t(GB); */ buffer_size;
}
delete [] reqs;
delete [] disks;
aligned_dealloc<BLOCK_ALIGN>(buffer);
#ifdef WATCH_TIMES
delete [] r_finish_times;
delete [] w_finish_times;
#endif
return 0;
}