搜索资源列表
DeadLockDetection
- Java实现deadlock detection algorithm-Java deadlock detection algorithm
操作系统——动态优先级调度算法源代码
- 操作系统——动态优先级调度算法源代码，多道系统中多进程并发执行，为了提高系统性能解决进程死锁问题，进程的优先级是动态变化的。正在执行的进程优先级会随时间降低，而挂起的进程或等待的进程的优先级会逐渐升高，这样就解决了操作系统中一个地优先级程序长期占据cpu，而高优先级进程却迟迟不能得到处理。-operating system -- Dynamic priority scheduling algorithm source code, multi-channel system more complic
bankari
- 银行家算法是避免死锁的一种方法，输入某时刻各个进程的相关信息，包括资源的最大需求量，已经分配的资源数，还需要的资源数以及系统可利用资源数，然后判断该序列是否安全，再模拟某个进程向系统提出资源申请，判断是否可以给该进程分配资源。 -bankers avoid deadlock algorithm is a method of importation of a certain moment all process-related information, including the greate
lunch
- 哲学家进餐问题 在多线程中如何避免死锁。 问题描述：有五位哲学家围绕着餐桌坐，每一位哲学家要么思考 要么等待，要么吃饭。为了吃饭，哲学家必须拿起两双筷子（分 别放于左右两端）不幸的是，筷子的数量和哲学家相等，所以每 只筷子必须由两位哲学家共享-dining philosophers problem in multithreaded how to avoid deadlock. Problem descr iption : five philosophers sittin
vc_semaphore
- 自己写的。用信号量机制来解决哲学家问题中的死锁。附有详细注解。-wrote it myself. Using signal volume philosopher mechanism to solve the problem of deadlock. Accompanied by a detailed explanation.
zy19810412
- 在计算机操作系统中，最有代表的避免死锁的算法，是Dijkstra银行家算法。这是由于该算法能用于银行系统现金贷款的发放而得名的。为了加深对该算法的认识和掌握，进而在计算机上实现。为了实现银行家算法，系统中必须设置若干数据结构。-in computer operating systems, and most representative of the deadlock avoidance algorithm is Dijkstra algorithm bankers. This is becaus
aefa334231
- 模拟银行家算法，检测死锁。当用户申请一组资源时，系统必须确定这些资源的分配是否仍会使系统处于安全状态。如果会，就可分配资源；否则，进程必须等待直到某个其他进程释放足够资源为止。-Analog banker s algorithm to detect deadlock. When users apply a set of resources, the system must determine whether the allocation of these resources is still c
DeadLock
- 死锁检测工具，《计算机操作系统》课程设计，源代码+演示程序-Deadlock Detection Tool,
MultiCoreProgramming
- Intel的双核CPU编程的说明书，全英文，底层开发-Intel' s dual-core CPU programming instructions, all in English, the underlying development
Philosopher
- 关于操作系统哲学家进餐的动态演示程序，清晰的分析了死锁发生的情形和修正死锁。-Dining philosophers about the operating system dynamic presentation procedures, a clear analysis of the deadlock situation occurred and amendments to deadlock.
OS_project_Thread
- Purpose Aim to setup a small system above the OS layer , implement the message queue of process or thread and simulate the function of watchdog used to detect the deadlock of the system. - introduction 1. Purpose Aim to setup a s
Banker_ResAllot
- 避免死锁的银行家算法模拟算法（书籍源码）-Bankers algorithm avoid deadlock of the simulation algorithm (book source)
Banker_ResAllot1
- 避免进程运行死锁的银行家模拟算法（源码）-Avoid the deadlock of the bankers run the process simulation algorithm (source)
include1
- 因为有多个缓冲区，所以生产者线程没有必要在生成新的数据之前等待最后一个数据被消费者线程处理完毕。同样，消费者线程并不一定每次只能处理一个数据。在多缓冲区机制下，线程之间不必互相等待形成死锁，因而提高了效率。 -Because there are a number of the buffer zone, so there is no need for the producer thread to generate new data on waiting until the last thre
OSdeadlock
- Deadlock and how to solve it with mutex a client request bank command like DEPOSIT CREATE TRANSFER WITHDRAW and 4 server server 1 simple server. server 2 shows wrong answer an withdraw(2 terminal - 2 threads) server 3 solve 2 server 4 sol
phenosophy
- 本程序是在Linux下面 实现了哲学家就餐问题。其中演示了会发生死锁和不会发生死锁的情况。-This program is implemented in the Linux following the Dining Philosophers Problem. Which demonstrates the deadlock and does not happen will happen deadlock situation.
ssjcxc
- 死锁，进程和线程的实验报告，都是在red hat 9下实际运行过可行的代码，这份是完成以后写的实验报告，里面还有截图-Deadlock, processes and threads of the experimental report, are in the red hat 9 Next feasible code before the actual operation, this is a written test after the completion of the report, whi
linux
- Linux下的编程 本人课程设计 全部能运行 包括：合并排序.cpp 进程管理.cpp 进程控制实验.c 内存管理.cpp 生产者和消费者.c 死锁实验.c 线程实验.c-Programming under Linux I can run all the curriculum include: Merge sort. Cpp process management. Cpp process control experiment. C memory management. Cpp producers
banker
- 共享资源分配与银行家算法 [问题描述] 本题主要内容是模拟实现资源分配。银行家算法是避免死锁的一种重要方法，本实验要求用高级语言编写和调试一个简单的银行家算法程序。加深了解有关资源申请、避免死锁等概念，并体会和了解死锁和避免死锁的具体实施方法。 通过对这个算法的设计,让学生能够对书本知识有更深的理解,在操作和其它方面有更高的提升。 -Share resource allocation algorithm with bankers [Problem Descr iption] T
DeadLock
- c语言写的关于死锁的预防的小程序，适合初学者。-c language written on the deadlock prevention program for beginners.