A Quantum-Inspired Model for Bit-Serial SIMD-Parallel Computation

Bit-serial SIMD-parallel execution was once commonly used in supercomputers, but fell out of favor as it became practical to implement word-level operations directly in MIMD hardware. Word-level primitive operations simplify programming and significantly speed-up sequential code. However, aggressive...

Full description

Saved in:
Bibliographic Details
Published inLanguages and Compilers for Parallel Computing Vol. 13149; pp. 151 - 159
Main Authors Dietz, Henry, Shafran, Aury, Murphy, Gregory Austin
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2022
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Bit-serial SIMD
C++
Just in time compilation
Logic optimization
Quantum computing
Qubit
Regular expressions
Online AccessGet full text
ISBN9783030959524
303095952X
ISSN0302-9743
1611-3349
DOI10.1007/978-3-030-95953-1_11

Cover

More Information
Summary:Bit-serial SIMD-parallel execution was once commonly used in supercomputers, but fell out of favor as it became practical to implement word-level operations directly in MIMD hardware. Word-level primitive operations simplify programming and significantly speed-up sequential code. However, aggressive gate-level compiler optimization can dramatically reduce power consumed in massively-parallel bit-serial execution without a performance penalty. The model described here, Parallel Bit Pattern Computing, not only leverages gate-level just-in-time optimization of bit-serial code, but also uses a quantum-inspired type of symbolic execution based on regular expressions to obtain a potentially exponential reduction in computational complexity while using entirely conventional computer hardware.
ISBN:9783030959524
303095952X
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-030-95953-1_11