搜索资源列表
homework3
- 离散事件系统仿真程序CPU_scheduler说明： 1.仿真功能与要求： 1.1 单CPU系统，系统有10个终端输入任务，如果一个任务的执行时间大于规定的时间片，则该任务执行一个时间片之后退出CPU，并重新参加排队，直到执行完退出CPU，然后才允许相应终端重新输入一个新的作业。任务排队的原则是在CPU中执行次数越少的越排在前面，如果两个任务执行的次数相同，按照FIFO原则排队。 1.2 每个终端输入任务的时间满足均值为25秒的指数分布。每个任务需要CPU执行的时间满足均值
算法代码
- FIFO+LUR算法演示系统，是老师对学生进行算法教学的一个演示课件-FIFO LUR algorithm demonstration system is the teacher to student teaching in an algorithm demonstration courseware
necipceylan--OS-HW
- basic operating system with using FIFO algorithms
a2
- Implementation a simple FIFO queue using arrays. Write a programs that will ask the user for the size of the queue. Then it will start reading characters from the keyboard and store them in the queue. If the user enters an empty line then the progr
a3
- Implementation a simple FIFO queue using linked lists. Write a programs that will ask the user for the size of the queue. Then it will start reading characters from the keyboard and store them in the queue. If the user enters an empty line then the
fifo
- visual studio 2008 开发的 C语言 FIFO 算法-calculation of fifo
fifo
- SSD optional 3 IS VERY USEFUL FOR ALL STUDENTS BLA BLA BLA
fft16k_32k
- 基于并行的FIFO的16K和32K的FFT设计-The FIFO-based parallel FFT design 16K and 32K
source-(1)
- FIFO Algorithm Source Code
paging
- * 1- randomly the no. of page (n) * 2- create a random squnce of n pages * 3- FIFO page Replacement algorithm * 4- optimal page Replacement algorithm- * 1- randomly the no. of page (n) * 2- create a random squnce of n pages * 3- FIFO