搜索资源列表
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
FlowShop
- 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法,包括Flowshop和make两个类,含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data us
The-LRU-K-page-algorithm
- LRU-k是一个在LRU基础上进行提升的算法,在处理数据队列时,使用了更有效的优先级计算方法-LRU-K is a advanced algorithm based on LRU. It computes the priorities of the data items more accurately and avoid some occasional cases.
os4
- 模拟进程同步算法,包括FCFS(先到先服务),SJF(最短优先),RR(Round-Robin),优先权调度及多级队列调度-Simulation process synchronization algorithms, including FCFS (first come first serve), SJF (shortest first), RR (Round-Robin), priority scheduling and multi-level queue scheduling
HeapSort
- 最大堆的生成、堆排序,以及一个简单的最大优先队列的实现。-The largest generation heap, heap sort, as well as a simple realization of the greatest priority queue.
linkedqueue
- 用C++编写的链表实现的队列,有助于了解队列的基本工作原理,是学习数据结构的必做题目。-Linked list implementation C++ write queue, helps to understand the basic working principle of the queue, is the study of data structures must be done subject.
telnet
- linux开启服务端以后,允许客户端通过tcp/ip连接,通过消息队列通信-linux server after opening, allowing the client through tcp/ip connection, communication through message queues
linuxIPC
- Linux 进程间通信实例包括:共享内存、管道、套接字域、消息队列、信号、信号灯;注释详细,全部经过编译验证-Examples include the Linux inter-process communication: shared memory, pipe, socket domain, message queues, signals, lights comment in detail, all compiled authentication
Micrium-uCOS-II-V286
- uCos II 2.86 源代码,尽包含内核部分(调度器、时间函数、任务管理、信号量、事件标志组、邮箱、消息队列、内存管理)-uCos II 2.86 source code
msgQueueClass
- 一个多线程安全的消息队列类的实现,依赖于STL库-realization of message queue class in multi-thread enviroment
bao
- 多级反馈队列进程调度算法 1. 实验目的: 用高级语言编写和调试一个进程调度程序,以加深对进程的概念及进程调度算法的理解。 2. 实验内容: 编写一个模拟程序,完成单处理机系统中的进程调度,采用多级反馈队列的时间片轮转调度算法. 实验具体包括:首先确定进程控制块的内容,进程控制块的组成方式,确定相关参数(如进程数、到达时间、服务时间、时间片大小等) 然后完成进程创建原语、进程调度原语和进程撤销原语 最后编写主函数,上机实验并取得结果数据。 -The process of
STL_quene
- 用c++的STL实现大根堆和小根堆,实现相当方便简单,优先队列效率好-Large root heap and small root heap, quite simple priority queue efficiency c++ the STL
work_queue
- Linux工作队列的驱动事例程序,非常有助于初学者学习-Linux drivers work queue examples of procedures, very useful for beginners to learn
queuing
- M/M/c排队模型的MATLAB仿真程序,顾客到达和服务时间服从指数分布,有c个窗口。包含排成一个队列;随机排成c个队列;自动选择c个队列中最短队列排队三种排队方式的仿真-M/M/c queuing model of the MATLAB simulation program, the customer arrival and service time is exponentially distributed, there is c windows
Linux-IPC.tar
- 资源中包含了Linux进程间通信的例子,同时有源文件和可执行文件。 源码主要包含了Linux下IPC机制的本地进程通信方式,包含了IPC共享内存,IPC信号量,IPC消息队列的实现,以及Linux下判断进程退出原因的示例程序。因为是做毕设学习时的练习程序,因此程序有详细的注释。(注意,每种通信方式需要在同时两个终端中查看验证,才可以看出效果,注意查看源码注释)-the source code included in the copressed package shows how IPC wo
STM32Pdma
- STM32串口驱动(环形队列+内存动态分配+DMA+拼音检索)-STM32 serial driver (annular queue+ memory the dynamic allocation+DMA+ Pinyin retrieve)
ds_2
- 1.定义顺序栈的数据结构 2.编写函数实现的栈的初始化、入栈、出栈、判断栈是否为空的算法,并应用与表达式的括号匹配检测。 3.定义队列的链式数据结构 4.编写函数实现链队列的入队列、出队列算法-1. Stack data structure defines the order of 2. Write a function to achieve the initialization of the stack, stack, out of the stack, to determine
TDJB
- 1)自选存储结构,输入含n个顶点(用字符表示顶点)和e 条边的图G; (2)求每个顶点的度,输出结果; (3)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS 顶点序列(提示:使用一个栈实现DFS); (4)指定任意顶点x为初始顶点,对图G作BFS遍历,输出BFS 顶点序列(提示:使用一个队列实现BFS); (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及 与之相关连的边,并作DFS遍历(执行操作3);否则输出信 息“无x”;
The-program-of-data-structure
- 数据结构的例子程序,包含循环队列、链表队列、线性链表、静态链表、堆栈等的实现。-Examples of program data structures, including circular queue, linked list queue, linked list, static list, stack, etc. to achieve.
FIRST2
- 编写并调试一个模拟的进程调度程序,采用“轮转法”调度算法对五个进程进行调度。 轮转法可以是简单轮转法、可变时间片轮转法,或多队列轮转法。 -Write and debug a simulation of the process scheduling program, a "Round-Robin" scheduling algorithm for scheduling the five process. Round-Robin Round-Robin method can be