Jonathan Sandberg. Design of the PRAM network. Technical Report CS-TR254 -90, Computer Science Department, Princeton University, April 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....all the non erroneous, non bottom answers predicted by the denotational semantics. 2.3. Multiple Values in the Scheme Semantics The official semantics for Scheme allows a procedure to return several values to its caller, as would be needed to model the Common Lisp values construct or the T [14] return form. However, ieee standard Scheme has no construct that allows a programmer to construct a procedure that would return more than one value. Assuming that a program is started with an initial store that hides no multiple value returners, then an implementation may assume that there will ....

Jonathan A. Rees, Norman I. Adams, and James R. Meehan. The T Manual. Computer Science Department, Yale University, fifth edition edition, 1988.

....that scales to thousands of hosts must be fault tolerant, particularly when hosts, in addition to failing, may dynamically disassociate from further participation in an ongoing computation. The piecework computational model that Javelin supports is extended to implement the pipelined RAM [12] model of cache consistency. This model of shared memory is strong enough to support branch and bound computation (in particular, bound propagation) but weak enough to enable high performance. Each host caches a copy of the current minimum cost upper bound. We present a highperformance, scalable, ....

Lipton and Sandberg. Technical Report, Computer Science Department, Princeton University.

....of types with named components into an ML like type system is a tricky business, and no entirely satisfactory solution has been found. 11 10 Implementation status A prototype implementation of XL has been written in Scheme. We used the R 3 RS Scheme environment provided as a subset of T [22], and imported a few facilities from T missing from R 3 RS Scheme, such as macros. Each XL command is processed completely before the next command is read. Forms are read as S expressions by the Scheme reader, and then analyzed to produce their semantic values. While in principle a parser could ....

Jonathan A. Rees, Norman I. Adams, and James R. Meehan. The T Manual. Computer Science Department, Yale University, fourth edition, January 1984.

....by Lipton and Sandberg [LS88] It guarantees that writes made by the same process are read by all processes in the order they were written by the writer. Writes by different processes can be interleaved in different orders at different processes. A hardware implementation of PRAM is described in [San90, Ser90] Hutto and Ahamad proposed Causal memory, Slow memory and Weak memory in [HA90] Causal memory respects the potential causality [Lam78] of memory operations. Slow memory only guarantees that writes by the same process to the same location are read by all processes in the order they were ....

Jonathan Sandberg. Design of the PRAM network. Technical Report CS-TR254 -90, Computer Science Department, Princeton University, April 1990.

No context found.

Jonathan Sandberg. Design of the PRAM network. Technical Report CS-TR254 -90, Computer Science Department, Princeton University, April 1990.

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