FilteredBFS.cpp

Go to the documentation of this file.

/****************************************************************/
/* Parallel Combinatorial BLAS Library (for Graph Computations) */
/* version 1.6 -------------------------------------------------*/
/* date: 6/15/2017 ---------------------------------------------*/
/* authors: Ariful Azad, Aydin Buluc  --------------------------*/
/****************************************************************/
/*
 Copyright (c) 2010-2017, The Regents of the University of California
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
 in the Software without restriction, including without limitation the rights
 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 copies of the Software, and to permit persons to whom the Software is
 furnished to do so, subject to the following conditions:
 
 The above copyright notice and this permission notice shall be included in
 all copies or substantial portions of the Software.
 
 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
 */

#define DETERMINISTIC
#include "CombBLAS/CombBLAS.h"
#include <mpi.h>
#include <sys/time.h> 
#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#ifdef THREADED
    #ifndef _OPENMP
    #define _OPENMP
    #endif
    #include <omp.h>
#endif

#ifdef USE_PAPI
    #include <papi.h>
    #include "papi_combblas_global.h"
#endif


/* Global variables for timing */

double cblas_alltoalltime;
double cblas_allgathertime;
int cblas_splits;

/* End global variables */


#include "TwitterEdge.h"

#define MAX_ITERS 20000
#define EDGEFACTOR 16
#define ITERS 16 
#define CC_LIMIT 100
#define PERCENTS 4  // testing with 4 different percentiles
#define MINRUNS 4
//#define ONLYTIME // don't calculate TEPS

using namespace std;
using namespace combblas;


template <typename PARMAT>
void Symmetricize(PARMAT & A)
{
    // boolean addition is practically a "logical or"
    // therefore this doesn't destruct any links
    PARMAT AT = A;
    AT.Transpose();
    A += AT;
}


#ifdef DETERMINISTIC
MTRand GlobalMT(1);
#else
MTRand GlobalMT;    // generate random numbers with Mersenne Twister 
#endif


struct Twitter_obj_randomizer : public std::unary_function<TwitterEdge, TwitterEdge>
{
  const TwitterEdge operator()(const TwitterEdge & x) const
  {
    short mycount = 1;
    bool myfollow = 0;
    time_t mylatest = static_cast<int64_t>(GlobalMT.rand() * 10000);    // random.randrange(0,10000)

    return TwitterEdge(mycount, myfollow, mylatest);
  }
};

struct Twitter_materialize: public std::binary_function<TwitterEdge, time_t, bool>
{
    bool operator()(const TwitterEdge & x, time_t sincedate) const
    {
        if(x.isRetwitter() && x.LastTweetBy(sincedate)) 
            return false;   // false if the edge is going to be kept
        else
            return true;    // true if the edge is to be pruned
    }
};

#ifdef USE_PAPI
void CheckPAPI(int errorcode, char [] errorstring)
{
    if (errorcode != PAPI_OK) 
    {
        PAPI_perror(errorcode, errorstring, PAPI_MAX_STR_LEN);
        fprintf(stderr, "PAPI error (%d): %s\n", errorcode, errorstring);
    }
}
#endif



int main(int argc, char* argv[])
{
    int nprocs, myrank; 
#ifdef _OPENMP
    int cblas_splits = omp_get_max_threads();
        int provided, flag, claimed;
        MPI_Init_thread(&argc, &argv, MPI_THREAD_FUNNELED, &provided );
        MPI_Is_thread_main( &flag );
        if (!flag)
            SpParHelper::Print("This thread called init_thread but Is_thread_main gave false\n");
        MPI_Query_thread( &claimed );
        if (claimed != provided)
            SpParHelper::Print("Query thread gave different thread level than requested\n");
#else
    MPI_Init(&argc, &argv);
    int cblas_splits = 1;   
#endif

    MPI_Comm_size(MPI_COMM_WORLD,&nprocs);
    MPI_Comm_rank(MPI_COMM_WORLD,&myrank);
    int MAXTRIALS;
    int retval;

#ifdef USE_PAPI
    /* Initialize the PAPI library */
    retval = PAPI_library_init(PAPI_VER_CURRENT);
    if (retval != PAPI_VER_CURRENT && retval > 0) 
    {
        fprintf(stderr,"PAPI library version mismatch!\en");
        exit(1); 
    }