SpAsgnTest.cpp

Go to the documentation of this file.

/****************************************************************/
/* Parallel Combinatorial BLAS Library (for Graph Computations) */
/* version 1.5 -------------------------------------------------*/
/* date: 10/09/2015 ---------------------------------------------*/
/* authors: Ariful Azad, Aydin Buluc, Adam Lugowski ------------*/
/****************************************************************/
/*
 Copyright (c) 2010-2015, 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.
 */
 
#include <mpi.h>
#include <sys/time.h> 
#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
#include <sstream>
#include "CombBLAS/CombBLAS.h"
 
using namespace std;
using namespace combblas;
 
template <typename IT, typename NT>
pair< FullyDistVec<IT,IT>, FullyDistVec<IT,NT> > TopK(FullyDistSpVec<IT,NT> & v, IT k)
{
    // FullyDistVec::FullyDistVec(IT glen, NT initval) 
    FullyDistVec<IT,IT> sel(v.getcommgrid(), k, 0);
    
    //void FullyDistVec::iota(IT globalsize, NT first)
    sel.iota(k, v.TotalLength() - k);
 
    FullyDistSpVec<IT,NT> sorted(v);
    FullyDistSpVec<IT,IT> perm = sorted.sort(); 
 
    // FullyDistVec FullyDistSpVec::operator(FullyDistVec & v)
    FullyDistVec<IT,IT> topkind = perm(sel);   
    FullyDistVec<IT,NT> topkele = v(topkind);   
    return make_pair(topkind, topkele);
} 
 
 
int main(int argc, char* argv[])
{
    int nprocs, myrank;
    MPI_Init(&argc, &argv);
    MPI_Comm_size(MPI_COMM_WORLD,&nprocs);
    MPI_Comm_rank(MPI_COMM_WORLD,&myrank);
 
    if(argc < 8)
    {
        if(myrank == 0)
        {
            cout << "Usage: ./SpAsgnTest <BASEADDRESS> <Matrix> <PrunedMatrix> <RHSMatrix> <AssignedMatrix> <VectorRowIndices> <VectorColIndices>" << endl;
            cout << "Example: ./SpAsgnTest ../mfiles A_100x100.txt A_with20x30hole.txt dense_20x30matrix.txt A_wdenseblocks.txt 20outta100.txt 30outta100.txt" << endl;
            cout << "Input files should be under <BASEADDRESS> in tuples format" << endl;
        }
        MPI_Finalize(); 
        return -1;
    }               
    {
        string directory(argv[1]);      
        string normalname(argv[2]);
        string prunedname(argv[3]);
        string rhsmatname(argv[4]);
        string assignname(argv[5]);
        string vec1name(argv[6]);
        string vec2name(argv[7]);
        normalname = directory+"/"+normalname;
        prunedname = directory+"/"+prunedname;
        rhsmatname = directory+"/"+rhsmatname;
        assignname = directory+"/"+assignname;
        vec1name = directory+"/"+vec1name;
        vec2name = directory+"/"+vec2name;
 
        ifstream inputvec1(vec1name.c_str());
        ifstream inputvec2(vec2name.c_str());
 
        if(myrank == 0)
        {   
            if(inputvec1.fail() || inputvec2.fail())
            {
                cout << "One of the input vector files do not exist, aborting" << endl;
                MPI_Abort(MPI_COMM_WORLD, NOFILE);
                return -1;
            }
        }
        MPI_Barrier(MPI_COMM_WORLD);
        typedef SpParMat <int, double , SpDCCols<int,double> > PARDBMAT;
        shared_ptr<CommGrid> fullWorld;
        fullWorld.reset( new CommGrid(MPI_COMM_WORLD, 0, 0) );
 
            PARDBMAT A(fullWorld);
            PARDBMAT Apr(fullWorld);
            PARDBMAT B(fullWorld);
            PARDBMAT C(fullWorld);
            FullyDistVec<int,int> vec1(fullWorld);
            FullyDistVec<int,int> vec2(fullWorld);
 
        A.ReadDistribute(normalname, 0);    
        Apr.ReadDistribute(prunedname, 0);  
        B.ReadDistribute(rhsmatname, 0);    
        C.ReadDistribute(assignname, 0);    
        vec1.ReadDistribute(inputvec1, 0);
        vec2.ReadDistribute(inputvec2, 0);
 
        vec1.Apply(bind2nd(minus<int>(), 1));   // For 0-based indexing
        vec2.Apply(bind2nd(minus<int>(), 1));   
 
        PARDBMAT Atemp = A;
        Atemp.Prune(vec1, vec2);
            
        // We should get the original A back.
        if( Atemp  == Apr)
        {
            SpParHelper::Print("Pruning is working\n");
        }
        else
        {
            SpParHelper::Print("Error in pruning, go fix it\n");
        }
        
        A.SpAsgn(vec1, vec2, B);
        if (A == C)
        {
            SpParHelper::Print("SpAsgn working correctly\n");   
        }
        else
        {
            SpParHelper::Print("ERROR in SpAsgn, go fix it!\n");    
            A.SaveGathered("Erroneous_SpAsgnd.txt");
        }
 
            FullyDistVec<int,int> crow(fullWorld);
            FullyDistVec<int,int> ccol(fullWorld);
        FullyDistVec<int,double> cval(fullWorld);
        A.Find(crow, ccol, cval);
        FullyDistSpVec<int, double> sval = cval;    
        // sval.DebugPrint();
 
        pair< FullyDistVec<int,int> , FullyDistVec<int,double> > ptopk; 
        ptopk = TopK(sval, 3);
        //ptopk.first.DebugPrint();
        //ptopk.second.DebugPrint();
 
        
        inputvec1.clear();
        inputvec1.close();
        inputvec2.clear();
        inputvec2.close();
    }
    MPI_Finalize();
    return 0;
}