void main()
{
int i;
int a[] = {8,2,3,4,3,6,6,3,9};
int ilen = LENGTH(a);
printf("before sort:");
for (i=0; i<ilen; i++)
printf("%d ", a[i]);
printf("\n");
bucket_sort(a, ilen, 10); // 桶排序
printf("after sort:");
for (i=0; i<ilen; i++)
printf("%d ", a[i]);
printf("\n");
bucket_get_rank(8);
}
int main()
{
int i;
for (i = 0; i < NUM; ++i)
b[i] = NULL;
srandom(time(NULL));
for (i = 0; i < MAX; ++i) {
a[i] = random() % 100;
printf("%3d", a[i]);
}
printf("\n");
bucket_sort(a);
for (i = 0; i < NUM; ++i) {
Node *p = b[i];
while (p != NULL) {
printf("%3d", p->item);
p = p->next;
}
}
printf("\n");
return 0;
}
void test(void)
{
double A[NARRAY];
int nsuccess, ntests;
printf("Testing bucket sort: ");
nsuccess = ntests = 0;
for (int count = 0; count < NTESTS; count++) {
/* construct an array for testing */
for (int i = 0; i < NARRAY; i++)
A[i] = (rand()%100) / 100.0;
/* test */
bucket_sort(A, NARRAY);
ntests++;
/* verification */
if (verify_sorted(A, NARRAY))
nsuccess++;
}
printf("%d/%d, %.2f%%\n", nsuccess, ntests,
(double) nsuccess/ntests * 100);
}
bool is_straight_line_drawing(const Graph& g,
GridPositionMap drawing,
VertexIndexMap vm
)
{
typedef typename graph_traits<Graph>::vertex_descriptor vertex_t;
typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator_t;
typedef typename graph_traits<Graph>::edge_descriptor edge_t;
typedef typename graph_traits<Graph>::edge_iterator edge_iterator_t;
typedef typename graph_traits<Graph>::edges_size_type e_size_t;
typedef typename graph_traits<Graph>::vertices_size_type v_size_t;
typedef std::size_t x_coord_t;
typedef std::size_t y_coord_t;
typedef boost::tuple<edge_t, x_coord_t, y_coord_t> edge_event_t;
typedef typename std::vector< edge_event_t > edge_event_queue_t;
typedef tuple<y_coord_t, y_coord_t, x_coord_t, x_coord_t> active_map_key_t;
typedef edge_t active_map_value_t;
typedef std::map< active_map_key_t, active_map_value_t > active_map_t;
typedef typename active_map_t::iterator active_map_iterator_t;
edge_event_queue_t edge_event_queue;
active_map_t active_edges;
edge_iterator_t ei, ei_end;
for(tie(ei,ei_end) = edges(g); ei != ei_end; ++ei)
{
edge_t e(*ei);
vertex_t s(source(e,g));
vertex_t t(target(e,g));
edge_event_queue.push_back
(make_tuple(e,
static_cast<std::size_t>(drawing[s].x),
static_cast<std::size_t>(drawing[s].y)
)
);
edge_event_queue.push_back
(make_tuple(e,
static_cast<std::size_t>(drawing[t].x),
static_cast<std::size_t>(drawing[t].y)
)
);
}
// Order by edge_event_queue by first, then second coordinate
// (bucket_sort is a stable sort.)
bucket_sort(edge_event_queue.begin(), edge_event_queue.end(),
property_map_tuple_adaptor<edge_event_t, 2>()
);
bucket_sort(edge_event_queue.begin(), edge_event_queue.end(),
property_map_tuple_adaptor<edge_event_t, 1>()
);
typedef typename edge_event_queue_t::iterator event_queue_iterator_t;
event_queue_iterator_t itr_end = edge_event_queue.end();
for(event_queue_iterator_t itr = edge_event_queue.begin();
itr != itr_end; ++itr
)
{
edge_t e(get<0>(*itr));
vertex_t source_v(source(e,g));
vertex_t target_v(target(e,g));
if (drawing[source_v].y > drawing[target_v].y)
std::swap(source_v, target_v);
active_map_key_t key(get(drawing, source_v).y,
get(drawing, target_v).y,
get(drawing, source_v).x,
get(drawing, target_v).x
);
active_map_iterator_t a_itr = active_edges.find(key);
if (a_itr == active_edges.end())
{
active_edges[key] = e;
}
else
{
active_map_iterator_t before, after;
if (a_itr == active_edges.begin())
before = active_edges.end();
else
before = prior(a_itr);
after = boost::next(a_itr);
if (before != active_edges.end())
{
edge_t f = before->second;
vertex_t e_source(source(e,g));
vertex_t e_target(target(e,g));
vertex_t f_source(source(f,g));
vertex_t f_target(target(f,g));
if (intersects(drawing[e_source].x,
drawing[e_source].y,
drawing[e_target].x,
drawing[e_target].y,
drawing[f_source].x,
drawing[f_source].y,
drawing[f_target].x,
drawing[f_target].y
)
)
return false;
}
if (after != active_edges.end())
{
edge_t f = after->second;
vertex_t e_source(source(e,g));
vertex_t e_target(target(e,g));
vertex_t f_source(source(f,g));
vertex_t f_target(target(f,g));
if (intersects(drawing[e_source].x,
drawing[e_source].y,
drawing[e_target].x,
drawing[e_target].y,
drawing[f_source].x,
drawing[f_source].y,
drawing[f_target].x,
drawing[f_target].y
)
)
return false;
}
active_edges.erase(a_itr);
}
}
return true;
}
void bucket_sort(ForwardIterator begin,
ForwardIterator end
)
{
bucket_sort(begin, end, identity_property_map());
}
void bucket_sort(ForwardIterator begin,
ForwardIterator end,
ItemToRankMap rank)
{
bucket_sort(begin, end, rank, 0);
}
int main(int argc, char **argv)
{
int ret = 0;
MPI_Init(&argc, &argv);
if (argc < 4) {
fprintf(stderr, "Usage: bench <csv file> <input size> <input upper bound>\n");
ret = -1;
goto out;
}
const int size = safe_strtol(argv[2]);
if (size < 1) {
fprintf(stderr, "Input size must be greater than 0\n");
ret = -1;
goto out;
}
const int upper_bound = safe_strtol(argv[3]);
if (size < 1) {
fprintf(stderr, "Input upper bound must be greater than 0\n");
ret = -1;
goto out;
}
int processes;
MPI_Comm_size(MPI_COMM_WORLD, &processes);
int rank;
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
/* We need to generate the same array in each process. The master process
* determines a seed and broadcasts it to all others. */
int seed = time(NULL);
MPI_Bcast(&seed, 1, MPI_INT, MASTER, MPI_COMM_WORLD);
TYPE *a = random_array(size, upper_bound, seed);
DEBUG("%s. MPI_Comm_size %d, MPI_Comm_rank %d, seed %d\n",
algorithm_name, processes, rank, seed);
/* Everything is set up, start sorting and time how long it takes. */
MPI_Barrier(MPI_COMM_WORLD);
double start = MPI_Wtime();
TYPE *c = bucket_sort(a, size, upper_bound);
double end = MPI_Wtime();
double localElapsed = end - start;
double totalElapsed;
MPI_Reduce(&localElapsed, &totalElapsed, 1, MPI_DOUBLE, MPI_MAX, MASTER, MPI_COMM_WORLD);
free(a);
free(c);
/* Only the master process (rank 0) outputs information. */
if (rank == MASTER) {
printf("processes: %d, elements: %d; upper bound: %d; time: %f\n",
processes, size, upper_bound, totalElapsed);
/* Persist this run in our csv file. */
FILE *const csvFile = csv_open(argv[1]);
if (csvFile == NULL) {
return -1;
}
fprintf(csvFile, "%s,%d,%d,%f\n", algorithm_name, processes, size, totalElapsed);
csv_close(csvFile);
}
out:
MPI_Finalize();
return ret;
}
int main(const int argc, char ** argv)
{
shmem_init();
my_bucket_keys = (KEY_TYPE *)shmem_malloc(KEY_BUFFER_SIZE * sizeof(KEY_TYPE));
assert(my_bucket_keys);
// fprintf(stderr, "PE %d allocating %llu bytes at %p\n", shmem_my_pe(),
// KEY_BUFFER_SIZE * sizeof(KEY_TYPE), my_bucket_keys);
#ifdef EXTRA_STATS
_timer_t total_time;
if(shmem_my_pe() == 0) {
printf("\n-----\nmkdir timedrun fake\n\n");
timer_start(&total_time);
}
#endif
init_shmem_sync_array(pSync);
char * log_file = parse_params(argc, argv);
int err = bucket_sort();
log_times(log_file);
#ifdef EXTRA_STATS
if(shmem_my_pe() == 0) {
just_timer_stop(&total_time);
double tTime = ( total_time.stop.tv_sec - total_time.start.tv_sec ) + ( total_time.stop.tv_nsec - total_time.start.tv_nsec )/1E9;
avg_time *= 1000;
avg_time_all2all *= 1000;
printf("\n============================ MMTk Statistics Totals ============================\n");
if(NUM_ITERATIONS == 1) { //TODO: fix time calculation below for more number of iterations
printf("time.mu\tt.ATA_KEYS\tt.MAKE_INPUT\tt.COUNT_BUCKET_SIZES\tt.BUCKETIZE\tt.COMPUTE_OFFSETS\tt.LOCAL_SORT\tBARRIER_AT_START\tBARRIER_AT_EXCHANGE\tBARRIER_AT_END\tnWorkers\tnPEs\n");
double TIMES[TIMER_NTIMERS];
memset(TIMES, 0x00, sizeof(double) * TIMER_NTIMERS);
for(int i=0; i<NUM_PES; i++) {
for(int t = 0; t < TIMER_NTIMERS; ++t){
if(timers[t].all_times != NULL){
TIMES[t] += timers[t].all_times[i];
}
}
}
for(int t = 0; t < TIMER_NTIMERS; ++t){
printf("%.3f\t", (TIMES[t]/NUM_PES)*1000);
}
printf("1\t%d\n",NUM_PES);
printf("Total time: %.3f\n",(TIMES[0]/NUM_PES)*1000);
}
else {
printf("time.mu\ttimeAll2All\tnWorkers\tnPEs\n");
printf("%.3f\t%.3f\t1\t%d\n",avg_time,avg_time_all2all,NUM_PES);
printf("Total time: %.3f\n",avg_time);
}
printf("------------------------------ End MMTk Statistics -----------------------------\n");
printf("===== TEST PASSED in %.3f msec =====\n",(tTime*1000));
}
#endif
shmem_finalize();
return err;
}
