Sectorized lists

[Konard]

We can have an array of sectors, each sector starts with 0 address, meaning it is empty.
If we have non-empty sector, we can go to that place in other file, and get a block that contains a page of data that represents array, and a pointer to the next sector.
This way we can get store lists each of element of with is system page sized array.
This way, we easily solve managing variable length of arrays and store them in one big heap.
Possibly as we use arrays and linked lists this will allow us to use it in conjunction with lock free synchronization for multiple threads access.