Read a recent article on
Processing by one of our developers about the
multi-core development and why you need this product.
What is Fork-Join?
Think of a fork
in the road where each path eventually comes back together —
an application into several parts for parallel processing and joins
the results at the end.
1: Fork-Join Structure
we have an array of one thousand numbers. We need to do a procedure
on each of these numbers and add the total.
(int i = 0; i < 1000; i++)
If the procedure
takes one second (wall-clock time) to complete, then it is going to
take one thousand seconds (over 16½ minutes) to complete this
- separate (fork)
the large array into ten arrays of one hundred elements
- processes each
array on a separate CPU, and
- join the
results when finished.
That would take
one hundred seconds (just over 1½ minutes), one tenth of the
original time. The more CPU's available, the faster the
This abstraction closely
resembles the standard scientific model of Divide-and-Conquer.
This is what
high performance computing is all about — simultaneously processing
humongous amounts of data on as many CPU’s as
available. Map/Reduce, sorting, and countless array processing applications all
can use Divide-and-Conquer to solve their problems.
And there's more. Lots, lots more, so keep
Would you like to segregate
processing into separate Java™
Virtual Machines without the
gargantuan overhead of commercial application
Do you need many flavors of RMI Servers
the simple to the complex?
Would you like to run a backend queuing and
threading server embedded
within any application?
Is it too time-consuming to develop a custom server that
Timed, Autonomous, Urgent and Multi-Component
If you need a secure,
reliable, manageable and fault tolerant Divide-and-Conquer
for any purpose and do
not wish to start at the
beginning designing and testing one yourself,
then you need Tymeac™