You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
351 lines
16 KiB
C++
351 lines
16 KiB
C++
#include "MatchBoxPC.h"
|
|
|
|
//#define privateQueues
|
|
|
|
void processMatchedVertices(
|
|
MilanLongInt NLVer,
|
|
vector<MilanLongInt> &UChunkBeingProcessed,
|
|
staticQueue &U,
|
|
staticQueue &privateU,
|
|
MilanLongInt StartIndex,
|
|
MilanLongInt EndIndex,
|
|
MilanLongInt *myCardPtr,
|
|
MilanLongInt *msgIndPtr,
|
|
MilanLongInt *NumMessagesBundledPtr,
|
|
MilanLongInt *SPtr,
|
|
MilanLongInt *verLocPtr,
|
|
MilanLongInt *verLocInd,
|
|
MilanLongInt *verDistance,
|
|
MilanLongInt *PCounter,
|
|
vector<MilanLongInt> &Counter,
|
|
MilanInt myRank,
|
|
MilanInt numProcs,
|
|
MilanLongInt *candidateMate,
|
|
vector<MilanLongInt> &GMate,
|
|
MilanLongInt *Mate,
|
|
map<MilanLongInt, MilanLongInt> &Ghost2LocalMap,
|
|
MilanReal *edgeLocWeight,
|
|
vector<MilanLongInt> &QLocalVtx,
|
|
vector<MilanLongInt> &QGhostVtx,
|
|
vector<MilanLongInt> &QMsgType,
|
|
vector<MilanInt> &QOwner,
|
|
staticQueue &privateQLocalVtx,
|
|
staticQueue &privateQGhostVtx,
|
|
staticQueue &privateQMsgType,
|
|
staticQueue &privateQOwner)
|
|
{
|
|
|
|
MilanLongInt adj1, adj2, adj11, adj12, k, k1, v = -1, w = -1, ghostOwner;
|
|
MilanLongInt myCard = *myCardPtr, msgInd = *msgIndPtr, NumMessagesBundled = *NumMessagesBundledPtr, S = *SPtr, privateMyCard = 0;
|
|
|
|
// TODO check if private queues arrive empty
|
|
#pragma omp parallel private(k, w, v, k1, adj1, adj2, adj11, adj12, ghostOwner) firstprivate(privateMyCard, privateU, StartIndex, EndIndex, privateQLocalVtx, privateQGhostVtx, privateQMsgType, privateQOwner) default(shared) num_threads(4)
|
|
{
|
|
|
|
#ifdef PRINT_DEBUG_INFO_
|
|
cout << "\n(" << myRank << "=========================************===============================" << endl;
|
|
fflush(stdout);
|
|
fflush(stdout);
|
|
#endif
|
|
|
|
#ifdef COUNT_LOCAL_VERTEX
|
|
MilanLongInt localVertices = 0;
|
|
#endif
|
|
|
|
// TODO what would be the optimal UCHUNK
|
|
// TODO refactor
|
|
vector<MilanLongInt> UChunkBeingProcessed;
|
|
UChunkBeingProcessed.reserve(UCHUNK);
|
|
|
|
while (!U.empty())
|
|
{
|
|
|
|
extractUChunk(UChunkBeingProcessed, U, privateU);
|
|
|
|
for (MilanLongInt u : UChunkBeingProcessed)
|
|
{
|
|
#ifdef PRINT_DEBUG_INFO_
|
|
cout << "\n(" << myRank << ")u: " << u;
|
|
fflush(stdout);
|
|
#endif
|
|
if ((u >= StartIndex) && (u <= EndIndex))
|
|
{ // Process Only the Local Vertices
|
|
|
|
#ifdef COUNT_LOCAL_VERTEX
|
|
localVertices++;
|
|
#endif
|
|
|
|
// Get the Adjacency list for u
|
|
adj1 = verLocPtr[u - StartIndex]; // Pointer
|
|
adj2 = verLocPtr[u - StartIndex + 1];
|
|
for (k = adj1; k < adj2; k++)
|
|
{
|
|
v = verLocInd[k];
|
|
|
|
if ((v >= StartIndex) && (v <= EndIndex))
|
|
{ // If Local Vertex:
|
|
#pragma omp critical(innerProcessMatched)
|
|
{
|
|
|
|
#ifdef PRINT_DEBUG_INFO_
|
|
cout << "\n(" << myRank << ")v: " << v << " c(v)= " << candidateMate[v - StartIndex] << " Mate[v]: " << Mate[v];
|
|
fflush(stdout);
|
|
#endif
|
|
|
|
// If the current vertex is pointing to a matched vertex and is not matched
|
|
// FIXME is there a way to make candidateMate private?
|
|
// for the moment it could generate an error.
|
|
if (not isAlreadyMatched(v, StartIndex, EndIndex, GMate, Mate, Ghost2LocalMap) and
|
|
candidateMate[v - StartIndex] == u)
|
|
{
|
|
|
|
// Start: PARALLEL_PROCESS_EXPOSED_VERTEX_B(v)
|
|
// Start: PARALLEL_COMPUTE_CANDIDATE_MATE_B(v)
|
|
w = computeCandidateMate(verLocPtr[v - StartIndex],
|
|
verLocPtr[v - StartIndex + 1],
|
|
edgeLocWeight, 0,
|
|
verLocInd,
|
|
StartIndex,
|
|
EndIndex,
|
|
GMate,
|
|
Mate,
|
|
Ghost2LocalMap);
|
|
|
|
candidateMate[v - StartIndex] = w;
|
|
|
|
// End: PARALLEL_COMPUTE_CANDIDATE_MATE_B(v)
|
|
#ifdef PRINT_DEBUG_INFO_
|
|
cout << "\n(" << myRank << ")" << v << " Points to: " << w;
|
|
fflush(stdout);
|
|
#endif
|
|
// If found a dominating edge:
|
|
if (w >= 0)
|
|
{
|
|
|
|
// TODO is it possible to lock without a critical region?
|
|
// TODO there must be a more elegant and efficient way to do this
|
|
/*
|
|
while(true) {
|
|
if (omp_test_lock(&MateLock[v - StartIndex])) {
|
|
if (omp_test_lock(&MateLock[w - StartIndex])) break;
|
|
else omp_unset_lock(&MateLock[v - StartIndex]);
|
|
}
|
|
}
|
|
*/
|
|
|
|
if ((w < StartIndex) || (w > EndIndex))
|
|
{ // A ghost
|
|
#ifdef PRINT_DEBUG_INFO_
|
|
cout << "\n(" << myRank << ")Sending a request message:";
|
|
cout << "\n(" << myRank << ")Ghost is " << w << " Owner is: " << findOwnerOfGhost(w, verDistance, myRank, numProcs);
|
|
#endif
|
|
|
|
ghostOwner = findOwnerOfGhost(w, verDistance, myRank, numProcs);
|
|
assert(ghostOwner != -1);
|
|
assert(ghostOwner != myRank);
|
|
|
|
#ifdef privateQueues
|
|
privateQLocalVtx.push_back(v);
|
|
privateQGhostVtx.push_back(w);
|
|
privateQMsgType.push_back(REQUEST);
|
|
privateQOwner.push_back(ghostOwner);
|
|
#endif
|
|
#ifndef privateQueues
|
|
QLocalVtx.push_back(v);
|
|
QGhostVtx.push_back(w);
|
|
QMsgType.push_back(REQUEST);
|
|
QOwner.push_back(ghostOwner);
|
|
#endif
|
|
PCounter[ghostOwner]++;
|
|
NumMessagesBundled++;
|
|
msgInd++;
|
|
if (candidateMate[NLVer + Ghost2LocalMap[w]] == v)
|
|
{
|
|
Mate[v - StartIndex] = w; // v is a local vertex
|
|
GMate[Ghost2LocalMap[w]] = v; // w is a ghost vertex
|
|
// Q.push_back(u);
|
|
privateU.push_back(v);
|
|
privateU.push_back(w);
|
|
privateMyCard++;
|
|
#ifdef PRINT_DEBUG_INFO_
|
|
cout << "\n(" << myRank << ")MATCH: (" << v << "," << w << ") ";
|
|
fflush(stdout);
|
|
#endif
|
|
|
|
// TODO refactor this
|
|
// Decrement the counter:
|
|
PROCESS_CROSS_EDGE(Counter, Ghost2LocalMap[w], &S);
|
|
|
|
} // End of if CandidateMate[w] = v
|
|
} // End of if a Ghost Vertex
|
|
else
|
|
{ // w is a local vertex
|
|
if (candidateMate[w - StartIndex] == v)
|
|
{
|
|
Mate[v - StartIndex] = w; // v is a local vertex
|
|
Mate[w - StartIndex] = v; // w is a local vertex
|
|
// Q.push_back(u);
|
|
privateU.push_back(v);
|
|
privateU.push_back(w);
|
|
privateMyCard++;
|
|
#ifdef PRINT_DEBUG_INFO_
|
|
cout << "\n(" << myRank << ")MATCH: (" << v << "," << w << ") ";
|
|
fflush(stdout);
|
|
#endif
|
|
} // End of if(CandidateMate(w) = v
|
|
} // End of Else
|
|
|
|
// omp_unset_lock(&MateLock[v - StartIndex]);
|
|
// omp_unset_lock(&MateLock[w - StartIndex]);
|
|
|
|
} // End of if(w >=0)
|
|
else
|
|
{
|
|
adj11 = verLocPtr[v - StartIndex];
|
|
adj12 = verLocPtr[v - StartIndex + 1];
|
|
for (k1 = adj11; k1 < adj12; k1++)
|
|
{
|
|
w = verLocInd[k1];
|
|
if ((w < StartIndex) || (w > EndIndex))
|
|
{ // A ghost
|
|
|
|
#ifdef PRINT_DEBUG_INFO_
|
|
cout << "\n(" << myRank << ")Sending a failure message: ";
|
|
cout << "\n(" << myRank << ")Ghost is " << w << " Owner is: " << findOwnerOfGhost(w, verDistance, myRank, numProcs);
|
|
fflush(stdout);
|
|
#endif
|
|
|
|
// ghostOwner = inputSubGraph.findOwner(w);
|
|
ghostOwner = findOwnerOfGhost(w, verDistance, myRank, numProcs);
|
|
assert(ghostOwner != -1);
|
|
assert(ghostOwner != myRank);
|
|
|
|
#ifdef privateQueues
|
|
privateQLocalVtx.push_back(v);
|
|
privateQGhostVtx.push_back(w);
|
|
privateQMsgType.push_back(FAILURE);
|
|
privateQOwner.push_back(ghostOwner);
|
|
#endif
|
|
#ifndef privateQueues
|
|
QLocalVtx.push_back(v);
|
|
QGhostVtx.push_back(w);
|
|
QMsgType.push_back(FAILURE);
|
|
QOwner.push_back(ghostOwner);
|
|
#endif
|
|
|
|
PCounter[ghostOwner]++;
|
|
NumMessagesBundled++;
|
|
msgInd++;
|
|
} // End of if(GHOST)
|
|
} // End of for loop
|
|
} // End of Else: w == -1
|
|
// End: PARALLEL_PROCESS_EXPOSED_VERTEX_B(v)
|
|
|
|
} // End of If (candidateMate[v-StartIndex] == u
|
|
|
|
} // End of critical region if
|
|
|
|
} // End of if ( (v >= StartIndex) && (v <= EndIndex) ) //If Local Vertex:
|
|
else
|
|
{ // Neighbor is a ghost vertex
|
|
|
|
#pragma omp critical(innerProcessMatched)
|
|
{
|
|
|
|
// while(!omp_test_lock(&MateLock[u - StartIndex]));
|
|
|
|
if (candidateMate[NLVer + Ghost2LocalMap[v]] == u)
|
|
candidateMate[NLVer + Ghost2LocalMap[v]] = -1;
|
|
if (v != Mate[u - StartIndex])
|
|
{ // u is local
|
|
// Build the Message Packet:
|
|
// Message[0] = u; //LOCAL
|
|
// Message[1] = v; //GHOST
|
|
// Message[2] = SUCCESS; //TYPE
|
|
// Send a Request (Asynchronous)
|
|
|
|
#ifdef PRINT_DEBUG_INFO_
|
|
cout << "\n(" << myRank << ")Sending a success message: ";
|
|
cout << "\n(" << myRank << ")Ghost is " << v << " Owner is: " << findOwnerOfGhost(v, verDistance, myRank, numProcs) << "\n";
|
|
fflush(stdout);
|
|
#endif
|
|
|
|
ghostOwner = findOwnerOfGhost(v, verDistance, myRank, numProcs);
|
|
assert(ghostOwner != -1);
|
|
assert(ghostOwner != myRank);
|
|
|
|
#ifdef privateQueues
|
|
privateQLocalVtx.push_back(u);
|
|
privateQGhostVtx.push_back(v);
|
|
privateQMsgType.push_back(SUCCESS);
|
|
privateQOwner.push_back(ghostOwner);
|
|
#endif
|
|
#ifndef privateQueues
|
|
QLocalVtx.push_back(u);
|
|
QGhostVtx.push_back(v);
|
|
QMsgType.push_back(SUCCESS);
|
|
QOwner.push_back(ghostOwner);
|
|
#endif
|
|
|
|
PCounter[ghostOwner]++;
|
|
NumMessagesBundled++;
|
|
msgInd++;
|
|
} // End of If( v != Mate[u] )
|
|
|
|
// omp_unset_lock(&MateLock[u - StartIndex]);
|
|
|
|
} // End of critical region
|
|
} // End of Else //A Ghost Vertex
|
|
|
|
} // End of For Loop adj(u)
|
|
|
|
} // End of if ( (u >= StartIndex) && (u <= EndIndex) ) //Process Only If a Local Vertex
|
|
|
|
// Ask for the critical section only when a certain amount
|
|
// of data have been accumulated in the private queue
|
|
if (privateU.size() < UCHUNK && !U.empty())
|
|
continue;
|
|
|
|
#ifdef privateQueues
|
|
#pragma omp critical(U)
|
|
{
|
|
while (!privateU.empty())
|
|
U.push_back(privateU.pop_back());
|
|
}
|
|
#endif
|
|
#ifndef privateQueues
|
|
queuesTransfer(U, privateU, QLocalVtx,
|
|
QGhostVtx,
|
|
QMsgType, QOwner, privateQLocalVtx,
|
|
privateQGhostVtx,
|
|
privateQMsgType,
|
|
privateQOwner);
|
|
#endif
|
|
}
|
|
} // End of while ( /*!Q.empty()*/ !U.empty() )
|
|
|
|
queuesTransfer(U, privateU, QLocalVtx,
|
|
QGhostVtx,
|
|
QMsgType, QOwner, privateQLocalVtx,
|
|
privateQGhostVtx,
|
|
privateQMsgType,
|
|
privateQOwner);
|
|
|
|
// TODO it is possible that this is not working as expected
|
|
// further investigation needed.
|
|
#pragma omp atomic
|
|
myCard += privateMyCard;
|
|
|
|
#ifdef COUNT_LOCAL_VERTEX
|
|
printf("Count local vertexes: %ld for thread %d of processor %d\n",
|
|
localVertices,
|
|
omp_get_thread_num(),
|
|
myRank);
|
|
|
|
#endif
|
|
}
|
|
*myCardPtr = myCard;
|
|
*msgIndPtr = msgInd;
|
|
*NumMessagesBundledPtr = NumMessagesBundled;
|
|
*SPtr = S;
|
|
} |