Alan Gibbons


Efficient Parallel Scan Algorithms for GPUs . Scan and segmented scan algorithms are crucial building blocks for a great many data-parallel algorithms. Segmented scan and related primitives also provide the necessary support for the flattening transform, which allows for nested data-parallel programs to be compiled into flat data-parallel languages. In this paper, we describe the design of

8.54 MB Taille du fichier
9780521388412 ISBN
Libre PRIX


PC et Mac

Lisez l'eBook immédiatement après l'avoir téléchargé via "Lire maintenant" dans votre navigateur ou avec le logiciel de lecture gratuit Adobe Digital Editions.

iOS & Android

Pour tablettes et smartphones: notre application de lecture tolino gratuite

eBook Reader

Téléchargez l'eBook directement sur le lecteur dans la boutique www.cocoasharp.org ou transférez-le avec le logiciel gratuit Sony READER FOR PC / Mac ou Adobe Digital Editions.


Après la synchronisation automatique, ouvrez le livre électronique sur le lecteur ou transférez-le manuellement sur votre appareil tolino à l'aide du logiciel gratuit Adobe Digital Editions.

Notes actuelles

Sofya Voigtuh

DOI: 10.1016/0167-6423(94)00013-1 Corpus ID: 31329492. Efficient Parallel Algorithms for Tree Accumulations @article{Gibbons1994EfficientPA, title={Efficient Parallel Algorithms for Tree Accumulations}, author={Jeremy Gibbons and Wentong Cai and David B. Skillicorn}, journal={Sci. Comput.

Mattio Müllers

31/01/2014 · Efficient sequential and parallel algorithms for planted motif search. Nicolae M(1), Rajasekaran S. Author information: (1)Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA. [email protected] BACKGROUND: Motif searching is an important step in the detection of rare events occurring in a set of DNA or protein sequences. One …

Noels Schulzen

Algorithms for calculating variance - Wikipedia

Jason Leghmann

Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix multiplication in computational problems are found in many fields including scientific computing and pattern recognition and in seemingly unrelated problems such as counting the paths through a graph.

Jessica Kolhmann

Structured Parallel Programming offers the simplest way for developers to learn patterns for high-performance parallel programming. Written by parallel computing experts and industry insiders Michael McCool, Arch Robison, and James Reinders, this book explains how to design and implement maintainable and efficient parallel algorithms using a composable, structured, scalable, and machine