| 246 | | == coco == |
| 247 | | * '''Author(s):''' Edd Dawson |
| 248 | | * '''Version:''' 0.2.0 |
| 249 | | * '''State:''' |
| 250 | | * '''Last upload:''' 23 Feb 2008 |
| 251 | | * '''Links:''' [http://www.mr-edd.co.uk/?page_id=91 Web Site] [http://www.mr-edd.co.uk/files/coco/coco-0.2.0.zip Download] |
| 252 | | * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] |
| 253 | | * '''Description:''' coco is a library that implements the Boost.Thread interface but is written in terms of the operating system’s native cooperative threading mechanism, whether that be Fibers on Windows, or the <ucontext.h> functions on POSIX machines. |
| 254 | | |
| 255 | | This means that multi-threaded programs written using Boost.Thread can now be run in a single thread. This is useful for debugging and testing purposes, where it is necessary to look at algorithmic correctness in isolation from correctness of synchronisation. |
| 256 | | |
| 257 | | --------------------------------------------------------------------------------------------------- |
| | 588 | --------------------------------------------------------------------------------------------------- |
| | 589 | == Boost.!MapReduce == |
| | 590 | * '''Author(s):''' Craig Henderson |
| | 591 | * '''Version:''' 0.4 |
| | 592 | * '''Last upload:''' February 26, 2009 |
| | 593 | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=mapreduce_0_4.zip&directory=& Boost Vault] |
| | 594 | * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] [#Algorithms Algorithms] |
| | 595 | * '''Description:''' MapReduce is a programming model and distributed processing platform implementation for generating and processing large data sets using clusters of computers. Pioneered by Google and first presented in 2004, the MapReduce programming model has gained significant momentum in commercial, research and open-source projects since, and Google have updated and republished their seminal paper in 2008. |
| | 596 | |
| | 597 | The scalability achieved using MapReduce to implement data processing across a large volume of CPUs, whether on a single server or multiple machines is an attractive proposition. The Boost.MapReduce library is a MapReduce implementation across a plurality of CPU cores rather than machines. The library is implemented as a set of C++ class templates, and is a header-only library. It does, however, depend upon many other Boost libraries, such as Boost.System, Boost.FileSystem and Boost.Thread. |
| | 598 | |
| | 599 | Ma |
| | 911 | == async == |
| | 912 | * '''Author(s):''' Edd Dawson |
| | 913 | * '''Version:''' 0.2.3 |
| | 914 | * '''State:''' |
| | 915 | * '''Last upload:''' 15 January 2008 |
| | 916 | * '''Links:''' [http://www.mr-edd.co.uk/?page_id=58 Web Site] [http://www.mr-edd.co.uk/files/async/async-0.2.3.zip Download] |
| | 917 | * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] |
| | 918 | * '''Description:''' async is a C++ library to allow the calling of functions and functors in an asynchronous manner, thereby making it easier to improve the level of concurrency and parallelism in your applications. |
| | 919 | |
| | 920 | --------------------------------------------------------------------------------------------------- |
| | 921 | == coco == |
| | 922 | * '''Author(s):''' Edd Dawson |
| | 923 | * '''Version:''' 0.2.0 |
| | 924 | * '''State:''' |
| | 925 | * '''Last upload:''' 23 Feb 2008 |
| | 926 | * '''Links:''' [http://www.mr-edd.co.uk/?page_id=91 Web Site] [http://www.mr-edd.co.uk/files/coco/coco-0.2.0.zip Download] |
| | 927 | * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] |
| | 928 | * '''Description:''' coco is a library that implements the Boost.Thread interface but is written in terms of the operating system’s native cooperative threading mechanism, whether that be Fibers on Windows, or the <ucontext.h> functions on POSIX machines. |
| | 929 | |
| | 930 | This means that multi-threaded programs written using Boost.Thread can now be run in a single thread. This is useful for debugging and testing purposes, where it is necessary to look at algorithmic correctness in isolation from correctness of synchronisation. |
| | 931 | |
| | 932 | --------------------------------------------------------------------------------------------------- |
