24 实战页式内存管理 上
参考
https://blog.51cto.com/13475106/category6.html及狄泰软件相关课程
课程设计目标(Qt下实现)
1.用代码描述:页表,页框表,任务结构
2.用代码实现:页请求,页置换
3.模拟任务的页面访问过程(访问虚拟内存)
4.模拟操作系统中的任务调度(扩展)
实现的流程图如下所示
代码实现
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 | #include <QtCore/QCoreApplication> #include <QList> #include <iostream> #include <ctime> using namespace std; #define PAGE_NUM (0xFF + 1) #define FRAME_NUM (0x04) #define FP_NONE (-1) struct FrameItem { int pid; // the task which use the frame int pnum; // the page which the frame hold FrameItem() { pid = FP_NONE; pnum = FP_NONE; } }; class PageTable { int m_pt[PAGE_NUM]; public : PageTable() { for ( int i=0; i<PAGE_NUM; i++) { m_pt[i] = FP_NONE; } } int & operator[] ( int i) { if ( (0 <= i) && (i < length()) ) { return m_pt[i]; } else { QCoreApplication:: exit (-1); } } int length() { return PAGE_NUM; } }; class PCB { int m_pid; // task id PageTable m_pageTable; // page table for the task int * m_pageSerial; // simulate the page serial access int m_pageSerialCount; // page access count int m_next; // the next page index to access public : PCB( int pid) { m_pid = pid; m_pageSerialCount = qrand() % 5 + 5; m_pageSerial = new int [m_pageSerialCount]; for ( int i=0; i<m_pageSerialCount; i++) { m_pageSerial[i] = qrand() % 8; } m_next = 0; } int getPID() { return m_pid; } PageTable& getPageTable() { return m_pageTable; } int getNextPage() { int ret = m_next++; if ( ret < m_pageSerialCount ) { ret = m_pageSerial[ret]; } else { ret = FP_NONE; } return ret; } bool running() { return (m_next < m_pageSerialCount); } void printPageSerial() { QString s = "" ; for ( int i=0; i<m_pageSerialCount; i++) { s += QString::number(m_pageSerial[i]) + " " ; } cout << ( "Task" + QString::number(m_pid) + " : " + s).toStdString() << endl; } ~PCB() { delete [] m_pageSerial; } }; FrameItem FrameTable[FRAME_NUM]; QList<PCB*> TaskTable; int GetFrameItem(); void AccessPage(PCB& pcb); int RequestPage( int pid, int page); int SwapPage(); void PrintLog(QString log ); void PrintPageMap( int pid, int page, int frame); void PrintFatalError(QString s, int pid, int page); int GetFrameItem() { int ret = FP_NONE; for ( int i=0; i<FRAME_NUM; i++) { if ( FrameTable[i].pid == FP_NONE ) { ret = i; break ; } } return ret; } void AccessPage(PCB& pcb) { int pid = pcb.getPID(); PageTable& pageTable = pcb.getPageTable(); int page = pcb.getNextPage(); if ( page != FP_NONE ) { PrintLog( "Access Task" + QString::number(pid) + " for Page" + QString::number(page)); if ( pageTable[page] != FP_NONE ) { PrintLog( "Find target page in page table." ); PrintPageMap(pid, page, pageTable[page]); } else { PrintLog( "Target page is NOT found, need to request page ..." ); pageTable[page] = RequestPage(pid, page); if ( pageTable[page] != FP_NONE ) { PrintPageMap(pid, page, pageTable[page]); } else { PrintFatalError( "Can NOT request page from disk..." , pid, page); } } } else { PrintLog( "Task" + QString::number(pid) + " is finished!" ); } } int RequestPage( int pid, int page) { int frame = GetFrameItem(); if ( frame != FP_NONE ) { PrintLog( "Get a frame to hold page content: Frame" + QString::number(frame)); } else { PrintLog( "No free frame to allocate, need to swap page out." ); frame = SwapPage(); if ( frame != FP_NONE ) { PrintLog( "Succeed to swap lazy page out." ); } else { PrintFatalError( "Failed to swap page out." , pid, FP_NONE); } } PrintLog( "Load content from disk to Frame" + QString::number(frame)); FrameTable[frame].pid = pid; FrameTable[frame].pnum = page; return frame; } int Random() { // just random select int obj = qrand() % FRAME_NUM; PrintLog( "Random select a frame to swap page content out: Frame" + QString::number(obj)); PrintLog( "Write the selected page content back to disk." ); FrameTable[obj].pid = FP_NONE; FrameTable[obj].pnum = FP_NONE; for ( int i=0, f=0; (i<TaskTable.count()) && !f; i++) { PageTable& pt = TaskTable[i]->getPageTable(); for ( int j=0; j<pt.length(); j++) { if ( pt[j] == obj ) { pt[j] = FP_NONE; f = 1; break ; } } } return obj; } int SwapPage() { return Random(); } void PrintLog(QString log ) { cout << log .toStdString() << endl; } void PrintPageMap( int pid, int page, int frame) { QString s = "Task" + QString::number(pid) + " : " ; s += "Page" + QString::number(page) + " ==> Frame" + QString::number(frame); cout << s.toStdString() << endl; } void PrintFatalError(QString s, int pid, int page) { s += " Task" + QString::number(pid) + ": Page" + QString::number(page); cout << s.toStdString() << endl; QCoreApplication:: exit (-2); } int main( int argc, char *argv[]) { QCoreApplication a(argc, argv); int index = 0; qsrand( time (NULL)); TaskTable.append( new PCB(1)); TaskTable.append( new PCB(2)); PrintLog( "Task Page Serial:" ); for ( int i=0; i<TaskTable.count(); i++) { TaskTable[i]->printPageSerial(); } PrintLog( "==== Running ====" ); while ( true ) { if ( TaskTable[index]->running() ) { AccessPage(*TaskTable[index]); } index = (index + 1) % TaskTable.count(); cin.get(); } return a.exec(); } |
posted on 2020-12-30 09:48 lh03061238 阅读(86) 评论(0) 编辑 收藏 举报
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列:如何用heaptrack跟踪.NET程序的非托管内存泄露
· 开发者必知的日志记录最佳实践
· SQL Server 2025 AI相关能力初探
· winform 绘制太阳,地球,月球 运作规律
· AI与.NET技术实操系列(五):向量存储与相似性搜索在 .NET 中的实现
· 超详细:普通电脑也行Windows部署deepseek R1训练数据并当服务器共享给他人
· 【硬核科普】Trae如何「偷看」你的代码?零基础破解AI编程运行原理
· 上周热点回顾(3.3-3.9)