Search

Your search keyword '"bit parallelism"' showing total 2 results
Start Over Descriptor "bit parallelism" Publisher springer nature
2 results on '"bit parallelism"'

1. Bit-(Parallelism)2: Getting to the Next Level of Parallelism.

Author

Cantone, Domenico, Faro, Simone, and Giaquinta, Emanuele

Abstract

We investigate the problem of getting to a higher instruction-level parallelism in string matching algorithms. In particular, starting from an algorithm based on bit-parallelism, we propose two flexible approaches for boosting it with a higher level of parallelism. These approaches are general enough to be applied to other bit-parallel algorithms. It turns out that higher levels of parallelism lead to more efficient solutions in practical cases, as demonstrated by an extensive experimentation. [ABSTRACT FROM AUTHOR]

Published
2010
Full Text
View/download PDF

2. On finding k-cliques in k-partite graphs.

Author

Mirghorbani, M. and Krokhmal, P.

Abstract

In this paper, a branch-and-bound algorithm for finding all cliques of size k in a k-partite graph is proposed that improves upon the method of Grunert et al. (in Comput Oper Res 29(1):13-31, ). The new algorithm uses bit-vectors, or bitsets, as the main data structure in bit-parallel operations. Bitsets enable a new form of data representation that improves branching and backtracking of the branch-and-bound procedure. Numerical studies on randomly generated instances of k-partite graphs demonstrate competitiveness of the developed method. [ABSTRACT FROM AUTHOR]

Published
2013
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results