stasis-aries-wal/benchmarks/transitiveClosure.c

302 lines
7.1 KiB
C
Raw Normal View History

2005-03-24 11:10:44 +00:00
#include <lladd/transactional.h>
#include <lladd/multiplexer.h>
#include <lladd/graph.h>
#include "../src/lladd/logger/logMemory.h"
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
2005-03-25 16:33:36 +00:00
#include <sys/time.h>
#include <time.h>
2005-03-24 11:10:44 +00:00
#define NUM_NODES 1000000
2005-03-25 16:33:36 +00:00
#define DIRTY_BUF_SIZE 60000000
//#define OUTDGREE 3
2005-03-24 11:10:44 +00:00
#define NUM_THREADS 1
#define NUM_FIFOS 5
2005-03-25 16:33:36 +00:00
#define NUM_ITER 1
int hotSet(int j, int HotSetProb) {
int hotset_size = (NUM_NODES / 10);
int coldset_size = NUM_NODES - hotset_size;
int id;
int p = 1 + (int)(100.0 * random() / (RAND_MAX + 1.0));
if (p <= HotSetProb) {
// printf("a ");
id = (int)(((double)hotset_size) * random() /
(RAND_MAX + 1.0));
} else {
// printf("b ");
id = hotset_size + (int)(((double)coldset_size) *
random() / (RAND_MAX + 1.0));
}
id += j;
id -= (hotset_size / 2);
// printf("%d ", id);
if(id < 0) { id += NUM_NODES; }
id %= NUM_NODES;
return id;
}
lladdFifo_t * transClos_getFifoLocal(lladdFifoPool_t * pool, byte * multiplexKey, size_t multiplexKeySize) {
recordid * rid;
assert(multiplexKeySize == sizeof(rid->page));
long page = ((recordid*)multiplexKey)->page;
return pool->pool[page % pool->fifoCount];
}
2005-03-24 11:10:44 +00:00
/** This is a hack */
/*int countRecordsPerPage(int outDegree) {
Tinit();
int xid = Tbegin();
// Relies upon a bug in lladd that will always start allocation on a fresh page.
recordid rid = Talloc(xid, sizeof(int) * outDegree);
int oldPage = rid.page;
int count = 1;
while(oldPage == rid.page) {
Talloc(xid, sizeof(int) * outDegree);
count++;
}
Tdeinit(); // When LLADD is restarted, it will leak the last page we allocated a record on. This is the "hack".
return count;
}*/
int numOut = 0;
int numTset = 0;
int numShortcutted = 0;
int numSkipped = 0;
int numPushed = 0;
2005-03-25 16:33:36 +00:00
int useCRC = 0;
int OUTDEGREE = 0;
int transClos_outdegree = 0;
2005-03-24 11:10:44 +00:00
typedef struct {
lladdFifo_t * dirty;
lladdFifo_t * global;
lladdFifoPool_t * pool;
lladdMultiplexer_t * mux;
recordid rid;
int i;
} worker_arg;
int closed = 0;
pthread_mutex_t closed_mut = PTHREAD_MUTEX_INITIALIZER;
void * worker(void * arg_p) {
worker_arg * arg = (worker_arg*)arg_p;
2005-03-25 16:33:36 +00:00
// lladdFifo_t * dirtyFifo = arg->dirty;
2005-03-24 11:10:44 +00:00
lladdFifo_t * globalFifo = arg->global;
recordid rid = arg->rid;
int i = arg->i;
int xid = Tbegin();
lladdMultiplexer_flush(arg->mux);
2005-03-25 16:33:36 +00:00
int count = 0;
// while(Titerator_next(xid, dirtyFifo->iterator)) {
while(1) {
2005-03-24 11:10:44 +00:00
2005-03-25 16:33:36 +00:00
// lladdFifo_t ** localFifo_ptr;
lladdFifo_t * localFifo;
2005-03-24 11:10:44 +00:00
2005-03-25 16:33:36 +00:00
// int size = Titerator_value(xid, dirtyFifo->iterator, (byte**) &localFifo_ptr);
2005-03-24 11:10:44 +00:00
2005-03-25 16:33:36 +00:00
localFifo = arg->pool->pool[count % arg->pool->fifoCount]; //*localFifo_ptr;
count++;
// assert(size == sizeof(lladdFifo_t*));
2005-03-24 11:10:44 +00:00
2005-03-25 16:33:36 +00:00
multiTraverse(xid, rid, localFifo, globalFifo, arg->pool, i/*+NUM_ITER*/);
2005-03-24 11:10:44 +00:00
2005-03-25 16:33:36 +00:00
// Titerator_tupleDone(xid, dirtyFifo->iterator);
2005-03-24 11:10:44 +00:00
if(!numOut) { break ;}
lladdMultiplexer_flush(arg->mux);
}
pthread_mutex_lock(&closed_mut);
if(!closed) {
Tconsumer_close(xid, globalFifo->consumer);
closed = 1;
}
pthread_mutex_unlock(&closed_mut);
Tcommit(xid);
return NULL;
}
int main(int argc, char ** argv) {
Tinit();
int xid = Tbegin();
2005-03-25 16:33:36 +00:00
assert(argc == 8);
int naive = atoi(argv[1]);
useCRC = atoi(argv[2]);
int ring = atoi(argv[3]);
transClos_outdegree = OUTDEGREE = atoi(argv[4]);
int hot = atoi(argv[5]);
int seed = atoi(argv[6]);
2005-03-25 16:36:56 +00:00
int silent = atoi(argv[7]);
if(!silent) {
printf("naive=%d crc=%d ring=%d outdegree=%d hot=%d seed=%d\n", naive, useCRC, ring, OUTDEGREE, hot, seed);
assert(!hot || !ring);
}
2005-03-25 16:33:36 +00:00
if(seed == -1) {
struct timeval tv;
2005-03-25 16:36:56 +00:00
gettimeofday(&tv, NULL);
srandom(tv.tv_usec);
2005-03-25 16:33:36 +00:00
if(!silent) {
2005-03-25 16:36:56 +00:00
printf("Seed: %ld\n", tv.tv_usec);
2005-03-25 16:33:36 +00:00
}
} else {
srandom(seed);
}
2005-03-25 16:36:56 +00:00
2005-03-24 11:10:44 +00:00
// int lastPage = -1;
// int pageCount = 0;
// int max_fanout = 0;
/* for(i = 0; i < NUM_NODES; i++) {
recordid rid = Talloc(xid, sizeof(nodeHeader_t) + (sizeof(recordid) * max_fanout));
if(lastPage != rid.page && lastPage != -1) {
rids_per_page[lastPage] = pageCount;
lastPage = rid.page;
pageCount = 0;
}
pageCount ++;
}
*/
recordid rid = TarrayListAlloc(xid, NUM_NODES / 100, 2, sizeof(long) * (OUTDEGREE+1));
TarrayListExtend(xid, rid, NUM_NODES);
int * node = malloc(sizeof(int) * (OUTDEGREE+1)); // the last long in the node holds flags.
int i, j;
for(i = 0; i < NUM_NODES; i++) {
node[OUTDEGREE] = 0;
2005-03-25 16:33:36 +00:00
if(ring) {
node[0] = (i+1) % NUM_NODES;
for(j = 1; j < OUTDEGREE; j++) {
if(hot) {
node[j] = hotSet(j, hot);
} else {
node[j] = (int)( ((double)NUM_NODES) * (double)random()/((double)RAND_MAX+1.0));
}
}
2005-03-24 11:10:44 +00:00
// printf("%d ", node[j]);
2005-03-25 16:33:36 +00:00
} else {
for(j = 0; j < OUTDEGREE; j++) {
if(hot) {
node[j] = hotSet(j, hot);
} else {
node[j] = (int)( ((double)NUM_NODES) * (double)random()/((double)RAND_MAX+1.0));
}
}
2005-03-24 11:10:44 +00:00
}
rid.slot = i;
Tset(xid, rid, node);
}
2005-03-25 16:33:36 +00:00
Tcommit(xid);
if(!silent) {
printf("Nodes loaded.\n");
fflush(stdout);
system("date");
}
2005-03-24 11:10:44 +00:00
rid.slot = 0;
2005-03-25 16:33:36 +00:00
struct timeval start, stop;
gettimeofday(&start, NULL);
2005-03-24 11:10:44 +00:00
numTset = 0;
2005-03-25 16:33:36 +00:00
xid = Tbegin();
if(naive) {
for(i = 1; i <= NUM_ITER; i++) {
naiveTraverse(xid, rid, i);
2005-03-24 11:10:44 +00:00
2005-03-25 16:33:36 +00:00
}
if(!silent) {
system("date");
printf("TransClos returned Tset called %d times\n", numTset);
fflush(stdout);
}
numTset = 0;
numPushed = 0;
} else {
for(i = 1; i <= NUM_ITER; i++) {
// lladdFifo_t * dirtyFifo = logMemoryFifo(DIRTY_BUF_SIZE, 0);
lladdFifoPool_t * pool = lladdFifoPool_pointerPoolInit(NUM_FIFOS, DIRTY_BUF_SIZE,
useCRC ? lladdFifoPool_getFifoCRC32 : transClos_getFifoLocal
, NULL/*, dirtyFifo*/);
lladdFifo_t * globalFifo = logMemoryFifo(DIRTY_BUF_SIZE, /*NUM_FIFOS*/ 0);
lladdMultiplexer_t * mux = lladdMultiplexer_alloc(xid, globalFifo->iterator, &multiplexByRidPage, pool);
// lladdMultiplexer_start(mux, NULL);
rid.slot =0;
Tconsumer_push(xid, globalFifo->consumer, NULL, 0, (byte*)&rid, sizeof(recordid));
numOut = 1;
pthread_t * workers = malloc(sizeof(pthread_t) * NUM_THREADS);
int j;
worker_arg * arg = malloc(sizeof(worker_arg));
// arg->dirty = dirtyFifo;
arg->global = globalFifo;
arg->pool = pool;
arg->rid = rid;
arg->mux = mux;
arg->i = i;
for(j = 0; j < NUM_THREADS; j++) {
pthread_create(&workers[j], NULL, worker, arg);
}
for(j = 0; j < NUM_THREADS; j++) {
pthread_join(workers[j], NULL);
}
// lladdMultiplexer_join(mux);
closed = 0;
}
if(!silent) {
system("date");
printf("FastTransClos returned Tset called %d times, shortcutted %d, skipped %d pushed %d\n", numTset, numShortcutted, numSkipped, numPushed);
}
2005-03-24 11:10:44 +00:00
}
2005-03-25 16:33:36 +00:00
2005-03-24 11:10:44 +00:00
Tcommit(xid);
2005-03-25 16:33:36 +00:00
gettimeofday(&stop, NULL);
2005-03-24 11:10:44 +00:00
2005-03-25 16:33:36 +00:00
Tdeinit();
2005-03-24 11:10:44 +00:00
2005-03-25 16:33:36 +00:00
double elapsed = ((double)(stop.tv_sec - start.tv_sec)) + 1e-6 * ((double)(stop.tv_usec - start.tv_usec));
2005-03-24 11:10:44 +00:00
2005-03-25 16:33:36 +00:00
printf("%f\n", elapsed);
2005-03-24 11:10:44 +00:00
}