big o - What is the time complexity of mmap in Linux? -
in big o notation guess , respect size of memory requested. also, can assume memory not committed lazily because makes things complicated.
to precise call mmap(0, n, prot_read | prot_write, map_private | map_anonymous, -1, 0) n variable.
in reference state that,
map_anonymous initialize region zeros.
i believe process o(n) complexity, possibly more efficient :
on systems using private anonymous mmaps more efficient using malloc large blocks. not issue gnu c library, included malloc automatically uses mmap appropriate.
Comments
Post a Comment