Combinatorial power in multimedia processors

Authors:
Mikkel Thorup
Affiliations:
AT&T Labs-Research, Florham Park, NJ
Venue:
ACM SIGARCH Computer Architecture News
Year:
2003

Citing 11
Cited 4

Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
A randomized linear-time algorithm to find minimum spanning trees

Journal of the ACM (JACM)
Computer architecture (2nd ed.): a quantitative approach

Computer architecture (2nd ed.): a quantitative approach
Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Even strongly universal hashing is pretty fast

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A minimum spanning tree algorithm with inverse-Ackermann type complexity

Journal of the ACM (JACM)
On AC0 implementations of fusion trees and atomic heaps

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Tabulation based 4-universal hashing with applications to second moment estimation

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Equivalence between priority queues and sorting

Journal of the ACM (JACM)
From nondeterministic suffix automaton to lazy suffix tree

Algorithms and Applications
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We point out the significance of a few multimedia instructions in fundamental combinatorial problems such as hashing, sorting, minimum spanning tree and single source shortest paths. The hope is convince the processor design community to give these instructions a more central role so that they will be supported consistently as a standard in future multimedia processors. At the same time, we provide a simple model of multimedia processors for the algorithms community, highlighting the aspects of relevance in combinatorial algorithms.