The Chinese Remainder Theorem and the Prime ... - Semantic Scholar
The
Chinese
Remainder
Theorem
and
the
Prime
Memo]ry
System Q.S.
Chinese
Gao
Academy
for filling
Abstract As
we know,
portant
the
problem
puter,
there
system
conj%ct
problem
in memory
prime
memory
lished
prime
scheme
approach.
memory
of super
of conj-lict-free
skewing
system
is a very
system
are two kinds
approaches:
approaches memory
space for
‘holes’
[1 7],
where
p is
number
In this paper,
theorem,
system out
wasting
puting
only any
a perfect
need to find
memory
prime
and
“d Mod
p“
We
when
p=21
[20-21]
“l-bits
“l-bits
cycle! adder”
similar
p=2z + 1. Avizienis
[19] also proposed p“ when
In
without
this
ory
com-
paper,
system
without
the quotient.
we present
which
only
wasting the
any
in
in [w]
approach
for finding
p with-
a
which
case) for find-
remain-
“d Mod
proposed
cycle adder”
– 1, and
a
which
approach,
(as a special
by parallel
also
[18] propose modulus
division
the approach
computing I.
[17].
They
for some cases such Teng
memory
the d Mod
space
to
data.
performing
multiple-bits
one step or by serial steps
ation
for
applied
speed
other
in detail.
technique
be
ing
the
memory
based on Chinese
we present
which
of
the implement
includes
or
filling
with
p-vector
high
pub-
holes
as linear
can
and
those
proposed simple
memory
are complex
of the
der
com-
Previously
I/p
the
im-
approach
wasting modules.
of Sciences
when
an approach
p=2~ – 1 or p=21 + 1. a perfect
need
prime
to find
memory
the
space
mem-
d Mod
and
p
without
quotient.
INTRODUCTION II.
.4 fundamental
problem
the effective search ment.
There
problem are two
[10-14],
the number
re-
of memory
can be achieved is the
is prime Kuck linear
without
supercomputer
17 memories
and
16 processors.
[17]
the
prime
describe
in detail, plementation. p memory
on which This modules,
the
mem-
a memory
if n is not
memory
or increases
it wastes the
v
Chinese
Remainder
Theorem
and
the
Prime
Memo]ry
System Q.S.
Chinese
Gao
Academy
for filling
Abstract As
we know,
portant
the
problem
puter,
there
system
conj%ct
problem
in memory
prime
memory
lished
prime
scheme
approach.
memory
of super
of conj-lict-free
skewing
system
is a very
system
are two kinds
approaches:
approaches memory
space for
‘holes’
[1 7],
where
p is
number
In this paper,
theorem,
system out
wasting
puting
only any
a perfect
need to find
memory
prime
and
“d Mod
p“
We
when
p=21
[20-21]
“l-bits
“l-bits
cycle! adder”
similar
p=2z + 1. Avizienis
[19] also proposed p“ when
In
without
this
ory
com-
paper,
system
without
the quotient.
we present
which
only
wasting the
any
in
in [w]
approach
for finding
p with-
a
which
case) for find-
remain-
“d Mod
proposed
cycle adder”
– 1, and
a
which
approach,
(as a special
by parallel
also
[18] propose modulus
division
the approach
computing I.
[17].
They
for some cases such Teng
memory
the d Mod
space
to
data.
performing
multiple-bits
one step or by serial steps
ation
for
applied
speed
other
in detail.
technique
be
ing
the
memory
based on Chinese
we present
which
of
the implement
includes
or
filling
with
p-vector
high
pub-
holes
as linear
can
and
those
proposed simple
memory
are complex
of the
der
com-
Previously
I/p
the
im-
approach
wasting modules.
of Sciences
when
an approach
p=2~ – 1 or p=21 + 1. a perfect
need
prime
to find
memory
the
space
mem-
d Mod
and
p
without
quotient.
INTRODUCTION II.
.4 fundamental
problem
the effective search ment.
There
problem are two
[10-14],
the number
re-
of memory
can be achieved is the
is prime Kuck linear
without
supercomputer
17 memories
and
16 processors.
[17]
the
prime
describe
in detail, plementation. p memory
on which This modules,
the
mem-
a memory
if n is not
memory
or increases
it wastes the
v
