<s>
In	O
computational	O
complexity	O
theory	O
,	O
computing	O
efficiency	O
,	O
combinatorial	O
optimization	O
,	O
supercomputing	B-Architecture
,	O
computational	O
cost	O
(	O
algorithmic	B-General_Concept
efficiency	I-General_Concept
)	O
and	O
other	O
computational	O
metrics	O
,	O
the	O
mem	B-General_Concept
is	O
a	O
measurement	O
unit	O
for	O
the	O
number	O
of	O
memory	O
accesses	O
used	O
or	O
needed	O
by	O
a	O
process	O
,	O
function	O
,	O
instruction	O
set	O
,	O
algorithm	O
or	O
data	O
structure	O
.	O
</s>
<s>
Example	O
usage	O
,	O
when	O
discussing	O
processing	O
time	O
of	O
a	O
search	O
tree	O
node	O
,	O
for	O
finding	O
10	O
×	O
10	O
Latin	O
squares	O
:	O
"	O
A	O
typical	O
node	O
of	O
the	O
search	O
tree	O
probably	O
requires	O
about	O
75	O
mems	B-General_Concept
(	O
memory	O
accesses	O
)	O
for	O
processing	O
,	O
to	O
check	O
validity	O
.	O
</s>
<s>
Therefore	O
the	O
total	O
running	O
time	O
on	O
a	O
modern	O
computer	O
would	O
be	O
roughly	O
the	O
time	O
needed	O
to	O
perform	O
mems.	O
"	O
</s>
<s>
(	O
Donald	O
Knuth	O
,	O
2011	O
,	O
The	B-General_Concept
Art	I-General_Concept
of	I-General_Concept
Computer	I-General_Concept
Programming	I-General_Concept
,	O
Volume	O
4A	O
,	O
p.6	O
)	O
.	O
</s>
<s>
Reducing	O
mems	B-General_Concept
as	O
a	O
speed	O
and	O
efficiency	O
enhancement	O
is	O
not	O
a	O
linear	O
benefit	O
,	O
as	O
it	O
trades	O
off	O
increases	O
in	O
ordinary	O
operations	O
costs	O
.	O
</s>
<s>
Although	O
lossless	O
compression	O
methods	O
like	O
Rice	O
,	O
Golomb	O
and	O
PFOR	O
are	O
most	O
often	O
associated	O
with	O
signal	O
processing	O
codecs	O
,	O
the	O
ability	O
to	O
optimize	O
binary	O
integers	O
also	O
adds	O
relevance	O
in	O
reducing	O
MEMS	B-General_Concept
tradeoffs	O
vs.	O
operations	O
.	O
</s>
<s>
(	O
See	O
Golomb	B-Algorithm
coding	I-Algorithm
for	O
details	O
)	O
.	O
</s>
