搜索资源列表
哲学家进餐问题
- linux进程间通信,父进程,子进程的创建-inter-process communication, parent process, the process of creating son
银行家算法解决死锁
- 应用银行家算法解决死锁问写的银行家算法,只能实现固定进程和资源的操作,不过要是应付作业什么的没有问题,绝对可以运行 -application bankers algorithm to solve the deadlock was asked bankers algorithm, the process can only be fixed and operational resources, but what if the deal with no operational problems and
银行家算法
- 不加控制的程序并发执行很容易导致进程间发生死锁,因此现代操作系统设计的一个重要内容就是追求在付出代价较小的前提下,消除系统中的死锁现象。目前解决死锁的方法很多,使用银行家算法来控制资源分配,预防死锁发生,是其中较好的一种途径。本实验的目的是通过编程实现银行家算法,加深实验者对算法的理解。
银行家算法java版源代码
- 实现进程的调度和分配,并能检测进程的安全性,代码调试无误,界面可以自行修改。
编程实现生产者消费者或读写者的同步问题
- 编程实现生产者消费者或读写者的同步问题 编程实现生产者消费者或读写者的同步问题,目标掌握信号量实现进程同步及其应用-Programming producers or consumers who read and write the synchronization programming producers, consumers or those who read and write synchronization problem, the target volume to achieve
EPROCESS
- 基于EPROCESS结构中双向链表的进程检测方法-EPROCESS structure based on two-way linked list in the process of detection methods
GDFQ
- 固定分区模拟,按"回车"可以随机加入进程,对未获资源的进程自动排序,等待调度-Fixed partition simulation, press the Enter can be random to join the process has not been the resources of the process of automatic sorting, awaiting scheduling
jincheng
- 支持多道进程并发的简单管理模拟系统-Support for multi-channel process complicated by the simple management simulation system
打印
- 用c++编的进程调度算法-With c++ Made the process of scheduling algorithm
sourcecode
- 以上一共五个在VC环境下编写的程序,分别为串的基本操作,哈夫曼编译码系统,简单词法分析器,进程转换模拟控制,最短路径搜索算法。为节省上传时间,只有源代码,工程文件都删除了,但是上述源码都在本机上编译通过,并且能够正确运行。谢谢!-More than a total of five in the VC environment prepared by the procedure, namely the basic string operations, Huffman encoding and dec
yinhangjiasuanfa
- 利用银行家算法实现资源分配。当某个进程提出资源请求是,假定先分配给它,然后查找个进程的请求,检查系统剩余资源是否由于分配而导致思死锁。若是则该进程等待;否则,为其进程所需资源。-Bankers algorithm using the allocation of resources. When a request is put forward the process, it is assumed that first be allocated to it, and then find a proc
UNIX_Network_Programming_Volumn2
- UNIX网络编程第2卷 进程间通信。学习Linux很好的书籍-UNIX Network Programming Volume 2 Interprocess communication. Good books to learn Linux
jinchengdiaodu
- 可以实现进程调度的模拟算法,用很简单的程序在整体上体现进程调度的总过程。-Can achieve the process of scheduling the simulation algorithm, using a very simple procedure embodied in the overall process of the overall process of scheduling.
yinhangjiasuanfa
- 银行家算法,避免进程死锁-Bankers algorithm avoid deadlock process
Producer
- 程序实现了两个生产者和两个消费者的生产者消费者问题(当生产者消费者数目再多时加上几个子进程就可以了)为了防止程序陷入死循环,给生产者限定了生产次数,同时为了方便截图,将次数限定的比较少。下面是我的程序:-Procedures to achieve the two producers and two consumers and producers of consumer issues (when the number of producers of consumers to add a few m
yhj
- 设计一个n 个并发进程共享m 个系统资源的系统。进程可动态申请资源和释放资源,系统按各进程的申请动态的分配资源。要求采用银行家算法实现。-N the design of a concurrent process of system resources m sharing system. Process can be dynamic application of resources and the release of resources, the system according to proc
caozuoxitong
- 有两个程序,进程调度和银行家算法,很是实用的,-There are two procedures, the process of scheduling and banker s algorithm, it is practical,
MPI_ALL_TO_ALL.c
- MPI_ALLTOALL是组内进程之间完全的消息交换其中每一个进程都相其它所有的进 程发送消息同时每一个进程都从其它所有的进程接收消息-Group MPI_ALLTOALL is the process of message exchange between the complete process of each phase of the process of sending all the other news at the same time each process from all
os3
- 设系统有4个CPU并行处理提交(创建)的作业(进程)。作业(进程)的提交(创建)时刻从0开始计时,每隔一时间间隔(随机数)提交(创建)一作业(进程),作业(进程)运行需要的CPU时间也是一个随机数。每个CPU上有一就绪队列,提交(创建)的作业(进程)总是卦到长度最短的就绪队列上。试编一模拟程序统计一个工作日(8小时)内,作业(进程)的平均周转时间和系统的吞吐量(处理的作业(进程)数)。 -Based system has 4 CPU parallel processing to submit
yinhangjia
- 实现死锁避免算法——银行家算法 1、程序运行开始时,资源全部可用。资源种类约10种,每种资源数目为1~10。 2、不断随机产生或手工输入新的“进程资源需求向量”,并填写到最大需求矩阵。 3、在各进程的最大需求数量范围内(因此需作是否超出范围的检验),为各进程随机生成或手工输入资源请求。经银行家算法后输出系统是否安全的信息。当一个进程的资源请求全部发完后,认为它结束 -Deadlock Avoidance Algorithm implementation- one ba