[
https://issues.apache.org/jira/browse/IGNITE-1295?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14711932#comment-14711932
]
Alexandre Boudnik commented on IGNITE-1295:
-------------------------------------------
I will start with generic approach adopting MulticoreBSP for Java, it would be
very straight forward. Then, because my goal is to implement scalable
union-find, I'll consider more restricted approach.
> BSP implementation
> ------------------
>
> Key: IGNITE-1295
> URL: https://issues.apache.org/jira/browse/IGNITE-1295
> Project: Ignite
> Issue Type: New Feature
> Components: compute
> Reporter: Alexandre Boudnik
> Assignee: Alexandre Boudnik
> Original Estimate: 504h
> Remaining Estimate: 504h
>
> Bulk Synchronous Parallel (BSP) model was designed for distributed-memory
> systems. I found it extremely useful for distributed implementation of
> union-find (disjointed set).
> I want to start implementing functionality of MulticoreBSP for Java
> http://www.multicorebsp.com/documentation on ignite platform.
> A BSP algorithm relies on computation proceeds in a series of global
> super-steps, which consists of three components:
> - Concurrent computation: every participating processor may perform local
> computations, i.e., each process can only make use of values stored in the
> local fast memory of the processor. The computations occur asynchronously of
> all the others but may overlap with communication.
> - Communication: The processes exchange data between themselves to facilitate
> remote data storage capabilities.
> - Barrier synchronization: When a process reaches this point (the barrier),
> it waits until all other processes have reached the same barrier.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
