Skip to content

Correct some typos in README.md. #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
jeremyong wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Correct some typos in README.md. #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 5 additions & 5 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -55,10 +55,10 @@ Heap Fragmentation
Heap fragmentation occurs when the heap address space of a programm
is scattered with small chunks of memory that are in use. Between
these small chunks there may be lots of free memory but not in
contigous blocks. This problem is similar to fragmentation in
contiguous blocks. This problem is similar to fragmentation in
harddisk filesystems. Now when the programmer tries to allocate
a reasonably large block of contigous memory, the memory
allocator may not be able to fullfill the request, neither be reusing
allocator may not be able to fulfill the request, neither by reusing
a free block nor by requesting new memory from the operation system
because there is no more free region in the address space of the program.
This often means a fatal out of memory exception.
Expand Down Expand Up @@ -139,8 +139,8 @@ to a platform specific alignment border.
Modern allocators have several optimization techniques for
efficient allocation of small objects.

Memory overhead usage can be reduce with using pool allocators.
These are allocators which basically allocate densly packed arrays
Memory overhead usage can be reduced by using pool allocators.
These are allocators which basically allocate densely packed arrays
of objects of the same size and can mark them as free with an
overlayed free list. The disadvantage of pool allocators is,
that they can only serve objects of the same size.
Expand Down Expand Up @@ -186,7 +186,7 @@ them correctly.

Security
========
Memory management is not only a problem of effifiency but also
Memory management is not only a problem of efficiency but also
one of correctness and thus security.
When the free operation is supplied
an invalid pointer that is either not been allocated using
Expand Down