arif/maui
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

MAX_MNODE_PER_JOB stuffs

Browse Source 
git-svn-id: svn://opensvn.adaptivecomputing.com/maui/trunk@17 3f5042e3-fb1d-0410-be18-d6ca2573e517
This commit is contained in:
musson 2005-08-04 18:35:07 +00:00
parent b80dc7d11c
commit 1670d47759
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/moab/MSched.c
View File

@ -6186,7 +6186,7 @@ int MJobDistributeTasks(
for (nindex = 0;RQ->NodeList[nindex].N != NULL;nindex++)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
MaxTPN = MAX(MaxTPN,RQ->NodeList[nindex].TC);
@ -6200,7 +6200,7 @@ int MJobDistributeTasks(
for (nindex = 0;RQ->NodeList[nindex].N != NULL;nindex++)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
if (Overflow == 0)
@ -6229,7 +6229,7 @@ int MJobDistributeTasks(
for (nindex = 0;RQ->NodeList[nindex].N != NULL;nindex++)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
if (index == RQ->NodeCount)
@ -6299,7 +6299,7 @@ int MJobDistributeTasks(
for (nindex = sindex;RQ->NodeList[nindex].N != NULL;nindex++)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
if ((int)RQ->NodeList[nindex].TC > MaxTPN)
@ -6326,7 +6326,7 @@ int MJobDistributeTasks(
for (nindex = 0;nindex < AllocIndex;nindex++)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
if (RQ->BlockingFactor != 1)
@ -6366,7 +6366,7 @@ int MJobDistributeTasks(
for (nindex = AllocIndex - 1;nindex > 0;nindex--)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
if (tmpNodeList[nindex].TC != tmpNodeList[nindex - 1].TC)
@ -6387,7 +6387,7 @@ int MJobDistributeTasks(
for (nindex = AllocIndex - 1;nindex >= 0;nindex--)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
tmpNodeList[nindex].TC--;
@ -6424,7 +6424,7 @@ int MJobDistributeTasks(
for (nindex = 0;RQ->NodeList[nindex].N != NULL;nindex++)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
if (RQ->NodeList[nindex].TC >= TPN)
@ -6456,7 +6456,7 @@ int MJobDistributeTasks(
for (nindex = 0;RQ->NodeList[nindex].N != NULL;nindex++)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
tmpNodeList[index].N = RQ->NodeList[nindex].N;
@ -6651,7 +6651,7 @@ int MJobDistributeTasks(
for (nindex1 = 0;NodeList[nindex1].N != NULL;nindex1++)
{
if (nindex >= MMAX_NODE_PER_JOB)
if (nindex >= MAX_MNODE_PER_JOB)
break;
if (NodeList[nindex1].TC == 0)