操作系统
谭光志
FE/Nodejs/Rust 全栈
Github: https://github.com/woai3c
展开
-
MIT6.828 实验环境安装教程
前期准备安装工具包sudo apt-get install -y build-essential libtool libglib2.0-dev libpixman-1-dev zlib1g-dev git libfdt-dev gcc-multilib gdb gcc-multilib克隆代码和QEMU// 代码git clone https://pdos.csail.mit.edu/...原创 2020-01-23 14:41:11 · 1524 阅读 · 3 评论 -
先来先服务(FCFS)作业调度算法(C)
#include<stdio.h>#include<stdlib.h>int main() { int n; int *waitTimes, *runtimes; printf("Enter the number of processes you want to create: "); scanf("%d", &n); ...原创 2019-03-22 15:52:52 · 6158 阅读 · 1 评论 -
最短作业优先(SJF)作业调度算法(C)
#include<stdio.h>#include<stdlib.h>void main() { int n; int *waitTimes, *runtimes, *p; printf("Enter the number of processes you want to create: "); scanf("%d", &n);...原创 2019-03-22 15:54:17 · 2490 阅读 · 0 评论 -
先进先出(FIFO)虚拟存储管理页面淘汰算法(C)
#include<stdio.h>#include<string.h>#include<stdlib.h>int indexOf(char *s, char c, int len) { for (int i = 0; i < len; i++) { if (s[i] == c) { return i;...原创 2019-03-22 16:10:22 · 2062 阅读 · 0 评论 -
最近最少用(LRU)虚拟存储管理页面淘汰算法(C)
#include <stdio.h> #include <stdlib.h>#include <string.h>int pageMissingNum = 0;typedef struct Node { struct Node *pre, *next; int pageNumber; } Node;typedef struct ...原创 2019-03-28 11:37:54 · 1195 阅读 · 0 评论 -
理想型算法(OPT)虚拟存储管理页面淘汰算法(C)
#include<stdio.h>#include<string.h>#include<stdlib.h>int indexOf(char* s, char c, int len, int i) { for (; i < len; i++) { if (s[i] == c) { return i; ...原创 2019-03-28 11:39:43 · 2171 阅读 · 0 评论