COIN-OR::LEMON - Graph Library

Changes between Version 1 and Version 2 of GSoC2010Ideas


Ignore:
Timestamp:
03/10/10 19:24:18 (10 years ago)
Author:
Alpar Juttner
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • GSoC2010Ideas

    v1 v2  
    2727
    2828
    29 == Thread safe graph maps ==
     29== Multi thread support & thread safe graph maps ==
    3030mentor: Alpár Jüttner
    3131
    3232=== Background ===
    3333
     34Most LEMON data structures provides thread safety in the usual sense (i.e. they can be safely created in parallel and the read operation is also safe until no one tries to write it in the same time). There is however a very important exception - ''the default graph maps''. The reason is that these data structures must register themselves at the underlying graph in order to be notified about the changes. For thread safety, a locking mechanism is necessary here to prevent race condition.
     35
    3436=== The Task ===
     37
     38 - Develop a basic API for the most usual threading building blocks (such as mutex semaphore etc). It must be easy-to-use and should be usable on different platforms and with different threading library. Consider using existing open source library, but any external dependence must be optional
     39 - Implement a locking mechanism into the graph event notifiers.
    3540
    3641=== Application conditions ===
    3742
    3843 - knowledge of C++ language
    39  - basic knowledge of graph theory
    4044 - English language knowledge
    4145
    4246=== Benefits of participating ===
     47
     48By taking part in this project, you can get familiar with the LEMON library, and principles of concurrent programming - a soon to be fundamental paradigm in practical operations research and optimization.
    4349
    4450== Cairo based graph visualization ==