-
hpa48
HPA就是host protect area(HPA is the host protect area)
- 2007-09-17 09:10:12下载
- 积分：1
-
Cpp1
模拟操作系统进程调度：运行状态，就绪状态和完成状态。包含有first() prisch() insert1(q) creat(gg) prish() roundsch() 函数的引用。(Simulate the operating system process scheduling: running, ready states, and completion status. Contains the first () prisch () insert1 (q) creat (gg) prish () roundsch () function reference.)
- 2011-11-19 08:13:15下载
- 积分：1
-
avoid-deadlock
操作系统实验-死锁避免算法，word文档，详细，全，可执行，自己写的，希望快点能在贵网站下载。。。(Operating System Experiment- Deadlock avoidance algorithm, word documents, detailed, full, enforceable, wrote it myself, hope quickly in your website. . .)
- 2013-10-28 19:05:59下载
- 积分：1
-
模拟进程调度
模拟操作系统进程调度的算法采用时间片轮转法和优先权法(operating system simulation process scheduling algorithm-time Web-law and law priority)
- 2005-05-15 19:51:27下载
- 积分：1
-
a.c
dos 工具 用老版本的gcc编译，否则会出错(dos tools with older versions of THING)
- 2016-07-11 08:01:26下载
- 积分：1
-
writerandreader
计科操作系统课程“读者写者”问题的经典解决。(Branch of the operating system programs, " wrote the reader" as a problem to solve classic.)
- 2009-05-13 15:29:02下载
- 积分：1
-
MyProcess
MFC实现的，界面有好，实现了进程调度的算法
能够模拟操作系统的进程调度 适合初学者(MFC implementation, the interface is good, a process scheduling algorithm to achieve
To simulate the operating system process scheduling for beginners)
- 2011-12-02 11:30:08下载
- 积分：1
-
ddos
非常强大的DDOS嘎嘎，速度下载把，版权帝们，(Very strong DDOS quack)
- 2014-01-30 19:18:33下载
- 积分：1
-
33
说明： 作业调度——先来先服务，最短作业优先，最高响应比优先(Job scheduling- a first-come first-served, shortest job first, highest priority response ratio)
- 2011-07-01 19:41:37下载
- 积分：1
-
EOSApp
1）设计一程序，由一个进程创建三个子进程，三个子进程一个是生产者进程，两个是消费者进程。
2）父子进程都使用父进程创建的共享存储区进行通信，由生产者进程将一个数组中的十个数值发送到由5个缓冲区组成的共享内存中。?
3）两个消费者进程轮流接收并输出这十个数值，同时将两个消费者进程读出的数值进行累加求各和。
4）考虑生产者进程生产的速度和消费者进程速度。(1) a program is designed to create three sub processes from one process, three sub processes is the producer process, and the two is the consumer process.
2) the father child process communicates with the shared storage area created by the parent process, and sends ten values in one array to the shared memory composed of 5 buffers by the producer process. L
3) the two consumer processes take turns to receive and output the ten values, and add values to each of the two consumer processes.
4) take into account the production speed of the producer process and the speed of the consumer process.)
- 2020-12-23 09:19:08下载
- 积分：1
