I just learned about the Inverted Page Table and immediately thought about the chaining model used. If two processes use the same virtual address, resolving the address will have to include following the chaining information in the table.If all memory addresses were used uniformly, that should not be a problem, since address collisions would happen seldomly. But if many processes use the first page (because they usually start using small addresses) will that not deteriorate performance on a real system a lot?
In an Inverted Page Table, will following chains happen very often for small addresses?
performance;virtual memory;paging
According to my knowledge, inverted page table has an entry for each physical frame, not for each logical page.It is usually designed as a Hash table, where the Hash function takes both the task id and the page number as parameters. Thus (task A, address X) and (task B, address X) will not be likely to produce the same Hash value.Does that answer your question?