A set of conditions are described which determine independently. Thus, at any given time, a processing whether or not two successive portions of a given program can be element can either be idle or can execute the command performed in parallel and still produce the same results. The condibeing broadcast to all processing elements by the supertions are general and can be applied to sections of the program of bingrbradcas tOLl p s elemense by tesuper arbitrary size. The conditions are interesting because of the light they visory unit. SOLOMON is therefore severely restricted shed on the structure of programs amenable to parallel processing in the kind of tasks it can perform. In particular, it is and the memory organization of a multi-computer system. suited for problems which involve a number of identical, independent calculations (e.g., the solution of partial

No abstract

We propose efficient algorithms to maintain a replicated dictionary using a log in an unreliable network. A non-serializable approach is used to achieve high concurrency. The solutions are resilient to both node and communication failures. Optimizations are developed for networks which are not completely connected.

No abstract