1
$\begingroup$

Within the field of cache-oblivious algorithms the ideal cache model is used for determining the cache complexity of an algorithm. One of the assumptions of the ideal cache model is that it models a "tall cache". This is given by the statement $Z = \Omega(L^2)$. Where $Z$ is the size of the cache and $L$ is the size of the cache line. What does $\Omega$ represent?

$\endgroup$
5
$\begingroup$

It's the lower bound counterpart to O($\cdot$). Z is larger than some constant times $L^2$

$\endgroup$
-1
$\begingroup$

It's called "asymptotic lower bound" - https://www.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/big-big-omega-notation

$\endgroup$
  • $\begingroup$ Welcome to the site! We, like all Stack Exchange sites, are looking for actual answers, not links to other sites. $\endgroup$ – David Richerby Apr 18 '17 at 8:47

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.