Bit-level parallelism

Known as: Bitlevel parallelisms, Bit-level devices, Bit levels 
Bit-level parallelism is a form of parallel computing based on increasing processor word size. From the advent of very-large-scale integration (VLSI… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2018
05010019742018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Layered video coding creates multiple layers of unequal importance, which enables us to progressively refine the reconstructed… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Graphic Processing Units (GPU) are increasingly popular in the field of high-performance computing for their ability to provide… (More)
  • figure 1
  • figure 2
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present KenLM, a library that implements two data structures for efficient language model queries, reducing both time and… (More)
  • figure 1
  • figure 2
  • table 1
  • table 3
  • table 2
Is this relevant?
2010
2010
We investigate the problem of getting to a higher instructionlevel parallelism in string matching algorithms. In particular… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Accurate and scalable simulation has historically been a key enabling factor for systems research. We present TOSSIM, a simulator… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Single-event upsets from particle strikes have become akey challenge in microprocessor design. Techniques todeal with these… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper, we introduce a framework to estimate the power consumption on switch fabrics in network routers. We propose… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The most important features of a string matching algorithm are its efficiency and its flexibility. Efficiency has traditionally… (More)
  • figure 14
  • figure 16
  • figure 19
Is this relevant?
Highly Cited
1999
Highly Cited
1999
ion level Algorithm level high C level [Liem 97] Word level [Mira 97] Bit level [Grant 94] low ArchItecture level [Grant 94… (More)
Is this relevant?