Open AccessJournal Article
The art of computer programming. Vol.2: Seminumerical algorithms
Reads0
Chats0
About:
This article is published in Literacy.The article was published on 1981-01-01 and is currently open access. It has received 2636 citations till now. The article focuses on the topics: Computer programming.read more
Citations
More filters
Journal ArticleDOI
Quantum Monte Carlo on graphical processing units
TL;DR: An end-to-end QMC application with core elements of the algorithm running on a GPU is reported on, demonstrating the speedup improvements possible for QMC in running on advanced hardware and exploring a path toward providing QMC level accuracy as a more standard tool.
Journal ArticleDOI
Generating Local Addresses and Communication Sets for Data-Parallel Programs
TL;DR: This work demonstrates a storage scheme for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution that does not waste any storage and shows that the local memory access sequence of any processor for a computation involving the regular section A(?:h:s) is characterized by a finite state machine of at most k states.
Proceedings ArticleDOI
Software for uniform random number generation: distinguishing the good and the bad
TL;DR: An object-oriented random number package where random number streams can be created at will, and with convenient tools for manipulating the streams, is presented and is implemented in the Arena and AutoMod simulation tools.
Proceedings ArticleDOI
Parallel graph decompositions using random shifts
TL;DR: In this article, an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between is presented, which is based on the shifted shortest path approach introduced in [Blelloch, Gupta, Koutis, Miller, Peng, Tangwongsan, SPAA 2011].
Book ChapterDOI
Cryptographic primitives enforcing communication and storage complexity
TL;DR: A new type of cryptographic primitives which enforce high communication or storage complexity are introduced, a communication-enforced signature and a storage-enforcing commitment scheme, and constructions for both are given.