Onesided - Revision history

Polas: 6 revisions imported

2019-04-15T15:44:35Z

6 revisions imported

Polas at 14:23, 15 April 2013

2013-04-15T14:23:47Z

Polas at 18:23, 13 January 2013

2013-01-13T18:23:19Z

Polas at 18:22, 13 January 2013

2013-01-13T18:22:58Z

Polas at 17:53, 12 January 2013

2013-01-12T17:53:40Z

Polas: /* Semantics */

2013-01-12T17:18:53Z

‎Semantics

Polas: Created page with '== Syntax == onesided[a,b] == Semantics == Identical to the Channel type, but will perform onesided communication rather than p2p. This form of communication is less effic…'

2010-01-10T19:26:02Z

Created page with '== Syntax == onesided[a,b] == Semantics == Identical to the Channel type, but will perform onesided communication rather than p2p. This form of communication is less effic…'

New page

== Syntax ==

onesided[a,b]

== Semantics ==

Identical to the [[Channel]] type, but will perform onesided communication rather than p2p. This form of communication is less efficient than p2p, but there are no issues such as deadlock to consider.

[[Category:Type Library]]
[[Category:Composite Types]]
[[Category:Primitive Communication Types]]

@@ Line 14: / Line 14: @@
 == Example ==
-  var i:Int::onesided::allocated[single[on[2]]];
+  function void main() {
- proc 0 {i:=34;};
+    var i:Int::onesided::allocated[single[on[2]]];
- sync i;
+    proc 0 {i:=34;};
 In the above code example variable ''i'' is declared to be an Integer using onesided communication on process two only. In line two an assignment occurs on process zero which will write the value, from process zero into the memory held by process two. At line three barrier synchronisation will occur on variable ''i'', which in this case will involve processes zero and two ensuring that the value has been written fully and is available.

@@ Line 20: / Line 20: @@
 In the above code example variable ''i'' is declared to be an Integer using onesided communication on process two only. In line two an assignment occurs on process zero which will write the value, from process zero into the memory held by process two. At line three barrier synchronisation will occur on variable ''i'', which in this case will involve processes zero and two ensuring that the value has been written fully and is available.
-''Since: Version 0.41b''
+''Since: Version 0.5''
 [[Category:Type Library]]
 [[Category:Compound Types]]
 [[Category:Primitive Communication Types]]

@@ Line 19: / Line 19: @@
 In the above code example variable ''i'' is declared to be an Integer using onesided communication on process two only. In line two an assignment occurs on process zero which will write the value, from process zero into the memory held by process two. At line three barrier synchronisation will occur on variable ''i'', which in this case will involve processes zero and two ensuring that the value has been written fully and is available.
 [[Category:Type Library]]
 [[Category:Compound Types]]
 [[Category:Primitive Communication Types]]

← Older revision	Revision as of 15:44, 15 April 2019
(No difference)

@@ Line 2: / Line 2: @@
 onesided[a,b]
 == Semantics ==
-Identical to the [[Channel]] type, but will perform onesided communication rather than p2p. This form of communication is less efficient than p2p, but there are no issues such as deadlock to consider.
+Identical to the [[Channel]] type, but will perform onesided communication rather than p2p. This form of communication is less efficient than p2p, but there are no issues such as deadlock to consider. This type is connected to the [[sync]] keyword, which allows for the programmer to barrier synchronise for ensuring up to date values. The current memory model is Concurrent Read Concurrent Write (CRCW.)<br><br>
 [[Category:Type Library]]
 [[Category:Composite Types]]
 [[Category:Primitive Communication Types]]