说明： 模拟操作系统进程调度(先来先服务，优先级优先，相应比优先，最短作业优先），资源抢夺，内存分配功能（动态分区，静态分区）（最坏适应法，最佳适应法，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)
该代码为基于MATLAB编制的锂离子电池伪二维模型(This code is a pseudo two-dimensional model of lithium ion battery based on MATLAB.)
说明： 该代码为基于MATLAB编制的锂离子电池伪二维模型(This code is a pseudo two-dimensional model of lithium ion battery based on MATLAB.)
说明： 运用机器学习中的半监督核极限学习机模型，可以实现故障分类，例如气动调节阀故障(Using the semi-supervised nuclear extreme learning machine model in machine learning, fault classification can be achieved, such as pneumatic valve failure)
操作系统概念 下册，是一本操作系统学习的推荐入门书籍，讲解详细有条理(Operating System Concepts Volume II is a recommended introductory book for operating system learning, with detailed and organized explanations.)
说明： 操作系统概念 下册，是一本操作系统学习的推荐入门书籍，讲解详细有条理(Operating System Concepts Volume II is a recommended introductory book for operating system learning, with detailed and organized explanations.)
12路交流，24路开关，4路温度等直流测控。主机板的印制板图(12-way AC, 24-way switch, 4-way temperature DC measurement and control. Printed Board Drawing of Main Board)
说明： 12路交流，24路开关，4路温度等直流测控。主机板的印制板图(12-way AC, 24-way switch, 4-way temperature DC measurement and control. Printed Board Drawing of Main Board)
简单文件系统，实现一些基本操作，如创建文件、打开、关闭、读、写(Simple file system, to achieve some basic operations, such as creating files, opening, closing, reading and writing)
页式虚拟存储器的页面置换算法一般有： 最佳置换算法（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)
本站资源：696524 个
本站会员：103838 个
总计下载：487570 次
今日上传：0 个
Copyright© 2019-2024 |
Powered by Imdn
|
浙ICP备16007336号
|
|
联系客服（QQ：3324461878）
本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！
