Paolo Ciancarini

From the point of view of distributed programming one of the most interesting communication mechanisms is associative tuple matching in a shared dataspace, as exemplified in the Linda coordination language. Linda has been used as a coordination layer to parallelize several sequential programming languages, such as C and Scheme. In this paper we study the combination of Linda with a logic language, whose result is the language Extended Shared Prolog (ESP). We show that ESP is based on a new programming model called PoliS, that extends Linda with Multiple Tuple Spaces. A class of applications for ESP is discussed, introducing the concept of ``open multiple tuple spaces''. Finally, we show how the distributed implementation of ESP uses the network version of Linda's tuple space.

New Generation Computing 12(3), pages 251-283, 1994, Ohmsha, Ltd.
@article{logictuplespaces-ngc12,
Author = {Ciancarini, Paolo},
Doi = {10.1007/BF03037345},
Issn = {0288-3635},
Journal = {New Generation Computing},
Number = 3,
Pages = {251--283},
Publisher = {Ohmsha, Ltd.},
Title = {Distributed Programming with {L}ogic {T}uple {S}paces},
Url = {http://www.springerlink.com/content/h47364qv57867016/},
Url-Pdf = {http://www.springerlink.com/content/h47364qv57867016/fulltext.pdf},
Volume = 12,
Year = 1994}

Tags:
    

Publication Data

2011 © aliCE Research Group @ DEIS, Alma Mater Studiorum-Università di Bologna
1.1