可用的s3c2440 bsp包,付有使用说明等文档!

银行家算法,还不错。有好的请与我联系！-bankers algorithm, is not bad. Good please contact me!

1.实验目的： 模拟实现银行家算法，用银行家算法实现资源分配。 2.实验内容： 设计五个进程{P0，P1，P2，P3，P4}共享三类资源{A，B，C}的系统，{A，B，C}的资源数量分别为10，5，7。进程可动态地申请资源和释放资源，系统按各进程的申请动态地分配资源。要求程序具有显示和打印各进程的某一时刻的资源分配表和安全序列；显示和打印各进程依次要求申请的资源号以及为某进程分配资源后的有关资源数据。 3．程序设计和说明： 函数说明：anquan( )判断给某个进程请求后系统是否安全，anquan1（）判断当前系统是否安全。GetAll（）取得所有进程的的各个资源数据。详细说明请参见附录中的程序的文档说明。-1. The experiment : Simulation Algorithm bankers, bankers algorithm with the allocation of resources. 2. Experiment : Design 5 (process P0, P1, P2, P3, P4) (resource sharing three categories A, B, C), (A, B, C) amount of resources to 10,5,7. Dynamic process could apply to the resources and the release of resources, according to the system processes the application to dynamically allocate resources. Procedures required to display and print the process of a moment of the distribution of resources and safety sequence; Display and print the process followed for seeking resources, as well as a process of distribution of resources in the resource data. 3. Program design and description : F

设计一个有N个进程并发的进程调度程序。 进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）算法。 -Design of a concurrent process, N a process scheduler. The process of scheduling algorithm: The number of priority the highest priority scheduling algorithm (ie the number of processors allocated to the highest priority to the process) algorithm.

Microsoft早期操作系统1[1].0-3.0全系列收藏版-Microsoft early one operating system [1] .0-3.0 full range of collectors edition

The kernel compiled with C

开发图书借阅管理系统的必要原代码，希望对大家有所帮助-Book Lending Management

这个是我操作系统的小作业实现的是文件系统，可以进行文件增加删减等操作-This is my job to achieve a small operating system is the file system that can delete files and other operations to increase

C_进程调度.rar-9 scheduling process. Rar

mutil cpu code 多核编程资料-mutil cpu code multi-core programming information

关于银行家算法的操作系统课程设计，包括实验目的、运行结果等-Banker