Search results

Create the page "On" on this wiki! See also the search results found.

• Single
  single[on[process]] ...locate a variable to a specific process. Most commonly combined with the ''on'' type which specifies the process to allocated to, but not required if thi
  667 bytes (92 words) - 15:44, 15 April 2019
• Arraydist
  Will distribute data blocks amongst the processes dependant on the integer array supplied. The number of elements in this array must equal var b:array[Int,16,16] :: allocated[single[on[1]]];
  1 KB (181 words) - 15:45, 15 April 2019
• Blocking
  var a:Int::allocated[single[on[1]]]; var b:Int::allocated[single[on[2]]] :: blocking[];
  639 bytes (91 words) - 15:44, 15 April 2019
• Main Page
  ...ki.org/wiki/Special:MyLanguage/Help:Contents User's Guide] for information on using the wiki software. ...org/wiki/Special:MyLanguage/Manual:Combating_spam Learn how to combat spam on your wiki]
  735 bytes (96 words) - 15:44, 15 April 2019
• Standard
  ...er when the message has been delivered or it has been copied into a buffer on the sender. This is the default applied if further type information is not var a:Int::allocated[single[on[1]]] :: nonblocking[] :: standard[];
  764 bytes (109 words) - 15:44, 15 April 2019
• Synchronous
  var a:Int::allocated[single[on[1]]]; var b:Int::allocated[single[on[2]]] :: synchronous[] :: blocking[];
  2 KB (225 words) - 15:44, 15 April 2019
• Onesided
  var i:Int::onesided::allocated[single[on[2]]]; ...mory held by process two. At line three barrier synchronisation will occur on variable ''i'', which in this case will involve processes zero and two ensu
  1 KB (193 words) - 15:44, 15 April 2019
• Gather
  var x:array[Int,12] :: allocated[single[on[2]]]; ...'x'' is allocated on the root process (2) only. Whereas ''r'' is allocated on all processes. In the assignment all three elements of ''r'' are gathered f
  814 bytes (115 words) - 15:44, 15 April 2019
• Ready
  var a:Int::allocated[single[on[1]]]; var b:Int::allocated[single[on[2]]] :: ready[];
  935 bytes (140 words) - 15:44, 15 April 2019
• Buffered
  var a:Int::allocated[single[on[1]]]; var b:Int::allocated[single[on[2]]] :: buffered[500];
  1 KB (197 words) - 15:44, 15 April 2019
• Array
  When an array variable is assigned to another, depending on where each variable is allocated to, there may be communication to achieve | single[on[i]]
  2 KB (337 words) - 15:44, 15 April 2019
• Eageronesided
  var i:Int::eageronesided::allocated[single[on[2]]]; ...esided 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
  1 KB (157 words) - 15:45, 15 April 2019
• Allreduce
  Similar to the [[reduce]] type, but the reduction will be performed on each process and the result is also available to all. In this case all processes will perform the reduction on ''p'' and all processes will have the minimum value of ''p'' placed into th
  674 bytes (89 words) - 15:44, 15 April 2019
• Declaration
  ...9, an integer and as such the type is infered to be both Int and allocated on multiple processes. var z:Char :: allocated[single[on[2]]];
  1 KB (245 words) - 15:44, 15 April 2019
• Declaredtype
  ...th the type [[const]] (enforcing read only access to the variable's data.) On line 3, the programmer is reverting the variable back to its declared type
  696 bytes (109 words) - 15:44, 15 April 2019
• Download rtl 0.2
  ..., although it will be possible for an experienced programmer to install it on that system. ...nstructions are included with the library. Additionally these can be found on the [[Download 0.5|Download 0.5 Package]] page.
  1 KB (184 words) - 15:44, 15 April 2019
• Download rtl 1.0
  ...ons. Your code should run without modification and all of the example code on this website, including the tutorials, have been tested and found to work i ...nstructions are included with the library. Additionally these can be found on the [[Download 1.0|download 1.0 package]] page.
  2 KB (300 words) - 15:45, 15 April 2019
• Wish List
  * Anything else.... ''just tell us you are working on it''
  306 bytes (41 words) - 15:44, 15 April 2019
• Heap
  ''Note:'' All heap memory is garbage collected. The specifics of this depends on the runtime library, broadly when it goes out of scope then it will be coll ...eclared as an integer and allocated to all processes (by default) and also on the heap. Note how we have omitted the optional braces to the ''stack'' typ
  1 KB (155 words) - 15:44, 15 April 2019
• Tutorial - Shared Memory
  Communication depends on exactly where variables are allocated to which in itself is driven by types ...is case, process one modifying the value will have no impact on ''a'' held on other processes such as process zero.
  7 KB (1,135 words) - 15:44, 15 April 2019
• Introduction
  ...little efficiency tricks, which become difficult to maintain as time goes on. It is often the case that, existing HPC code (often written in C with a co ...r those using the language. There is much important development to be done on the language and tools in order to develop what has been created thus far
  2 KB (277 words) - 15:44, 15 April 2019
• Async
  ...processes 0 and 1. In the par loop, the assignment ''a:=89'' is applicable on process 0 only, resulting in an asynchronous send. Each process executes th var a:Int::allocated[single[on[1]]];
  2 KB (359 words) - 15:44, 15 April 2019
• The Arjuna Compiler
  ...es the Message Passing Interface (version 2) for communication. Therefore, on the target machine, an implementation of MPI, such as OpenMPI, MPICH or a v ...ses on 2 cores is 1 process on each, 6 processes on 2 cores is 3 processes on each etc...)
  4 KB (677 words) - 15:44, 15 April 2019
• Nonblocking
  var a:Int::allocated[single[on[1]]] :: nonblocking[]; var b:Int::allocated[single[on[2]]];
  1 KB (152 words) - 15:44, 15 April 2019
• Notifyall
  ...function will notify all other process, all these target process can wait on or test for a notification. This is non-blocking and will continue as soon
  454 bytes (57 words) - 15:45, 15 April 2019
• Notify
  ...notify(n) function will notify process ''n'', this target process can wait on or test for a notification. This is non-blocking and will continue as soon
  482 bytes (63 words) - 15:45, 15 April 2019
• Share
  var e:array[Int,10]::allocated[single[on[1]]]; var u:array[Char,12]::allocated[single[on[1]] :: share[e]];
  1 KB (225 words) - 15:44, 15 April 2019
• Oubliette
  * Based on [http://www.mesham.com/downloads/specification1a6.pdf specification 1a6] * Updated proc, par and group semantics to be none blocking on entry to the blocks
  4 KB (521 words) - 15:44, 15 April 2019
• Try
  ...Mesham and the last appropriate catch block will be entered into depending on program flow. ...xist, then instead of that element being displayed an error message is put on the screen.
  2 KB (248 words) - 15:44, 15 April 2019
• Dartboard PI
  ...he result. Very ruffly, this means that with d darts, thrown over r rounds on n processes, the time taken parallely is the time it takes to simulate thro var calculatedPi:array[Double,m]:: allocated[single[on[0]]];
  3 KB (460 words) - 15:44, 15 April 2019
• Tutorial - RMA
  ...the [[Tutorial_-_Shared_Memory|shared memory tutorial]] and here we build on that to consider the concepts in more depth. var a:Int::allocated[single[on[1]]];
  9 KB (1,342 words) - 15:45, 15 April 2019
• Evendist
  var e:array[Int,16,16] :: allocated[row[] :: single[on[1]]]; ...ocation 11, whilst ''r'' is the value at ''a's'' block memory location 35. On line 9, variable ''s'' is the value at ''b's'' block memory location 50 bec
  2 KB (316 words) - 15:44, 15 April 2019
• Mandelbrot
  ...dealing with specific colourisation of the resulting fractal. The example on this page is purposly basic so that the potential programmer can understand ...formance of such codes, due to the close performance of the codes when run on an initial number of processors was the same and as such not shown. Due to
  5 KB (741 words) - 15:44, 15 April 2019
• Computation
  ...nefit of MPMD is that it is possible to tailor the code to run efficiently on each processor and also keeps the code each processor will execute relative ...hich the parallel aspects can be designed. The actual problem type depends on which form of parallelism is to be employed.
  5 KB (747 words) - 15:44, 15 April 2019
• File
  A file handle with which the programmer can use to reference open files on the file system
  511 bytes (67 words) - 15:44, 15 April 2019
• For
  ...ample will loop from 0 to 9 (10 iterations) and display the value of ''i'' on each pass.
  523 bytes (79 words) - 15:44, 15 April 2019
• Tutorial - Advanced Types
  typevar typeB::=String::allocated[single[on[3]]]; ...ble, ''typeA'' using the ''::='' operator to be a [[String]] instead. Then on line six we declare variable ''b'' using this type variable, which effectiv
  5 KB (827 words) - 15:45, 15 April 2019
• Int
  In this example variable ''i'' is explicitly declared to be of type ''Int''. On line 2, variable ''b'' is declared and via type inference will also be of t
  534 bytes (68 words) - 15:44, 15 April 2019
• Const
  ...e will produce an error. Whilst the first assignment (''a:=34'') is legal, on the subsequent line the programmer has modified the type of ''a'' to be tha
  614 bytes (90 words) - 15:44, 15 April 2019
• Prime factorization
  This example will perform prime factorization on a number parallely, to return the prime factors which make up that number. ...cation primitive (resulting in the MPI all reduce command.) However, later on we use s as a normal variable in the assignment n:=s due to the typing for
  2 KB (302 words) - 15:44, 15 April 2019
• Communication
  ...barriers on distributed-memory machines is predictable, although not good. On the other hand, this performance hit might be the case, however with BSP th .... A major benefit of this model is that processors can be added or removed on the fly, which is especially important in large, complex parallel systems.
  4 KB (629 words) - 15:44, 15 April 2019
• Image processing
  ...mage. The image processing supported is applying a low or high pass filter on the image. However, to do this the image needs to be transformed into the f Performance of the Fast Fourier Transform (FFT) has been evaluated on a super computer cluster. Two different experiments were performed, one wit
  9 KB (1,372 words) - 15:44, 15 April 2019
• Mesham parallel programming language:Privacy policy
  ...e with legal requests to identify people if they commit illegal activities on this site. Please, no wazes, virus writing, OS exploiting, or links to thos
  678 bytes (111 words) - 15:45, 15 April 2019
• Functions
  The type of the variable depends on the pass semantics (by reference or value.) Broadly, all [[:Category:Elemen ...''modify'' function will accept an integer variable but this is allocated on the heap (pass by reference.) The assignment will modify the value of the v
  2 KB (327 words) - 15:44, 15 April 2019
• Scatter
  In this example, three elements of array ''r'', on process 1, are scattered to each other process and placed in their copy of
  636 bytes (85 words) - 15:44, 15 April 2019
• Include
  ...he absence of the ''.mesh'' ending, the preprocessor will attempt to match on the absolute filename first and if this can not be found will then look for
  885 bytes (136 words) - 15:44, 15 April 2019
• Tutorial - Parallel Constructs
  ...blocks and then using parallel composition to run the blocks in parallel, on different processes, is a useful one. As a further exercise try rearranging ...as at the same time the value of 1 is written to variables ''z'' and ''m'' on process 1. Process 2 performs the assignment ''n:=1'' and lastly process 3
  8 KB (1,369 words) - 15:44, 15 April 2019
• Tutorial - Dynamic Parallelism
  ...tly requires one process, by running with more will just execute that code on all the other processes? There are a number of rules associated with writin var s:array[Int, numberProc]::allocated[single[on[0]]];
  5 KB (787 words) - 15:45, 15 April 2019
• Alltoall
  ...ocess ends up with twelve elements in ''x'', the location of each is based on the source processes's PID.
  738 bytes (99 words) - 15:44, 15 April 2019
• Download 0.41 beta
  ...e first release from the Arjuna compiler line and the last version to work on Windows. Based upon FlexibO this version is deprecated but still contains s ...Note: This version of Mesham is deprecated, the documentation and examples on this website are no longer compatible with this version.''
  10 KB (1,640 words) - 15:44, 15 April 2019

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)