| Y. Chen. Cumulative computing. In MFPS'03, ENTCS. Springer-Verlag, 2003. |
No context found.
Y. Chen. Cumulative computing. In MFPS'03, ENTCS. Springer-Verlag, 2003.
No context found.
Y. Chen. Cumulative computing. In 19th Conference on the Mathematical Foundations of Programming Semantics, ENTCS. Elsevier, 2003.
....laws [4] Law 3 P if P (# ) or (#) # or #) P #) II P ) P = P #) # (II P ) P # = P #) # P # = n # (P #) P #) # (# P ) 3 BSP programming In this section we study the algebraic laws of BSP. A denotational semantics has been given in Chen [1,3]. A BSP program can have an infinite number of supersteps, contain finite nondeterminism and be infeasible. The following table lists the primitive commands of BSP where # and # are two disjoint sets of variables (written henceforth as ###) Operator # is a syntactic restriction for local ....
Y. Chen. Cumulative computing. In MFPS'03, ENTCS. Springer-Verlag, 2003.
No context found.
Y. Chen. Cumulative computing. In 19th Conference on the Mathematical Foundations of Programming Semantics, ENTCS. Elsevier, 2003.
No context found.
Y. Chen. Cumulative computing. In 19th Conference on the Mathematical Foundations of Programming Semantics, volume 38 of Electronic Notes in Theoretical Computer Science. Elsevier, 2004.
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