multithreading on the issue.

演示了如何让程序仅仅只能运行一个进程，如果程序已经运行，再点exe就会激活原来已经运行的那个进程。-demonstration of how the procedure can only run one process, if the procedures are already running, then points exe will activate the original operation of that process.

写日志的代码，很不错啊，大家可以自由下在-log write code, and it is very responds : Members are free under the

Give Your .NET-based Application a Fast and Responsive UI with Multiple Threads

共享内存多进程通讯例子-the demo of shared memory multi-process communication

经典进程同步和互斥另类WINDOWS解法.定义信号量机制在WINDOWS下完成哲学家进餐问题.-classical process synchronization and mutex WINDOWS alternative solution. Volume definition signal mechanism in Windows complete the dining philosophers problem.

program VirtualMemory {$APPTYPE CONSOLE} uses SysUtils, Windows const PageSize = 4096 //定义页面大小 var VmAddress, CommitAddress: Pointer //存放虚拟内存基址 Text: Pchar begin //保留二页虚拟内存 VmAddress := VirtualAlloc(nil, PageSize * 2, MEM_RESERVE, PAGE_READWRITE) if not Assigned(VmAddress) then begin WriteLn( 保留虚拟内存失败! ) ExitProcess(0) end else WriteLn(Format( 保留虚拟内存成功, 基址为:[%8.8x]! , [Longint(VmAddress)])) //提交第二页虚拟内存 CommitAddress := Pointer(Longint(VmAddress) + PageSize) CommitAddress := VirtualAlloc(CommitAddress, PageSize, MEM_COMMIT, PAGE_READWRITE) if not Assigne-program VirtualMemory ($ APPTYPE CONSOLE) uses SysUtils, Windows const PageSize = 4096// definition pages size var VmAddress, CommitAddress : Pointer// virtual memory-based storage site Text : Pchar begin// reservations two virtual memory VmAddress : = VirtualAlloc (nil. PageSize* 2, MEM_RESERVE, PAGE_READWRITE) if not Assigned (VmAddress) then begin WriteLn (reservations virtual memory failure!) ExitProcess (0) end else WriteLn (Format

delphi的任务管理-task management of delpi

基于三级反馈队列调度算法的UNIX进程管理程序模拟-Feedback queue scheduling algorithm based on three of the UNIX process management program to simulate

操作系统中银行家算法的演示程序，银行家算法是避免死锁的方法，避免死锁的法则是，系统在运行过程中，对于进程的每一种资源请求都要根据预掌握的资源使用信息，按照一定的算法，进行是否可能导致死锁的预测，以决定是否同意这一资源请求。这是向前看几步，知道保证不会导致死锁时再向前走一步的具有动态性质的预测算法。-operating system bankers algorithm Demonstration Program, bankers algorithm is a method to avoid deadlock and avoid deadlock the law is, the system in the process, the process for each type of resource in accordance with the request of the resources available to advance the use of information, according to some algorithm, leading to the possibility of death lock projections to decide whether the resource requests. This is a forward-looking steps, guaranteed not know Deadlock lead again when forward step with the dynamic nature of the forecast algorithm.

进程间通讯的四种方式：剪贴板、匿名管道、命名管道和邮槽。并比较分析这几种进程间通信的优点和缺点。-Inter-process communication of four ways: clipboard, anonymous pipes, named pipes and mail slots. And comparative analysis of these types of inter-process communication of the advantages and disadvantages.