This thesis presents an implementation of the Linda model for parallel programming in the functional language OCaml. Linda offers an elegant approach to coordinating parallel processes through a shared tuple space. We have developed a library that implements Linda's core operations, leveraging the enhanced parallel programming capabilities introduced in OCaml 5.0. The primary contribution of this work is an efficient tuple space implementation utilizing a tree-based data structure and multi-level locking mechanism. This approach significantly improves scalability and concurrency compared to naive implementations. Our experimental results demonstrate the implementation's effectiveness and scalability, particularly when dealing with a large number of parallel processes and complex usage scenarios.
|
