Description: 多线程管理系统，可用于售票服务和排队服务的优先级等等，java实现-multithreading management system can be used for ticketing services and the priority queue levels, and so on, to achieve java Platform: |
Size: 3904 |
Author:王先生 |
Hits:
Description: 操作系统中的进程调度，进程调度模拟程序：假设有10个进程需要在CPU上执行，分别用：先进先出调度算法；基于优先数的调度算法；最短执行时间调度算法
确定这10个进程在CPU上的执行过程。要求每次进程调度时在屏幕上显示：当前执行进程；就绪队列；等待队列
-operating system process scheduling, process simulation scheduling procedures : Assuming a 10 CPU in the process of implementation, respectively : FIFO-scheduling algorithm; Based on the number of priority scheduling algorithm; shortest execution time scheduling algorithm to determine which 10 of the CPU the process of the implementation process. Scheduling requires every process when displayed on the screen : the current implementation process; Ready queue; Waiting for the queue Platform: |
Size: 104448 |
Author:魏然 |
Hits:
Description: 多线程管理系统，可用于售票服务和排队服务的优先级等等，java实现-multithreading management system can be used for ticketing services and the priority queue levels, and so on, to achieve java Platform: |
Size: 4096 |
Author:王先生 |
Hits:
Description: A simple priority queue, array priority queue, and a binary heap. Used for implementation with databases written in java. Platform: |
Size: 4096 |
Author:ptf4u07 |
Hits:
Description: java进程调度，处理机调度算法的实现
1． 设定系统中有五个进程，每一个进程用一个进程控制块表示。
2． 输入每个进程的“优先数”和“要求运行时间”，
3． 为了调度方便，将五个进程按给定的优先数从大到小连成就绪队列。用一单元指出队列首进程，用指针指出队列的连接情况。
4． 处理机调度总是选队首进程运行。采用动态优先数算法，进程每运行一次优先数就减“1”，同时将运行时间减“1”。
5． 若要求运行时间为零，则将其状态置为“结束”,且退出队列。
6． 运行所设计程序，显示或打印逐次被选中进程的进程名以及进程控制块的动态变化过程。
-java process scheduling, processor scheduling algorithm. Set system of five processes, each process with a process control block, said. Two. " Priority number" input of each process and the requirements of running time, 3. For scheduling convenience, the five process given the number of priority beginning with the largest connected into the ready queue. With a unit pointed out that the head of the queue process, the pointer pointed out that the connection queue. 4. Processor scheduling is always the first process of the election team run. Using the dynamic priority algorithm, the process each time you run priority number minus " 1" , run time minus " 1" . 5 Require run-time is zero, it is state set to " end" , and exit the queue. 6. Run the design process, display or print the process of successive selected process name and process control block dynamic process. Platform: |
Size: 6144 |
Author:张忠晔 |
Hits:
Description: 通过Java实现索引优先最小队列并附带algs4包，他是一个很有用的例子(Through the Java implementation of the index priority minimum queue with algs4 package, he is a very useful example) Platform: |
Size: 545792 |
Author:方式方法
|
Hits:
Description: 通过Java实现索引优先最小大队列并附带algs4包，他是一个很有用的例子(Through the Java implementation of the index priority maxmum queue with algs4 package, he is a very useful example) Platform: |
Size: 545792 |
Author:方式方法
|
Hits:
Search - priority queue java