A Characterization of Lazy and Eager Semantic Solutions to the Linda Predicates Ambiguity Problem

摘要

The problems associated with Linda predicate operations inp() and rdp() are well known but not always well understood. One problem, from a purely academic standpoint, is that of semantic ambiguity in the case of failure. Despite this problem, commercial tuple space implementations all provide some version of the Linda predicate operations, and thus, problems concerning safety and liveness arise. Solutions to address these problems range from proposing extensions to an existing model of computation (CSP) to proposing alternative definitions for the Linda predicate operations themselves. While these solutions may at first appear unrelated, it is possible to relate these two disparate approaches in the context of lazy and eager semantics. The benefits of this characterization include a clearer understanding of the Linda predicates ambiguity problem, two respective solutions to this problem, and the importance of considering both lazy and eager semantic perspectives as techniques for problem solving in parallel and distributed systems.