[
https://issues.apache.org/jira/browse/IGNITE-1295?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Alexandre Boudnik updated IGNITE-1295:
--------------------------------------
Description:
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/download/java/ 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.
was:
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.
> 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/download/java/ 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)
