We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
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
也可以通过计算方式 若给定一个逻辑地址空间中的地址为A,页面大小为L,则 页号P = INT[A/L] 页内地址d = [A] MOD L
索引表大小 = 块大小/索引地址大小 索引表开始位置=上一个位置+1 索引表结束位置=索引表大小+索引表开始位置-1 存储文件最大值=所有地址项数量x块大小
The text was updated successfully, but these errors were encountered:
No branches or pull requests
计算机基础
因为逻辑地址=页号+页内地址,物理地址=块号+页内地址,页大小二进制位数=页内地址位数,将二进制逻辑地址去页内地址位数就能得到页号,通过页号找到块号,得到物理地址。
文件索引具有直接地址、1~n级索引的方式,通常给出块大小和索引地址大小,计算存储位置。
The text was updated successfully, but these errors were encountered: