Can I read Algorithms in the Ultra-Wide Word Model on EtoBox?

Algorithms in the Ultra-Wide Word Model by Farzan, Arash; López-Ortiz, Alejandro; Nicholson, Patrick K.; Salinger, Alejandro is a scholarly article available to read on EtoBox.

What is Algorithms in the Ultra-Wide Word Model about?

The effective use of parallel computing resources to speed up algorithms in current multi-core parallel architectures remains a difficult challenge, with ease of programming playing a key role in the eventual success of various parallel architectures. In this paper we consider an alternative view of parallelism in the form of an ultra-wide word processor. We introduce the Ultra-Wide Word architecture and model, an extension of the word-RAM model that allows for constant time operations on thousands of bits in parallel. Word parallelism as exploited by the word-RAM model does not suffer from the more difficult aspects of parallel programming, namely synchronization and concurrency. For the standard word-RAM algorithms, the speedups obtained are moderate, as they are limited by the word size. We argue that a large class of word-RAM algorithms can be implemented in the Ultra-Wide Word model, obtaining speedups comparable to multi-threaded computations while keeping the simplicity of programming of the sequential RAM model. We show that this is the case by describing implementations of Ultra-Wide Word algorithms for dynamic programming and string searching. In addition, we show that th

Author

Farzan, Arash; López-Ortiz, Alejandro; Nicholson, Patrick K.; Salinger, Alejandro

Published

2014

Language

EN