▍1. OSDemo
操作系统实验演示代码(三个实验,作业管理,内存管理,文件管理)(Experimental demonstration of the operating system code (three experiments, operations management, memory management, document management))
操作系统实验演示代码(三个实验,作业管理,内存管理,文件管理)(Experimental demonstration of the operating system code (three experiments, operations management, memory management, document management))
操作系统设计与实现源码(Design and Implementation of the operating system source code)
说明: 基于c++的简易银行家算法。。。。....(A simple banker algorithm based on C + +....)
操作系统提供一系列服务: 多任务、用户界面、内存管理、内存保护、 文件存取、网络、设备控制、硬件控制 、错误检测及恢复系统、安全(The operating system provides a range of services: Multitasking, user interface, memory management, memory protection, File access, network, device control, hardware control, error detection and recovery systems, security)
说明: 操作系统提供一系列服务: 多任务、用户界面、内存管理、内存保护、 文件存取、网络、设备控制、硬件控制 、错误检测及恢复系统、安全(The operating system provides a range of services: Multitasking, user interface, memory management, memory protection, File access, network, device control, hardware control, error detection and recovery systems, security)
stm32f103rct6步进电机 基于freeRTOS 掉电存储(stm32f103rct6 stepper based freeRTOS)
说明: stm32f103rct6步进电机 基于freeRTOS 掉电存储(stm32f103rct6 stepper based freeRTOS)
说明: 提供官方开源的uCOS-III嵌入式实时操作系统源程序,可用于嵌入式操作系统的二次开发。(Provides the official open source ucos-iii embedded real-time operating system source program, can be used for embedded operating system secondary development.)
说明: 模拟操作系统进程调度(先来先服务,优先级优先,相应比优先,最短作业优先),资源抢夺,内存分配功能(动态分区,静态分区)(最坏适应法,最佳适应法,FIFO)(Simulation operating system process scheduling (first come first serve, priority first, corresponding ratio first, shortest job first), resource grabbing, memory allocation function (dynamic partition, static partition) (worst adaptation, best adaptation, FIFO))
说明: 了解动态分区分配方式中的数据结构和分配算法,并进一步加深对动态分区存储管理方式及其实现过程的理解(Understand the data structure and allocation algorithm in the dynamic partition allocation mode, and further deepen the understanding of the dynamic partition storage management mode and its implementation process)
页式虚拟存储器的页面置换算法一般有: 最佳置换算法(OPT),先进先出置换算法(FIFO),最近最久未使用置换算法(LRU),Clock置换算法,最少使用置换算法(LFU),页面缓存算法(PBA)等。 先进先出(FIFO)置换算法是最直观的置换算法,由于它可能是性能最差的算法,故实际应用极少。在这里我只使用前面三种算法来进行页面调度(Page replacement algorithms for page virtual memory generally include the best permutation algorithm (OPT), advanced first out permutation (FIFO), the most recent unused replacement algorithm (LRU), Clock permutation algorithm, minimum use of permutation (LFU), and page caching algorithm (PBA). The first in first out (FIFO) replacement algorithm is the most intuitive replacement algorithm, because it may be the worst performing algorithm, so there are few practical applications. Here I only use the first three algorithms for page scheduling.)
生产者消费者问题-经典进程同步问题——生产者消费者问题及其同步方案;(produce&comsumer produce&comsumerproduce&comsumerproduce&comsumer)