Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Barnaby Dalton"'
Publikováno v:
Languages and Compilers for Parallel Computing ISBN: 9783319174723
LCPC
LCPC
Partitioned Global Address Space (PGAS) languages are a popular alternative when building applications to run on large scale parallel machines. Unified Parallel C (UPC) is a well known PGAS language that is available on most high performance computin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64414713a93b40b45ac48b46d8b43bcc
https://doi.org/10.1007/978-3-319-17473-0_13
https://doi.org/10.1007/978-3-319-17473-0_13
Publikováno v:
WPMVP@PPoPP
Implementing summation when accuracy and throughput need to be balanced is a challenging endevour. We present experimental results that provide a sense when to start worrying and the expense of the various solutions that exist. We also present a new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44a3459ab52d6618d0b4e1a32217b3af
https://doi.org/10.1145/2568058.2568070
https://doi.org/10.1145/2568058.2568070
Autor:
Yaoqing Gao, Fahham Khan, Amy Wang, Danny Gupta, Barnaby Dalton, James Sedgwick, Peng Wu, Bob Blainey, Louis Ly, Lior Velichover, Jan Treibig, Neil Bartlett
Publikováno v:
WHPCF@SC
The concept of default and its associated painful repercussions have been a particular area of focus for financial institutions, especially after the 2007/2008 global financial crisis. Counterparty credit risk (CCR), i.e. risk associated with a count
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0403065497694aef4f3bb3f45d884cee
https://doi.org/10.1145/2535557.2535567
https://doi.org/10.1145/2535557.2535567
Publikováno v:
SIAM Journal on Computing
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2013, 42 (3), pp.792-807. ⟨10.1137/11083856X⟩
SIAM Journal on Computing, 2013, 42 (3), pp.792-807. ⟨10.1137/11083856X⟩
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2013, 42 (3), pp.792-807. ⟨10.1137/11083856X⟩
SIAM Journal on Computing, 2013, 42 (3), pp.792-807. ⟨10.1137/11083856X⟩
International audience; For graph $G(V,E)$, a minimum path cover (MPC) is a minimum cardinality set of vertex disjoint paths that cover $V$ (i.e., every vertex of $G$ is in exactly one path in the cover). This problem is a natural generalization of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75cb47445703c12e853d2c9c31bc45c5
https://hal.inria.fr/hal-00936300
https://hal.inria.fr/hal-00936300
Publikováno v:
Experiment. Math. 20, iss. 2 (2011), 129-137
For many meta-Fibonacci sequences it is possible to identify a partition of the sequence into successive intervals (sometimes called blocks) with the property that the sequence behaves "similarly" in each block. This partition provides insights into
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e26da4085a39845e468fc5b1cb3b0499