Search results
From Mesham
Jump to navigationJump to searchCreate the page "Example Codes" on this wiki! See also the search results found.
- == Example codes ==2 KB (219 words) - 15:44, 15 April 2019
- ...associated compilers, runtime language and documentation including example codes is owned by Nick Brown. It may be used and reproduced as per the creative c411 bytes (66 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> ...pect the programmer to have to modify the compiler in order to support the codes they wish to write. There are a number of issues to consider however in rel1 KB (237 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc>425 bytes (60 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> [[Category:Example Codes]]2 KB (249 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> .... There are actually a number of ways such a result can be obtained - this example is a simple parallel algorithm for this job.2 KB (302 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> ...program and efficiency have been tradeoffs, with the most common parallel codes being written in low level languages.2 KB (351 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> [[Category:Example Codes]]2 KB (388 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc>999 bytes (115 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> The mandlebrot example will compute the Mandlebrot set over any number of processes. This is a set5 KB (741 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> ...llel situation to simplify the concept.) Hopefully quite obviously, in the example by changing the number of processes, the number of rounds and the number of3 KB (460 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc>1 KB (190 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc>1 KB (184 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc>1 KB (196 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc>1 KB (196 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc>2 KB (277 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> == Example ==2 KB (327 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> ...then requires transformation back into the time domain. At the core of the example is the FFT kernel, this is a basic Cooley Turkey FFT algorithm and there ar9 KB (1,372 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> ...examples to highly complex cosmological simulations or weather prediction codes. Utilising parallel computing adds additional complexities and challenges t7 KB (1,043 words) - 15:44, 15 April 2019
- ...ted programming language allowing the writing of high performance parallel codes which are efficient yet simple to write and maintain</metadesc> ...allow for the programmer to specify additional information. Taking C as an example, in order to declare a variable "m" to be a character in read only memory t3 KB (576 words) - 15:44, 15 April 2019