Mentions légales du service
Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
ScalFMM
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Admin message
GitLab upgrade completed. Current version is 17.11.4.
Show more breadcrumbs
solverstack
ScalFMM
Commits
ce30d6cd
There was an error fetching the commit references. Please try again later.
Commit
ce30d6cd
authored
9 years ago
by
Martin Khannouz
Committed by
Berenger Bramas
8 years ago
Browse files
Options
Downloads
Patches
Plain Diff
Remove code to split handle.
parent
67e194b3
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
Src/GroupTree/Core/FGroupTaskStarpuMpiAlgorithm.hpp
+6
-54
6 additions, 54 deletions
Src/GroupTree/Core/FGroupTaskStarpuMpiAlgorithm.hpp
with
6 additions
and
54 deletions
Src/GroupTree/Core/FGroupTaskStarpuMpiAlgorithm.hpp
+
6
−
54
View file @
ce30d6cd
...
...
@@ -100,20 +100,14 @@ protected:
}
};
static
std
::
unordered_map
<
int
,
TagInfo
>
previousTag
;
//static std::unordered_map<int, std::set<int>> alreadySentTag;
const
TagInfo
currentInfo
=
{
inLevel
,
mindex
,
idxBloc
,
mode
,
idxBlockMpi
};
auto
found
=
previousTag
.
find
(
tag
);
if
(
found
!=
previousTag
.
end
()){
const
TagInfo
prev
=
found
->
second
;
assert
(
currentInfo
==
prev
);
//std::set<int>& setOfTag = alreadySentTag[tag];
//std::cerr << setOfTag.count(otherProc) << std::endl;
//assert(setOfTag.count(otherProc) == 0);
}
else
{
previousTag
[
tag
]
=
currentInfo
;
//alreadySentTag[tag] = std::set<int>();
//alreadySentTag[tag].insert(otherProc);
}
}
return
tag
;
...
...
@@ -1691,59 +1685,17 @@ protected:
{
size_t
size
=
starpu_data_get_size
(
handle
);
const
size_t
limitSize
=
LIMIT_SIZE_MPI
;
//if( size < limitSize)
{
starpu_mpi_isend_detached
(
handle
,
dest
,
getTag
(
level
,
startingIndex
,
idxBlock
,
mode
,
dest
),
comm
.
getComm
(),
0
/*callback*/
,
0
/*arg*/
);
return
;
}
const
int
countPart
=
static_cast
<
int
>
(
ceil
(
static_cast
<
float
>
(
size
)
/
static_cast
<
float
>
(
limitSize
)));
struct
starpu_data_filter
filter
=
{
.
filter_func
=
starpu_vector_filter_block
,
.
nchildren
=
countPart
};
starpu_data_handle_t
splitHandles
[
countPart
];
starpu_data_partition_plan
(
handle
,
&
filter
,
splitHandles
);
starpu_data_partition_submit
(
handle
,
countPart
,
splitHandles
);
for
(
int
i
=
0
;
i
<
countPart
;
++
i
)
{
starpu_mpi_isend_detached
(
splitHandles
[
i
],
dest
,
getTag
(
level
,
startingIndex
,
idxBlock
,
mode
,
dest
,
i
+
1
),
comm
.
getComm
(),
0
/*callback*/
,
0
/*arg*/
);
}
starpu_data_unpartition_submit
(
handle
,
countPart
,
splitHandles
,
-
1
);
starpu_data_partition_clean
(
handle
,
countPart
,
splitHandles
);
starpu_mpi_isend_detached
(
handle
,
dest
,
getTag
(
level
,
startingIndex
,
idxBlock
,
mode
,
dest
),
comm
.
getComm
(),
0
/*callback*/
,
0
/*arg*/
);
}
void
mpiPostIRecv
(
starpu_data_handle_t
handle
,
const
int
dest
,
const
int
level
,
const
MortonIndex
startingIndex
,
const
int
idxBlock
,
const
int
mode
)
{
size_t
size
=
starpu_data_get_size
(
handle
);
const
size_t
limitSize
=
LIMIT_SIZE_MPI
;
//if( size < limitSize)
{
starpu_mpi_irecv_detached
(
handle
,
dest
,
getTag
(
level
,
startingIndex
,
idxBlock
,
mode
,
dest
),
comm
.
getComm
(),
0
/*callback*/
,
0
/*arg*/
);
return
;
}
const
int
countPart
=
static_cast
<
int
>
(
ceil
(
static_cast
<
float
>
(
size
)
/
static_cast
<
float
>
(
limitSize
)));
struct
starpu_data_filter
filter
=
{
.
filter_func
=
starpu_vector_filter_block
,
.
nchildren
=
countPart
};
starpu_data_handle_t
splitHandles
[
countPart
];
starpu_data_partition_plan
(
handle
,
&
filter
,
splitHandles
);
starpu_data_partition_submit
(
handle
,
countPart
,
splitHandles
);
for
(
int
i
=
0
;
i
<
countPart
;
++
i
)
{
starpu_mpi_irecv_detached
(
splitHandles
[
i
],
dest
,
getTag
(
level
,
startingIndex
,
idxBlock
,
mode
,
dest
,
i
+
1
),
comm
.
getComm
(),
0
/*callback*/
,
0
/*arg*/
);
}
starpu_data_unpartition_submit
(
handle
,
countPart
,
splitHandles
,
-
1
);
starpu_data_partition_clean
(
handle
,
countPart
,
splitHandles
);
starpu_mpi_irecv_detached
(
handle
,
dest
,
getTag
(
level
,
startingIndex
,
idxBlock
,
mode
,
dest
),
comm
.
getComm
(),
0
/*callback*/
,
0
/*arg*/
);
}
/////////////////////////////////////////////////////////////////////////////////////
/// Bottom Pass
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment