| C.Callsen, I.Cheng & P.Hagen. " The AUC C++ Linda System", Aalborg University Center Denmark, EPCC Technical Report 91-13, pp 39-73, June1991. |
....rd(t) except that these are non blocking primitives. eval(T) Starts a process to calculate the data elements of the tuple T, and deposits the resulting tuple in the TS thereafter. Creates a so called live tuple. These primitives can be easily incorporated in a highlevel language like C [1] C [7] or Pascal[22] In fact, Linda can be seen not as a new language, but simply as parallel extensions that support the abstraction of the Tuple Space. Linda simplicity and elegance rely in some important factors that are worth of mention: Processes are temporally and spatially uncoupled. Sender ....
C.Callsen, I.Cheng & P.Hagen. " The AUC C++ Linda System", Aalborg University Center Denmark, EPCC Technical Report 91-13, pp 39-73, June1991.
....If there is no matching tuple, a flag is returned giving feedback to the user. eval(t) Starts a different process to calculate the data elements of the tuple t, and then deposits the calculated tuple in the TS. By incorporating these primitives in an high level language like C [1] C [7] or Pascal [22] programmers can build parallel programs in a straightforward way. Linda simplicity and elegance relies on some important factors, namely: 1. Programmers can be freed from having to deal with spatial and temporal relationships among parallel processes, because processes in Linda ....
C.Callsen, I.Cheng & P.Hagen. " The AUC C++ Linda System", Aalborg University Center Denmark, EPCC Technical Report 91-13, pp 39-73, June1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC