Improving the efficiency of tuple spases

Linda provides high-level linguistic abstractions for concurrentprogramming with operations for synchronization andexchange of values between different programs that shareinformation by accessing common repositories named tuplespaces. Despite their expressive power and their simplicity,there are several challenges in implementing tuple space systems,which prevent the Linda model to be widespread.The goal of this work is to provide an efficient implementationof the Linda coordination model. As a starting point, wetake KLAIM and its Java implementation and we improve onit after evaluating the performances of selected implementationsof tuple spaces and discussing their different implementationchoices concerned with data structures and queryingtechniques. Our KLAIM implementation is also extended withabstractions for data replication based on automatic data placementstrategies.