903 search results - page 36 / 181 » Completeness Results for Memory Logics |
CLUSTER
2007
IEEE
14 years 19 days ago
2007
IEEE
Bulk memory copies incur large overheads such as CPU stalling (i.e., no overlap of computation with memory copy operation), small register-size data movement, cache pollution, etc...
DSD
2007
IEEE
14 years 3 months ago
2007
IEEE
An address generator produces a unique address from 1 to k for the input that matches to one of k registered vectors, and produces 0 for other inputs. This paper presents the supe...
DATE
2006
IEEE
14 years 2 months ago
2006
IEEE
We propose a novel methodology to generate Application Specific Instruction Processors (ASIPs) including custom instructions. Our implementation balances performance and area req...
LOGCOM
2006
13 years 8 months ago
2006
Starting from a decomposition result of MTL-chains as ordinal sums, we focus our attention on a particular kind of indecomposable semihoops, namely weakly cancellative semihoops. ...
FTTCS
2006
13 years 8 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...