Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Rhys S. Francis"'
Autor:
Rhys S. Francis, L. J. H. Pannan
Publikováno v:
Parallel Computing. 18:543-550
QuickSort is a favoured sequential internal sorting algorithm due to its fast average running time and its small memory requirements. Previous investigations into its parallel execution have failed to address the O(n) running time of the partition st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9209aa362b09839b67dd989e26d2b914
https://doi.org/10.1016/0167-8191(92)90089-p
https://doi.org/10.1016/0167-8191(92)90089-p
Autor:
Ashley J. Wright, Robert Woodcock, Gerson Galang, Paul Coddington, Frank Crawford, Terry Rankine, Graham Andrew Jenkins, Steve McMahon, Marco La Rosa, Rajesh Chhabra, Daniel Cox, Rhys S. Francis, David Bannon
Publikováno v:
VTDC@SC
The Australian Partnership for Advanced Computing (APAC) began developing the APAC National Grid in 2004. The APAC Grid integrates several partner sites, most of which have multiple compute resources. Different APAC grid application projects require
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cff51e35404dc8907424e789cc7bb313
https://doi.org/10.1109/vtdc.2006.5
https://doi.org/10.1109/vtdc.2006.5
Autor:
Rhys S. Francis, Arnold Pears
Publikováno v:
SPDP
Two major strategies exist for the exploitation of parallel execution on shared memory multiprocessors. Multiple threads of execution can be created within a shared program context and loop iterations can be scheduled between processors. While the tw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5613bbb492724ff046bdcc27911604b
https://doi.org/10.1109/spdp.1990.143608
https://doi.org/10.1109/spdp.1990.143608
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540568919
PARLE
PARLE
This paper addresses the problem of constructing a work load balanced parallel multi-way merge. While a balanced multi-way merge provides an ideal component for multiprocessor sorting algorithms, the general problem concerns the merge of N elements f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2766c66285d0d4082245ea022eb3955d
https://doi.org/10.1007/3-540-56891-3_46
https://doi.org/10.1007/3-540-56891-3_46
Autor:
Arnold Pears, Rhys S. Francis
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540568919
PARLE
PARLE
The fundamental model of memory requires each read to an address to return the most recent value written to the same address. This model becomes a consistency requirement for parallel shared memory machines, and is taken as a necessary property for c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::077ca6f8eab9aa523070748567dc8df3
https://doi.org/10.1007/3-540-56891-3_70
https://doi.org/10.1007/3-540-56891-3_70
Autor:
Ian D. Mathieson, Rhys S. Francis
Publikováno v:
Parallel Computing. 8:165-175
Threads provides a mechanism for simulating the execution of parallel algorithms on a simplified model of a shared-memory multiprocessor. The algorithms can be expressed in a high-level block-structured language, which supports multiple threads of ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01a19bd4d068017541dbb25dd8d6b53b
https://doi.org/10.1016/0167-8191(88)90121-4
https://doi.org/10.1016/0167-8191(88)90121-4
Autor:
Rhys S. Francis
Publikováno v:
ACM SIGPLAN Notices. 18:58-64
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::979b4c28dbd790dcdf6234558919d46f
https://doi.org/10.1145/948176.948180
https://doi.org/10.1145/948176.948180
Publikováno v:
Scopus-Elsevier
A possible path to the teraflop performance that will be required by the next generation of GCMs (general circulation models) is the SIMD (Single Instruction stream, Multiple Data stream) massively parallel computer architecture. A critical considera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c12dc9729c1fad6583e9436de67e5315
http://www.scopus.com/inward/record.url?eid=2-s2.0-77951627392&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-77951627392&partnerID=MN8TOARS
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.