[操作系统开发] 计算机操作系统实验三
进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。 每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。 进程的优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为进程输入的时间。进程的运行时间以时间片为单位进行计算。每个进程的状态可以是就绪 W（Wait）、运行R（Run）、或完成F（Finish）三种状态之一。就绪进程获得 CPU后都只能运行一个时间片。用已占用CPU时间加1来表示。 每进行一次调度程序都打印一次运行进程、就绪队列、以及各个进程的 PCB，以便进行检查。
Process scheduling algorithm: the highest priority number of priority scheduling algorithm (that is, the processor is assigned to the highest priority process) and first come first service algorithm. Each process has a process control block (PCB) representation. Process control blocks can contain the following information: process name, priority number, arrival time, run time, CPU time, process status, and so on. The priority number of the process and the required run time can be specified artificially (or by random numbers). The process's arrival time is the process's input time. The running time of a process is calculated as a time slice. The state of each process can be one of the three states of ready W (Wait), running R (Run), or completion of F (Finish). Once the ready process gets CPU, it can only run one time slice. Represented by taking CPU time plus 1. Each time the scheduler prints a run, a ready queue, and the PCB of each process for inspection. (2017-11-09, Visual C++, 233KB, 下载1次)
[操作系统开发] 进程调度
进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。
每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。
进程的优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为进程输入的时间。进程的运行时间以时间片为单位进行计算。每个进程的状态可以是就绪 W（Wait）、运行R（Run）、或完成F（Finish）三种状态之一。就绪进程获得 CPU后都只能运行一个时间片。用已占用CPU时间加1来表示。
每进行一次调度程序都打印一次运行进程、就绪队列、以及各个进程的 PCB，以便进行检查。
Process scheduling algorithm: the highest priority number of priority scheduling algorithm (that is, the processor is assigned to the highest priority process) and first come first service algorithm.
Each process has a process control block (PCB) representation. Process control blocks can contain the following information: process name, priority number, arrival time, run time, CPU time, process status, and so on.
The priority number of the process and the required run time can be specified artificially (or by random numbers). The process's arrival time is the process's input time. The running time of a process is calculated as a time slice. The state of each process can be one of the three states of ready W (Wait), running R (Run), or completion of F (Finish). Once the ready process gets CPU, it can only run one time slice. Represented by taking CPU time plus 1.
Each time the scheduler prints a run, a ready queue, and the PCB of each process for inspection. (2017-06-03, Visual C++, 1KB, 下载2次)
[操作系统开发] Banker-Algorithm.rar
银行家算法（Banker s Algorithm）是一个避免死锁（Deadlock）的著名算法，是由艾兹格·迪杰斯特拉在1965年为T.H.E系统设计的一种避免死锁产生的算法。它以银行借贷系统的分配策略为基础，判断并保证系统的安全运行
Banker s Algorithm (2016-12-11, Visual C++, 43KB, 下载1次)
[操作系统开发] cunchu
1. 模拟操作系统的主存分配，运用可变分区的存储管理算法设计主存分配和回收程序，并不实际启动装入作业。
2. 采用最先适应法、最佳适应法、最坏适应法分配主存空间。
3. 当一个新作业要求装入主存时，必须查空闲区表，从中找出一个足够大的空闲区。若找到的空闲区大于作业需要量，这是应把它分成二部分，一部分为占用区，加一部分又成为一个空闲区。
4. 当一个作业撤离时，归还的区域如果与其他空闲区相邻，则应合并成一个较大的空闲区，登在空闲区表中。
5. 运行所设计的程序，输出有关数据结构表项的变化和内存的当前状态。
A simulated operating system s main memory allocation, the use of variable storage management algorithm design partitioning main memory allocation and recovery procedures, does not actually start loading operations.
(2) using the first method to adapt to best adapt to the law, the worst adaptation of main memory space allocation method.
3 When a new job requirements into the main memory, you must check the free zone table, to find a large enough spare area. If you find the free zone is greater than the job requirements, which is to be divided it into two parts, one for the occupied area, plus a free zone has become a part of.
4 When a job to evacuate the area if returned free zone adjacent to the other, should be merged into a larger free zone, free zone registered in the table.
5 is designed to run a program, the current state of the output data structure entries changes and memory. (2014-03-07, Visual C++, 167KB, 下载3次)
[操作系统开发] assign
在操作系统中，模拟了作业分配的过程。源代码加详细注释
In the operating system to simulate the job allocation process. Source code plus detailed notes (2013-06-18, Visual C++, 1KB, 下载2次)
[操作系统开发] The-runner-scheduling-algorithm
简单的进程调度算法，模拟OS中的进程调度过程,进程数不少于5个,进程调度算法任选,可以用动态优先数加时间片轮转法实现进程调度，每运行一个时间片优先数减3.
Simple process scheduling algorithm, and simulate the process scheduling of OS process, the process for not less than 5, optional process scheduling algorithm, can use the dynamic priority and time slice rotation scheduling method implementation process, each running a time slice priority number minus 3.
(2013-05-21, Visual C++, 6KB, 下载2次)
[操作系统开发] A-Program
这个程序演示了如何使用for循环画简单的矩形在DOS控制台。它允许用户输入新维度也。
This program demonstrates how to use the for loop draw a simple rectangle in the DOS console. It allows the user to enter a new dimension also. (2013-04-26, Visual C++, 1KB, 下载1次)
[操作系统开发] code
用C++类的概念用指针模拟高维数组
主要练习操作符的重载操作以及类的动态内存分配
The concept of C++ class pointer to simulate the dynamic memory allocation for the main practice of high-dimensional array operator overloaded operators as well as class (2012-07-22, Visual C++, 1KB, 下载3次)
[操作系统开发] Memory_allocate_and_recover
存储器的分配与回收算法实现
采用最先适应法、最佳适应法、最坏适应法分配主存空间。当一个新作业要求装入主存时，必须查空闲区表，从中找出一个足够大的空闲区。若找到的空闲区大于作业需要量，这是应把它分成二部分，一部分为占用区，加一部分又成为一个空闲区。
Memory allocation and recovery algorithm
To adapt to using the first method, the best fit method, the worst fit method to allocate main memory space. When a new operational requirements into the main memory, you must check the free area table, to find a large enough free area. If you find a spare area is greater than the job requirements, this is it should be divided into two parts, one for the occupied area, plus a part of has become a free zone. (2011-12-08, Visual C++, 3KB, 下载7次)
[操作系统开发] os3
操作系统实验，关于主存空间的分配与回收的源代码，内加实验报告。
Operating system experiments, on the main memory space allocation and recycling of source code, with added experimental report. (2011-06-28, Visual C++, 129KB, 下载6次)
[操作系统开发] os1
操作系统实验，关于进程调度的源代码与可执行文件，内加实验报告
Operating system experiments, the process of scheduling on the source code and executable files, plus lab report within (2011-06-28, Visual C++, 140KB, 下载4次)
[操作系统开发] os
操作系统实验，关于作业调度的源代码，内加实验报告
Operating system experiments, lab reports plus job scheduling code (2011-06-28, Visual C++, 356KB, 下载5次)
[操作系统开发] jinchengdiaoduFCFS
先来先服服务的作业调度算法先来先服务的额进程调度
xianlaixianfu de zuoye diaodu suanfa (2010-11-30, Visual C++, 1KB, 下载5次)
[操作系统开发] hangbanxitong
该系统需要实现以下功能：
(1) 订票：若该航次余票数大于等于客订票数，则在该航次的乘客表（按乘客姓氏字母词典顺序排列）中，
插入订票乘客的信息项，并修改该航次有关数据，否则给出相应提示信息；
(2) 退票：若退票数小于该乘客原订票数，则在相应的乘客表中找到该乘客项，修改该航次及乘客表中有关数据。
当由于退票使得该乘客的订票数为零时，要从乘客表中撤销该乘客项；否则给出相应的提示信息；
(3) 将某航次的余票数恢复初值为该航次的最大客票数；
(4) 显示：显示该机场各航次班机的售票情况。
The system needs to achieve the following functions:
(1) Booking: If the voyage than the number of votes greater than or equal passenger booking, cruise passengers in the table (by passengers alphabetical dictionary order) in
Items of information into the booking of passengers, and modify the data of the voyage, or give the appropriate message
(2) Refund: If the refund is less than the number of votes of the original passengers, passengers in the corresponding entry in the table to find the passengers, the voyage and the passengers to modify the data in the table.
When the refund makes the number of passengers booking is zero, from the passenger list of passengers in the revocation of the item otherwise give the corresponding message
(3) the recovery of a voyage of more than the initial value for votes in the largest cruise ticket number
(4): Displays of the voyage of the airport flight ticket sales. (2010-10-11, Visual C++, 7KB, 下载4次)
[操作系统开发] OS_Events_Src
提供OS 開機關機或睡眠等各項資訊的服務。
OS boot to provide various information such as shutdown or sleep services. (2009-11-12, Visual C++, 84KB, 下载3次)
[操作系统开发] dizhizhuanhua
操作系统，三位地址转化成一维，或者
一维地址转化成三维
Operating system, the three addresses into one-dimensional, or one-dimensional address into a three-dimensional (2009-10-31, Visual C++, 1KB, 下载2次)
[操作系统开发] CEExamPrepKiteBook
在本准备指南（用于 Microsoft 认证技术专家 (TS) 考试 70-571 的“Windows
Embedded CE 6.0 开发” ，发布于 2008 年五月）中，您可以发现有关 CE 操作系统、
开发工具、和概念等的很多信息。我们非常兴奋于考试 70-571 的启动。它标志着
Windows Embedded CE 成功故事的另一个重要里程碑。现在，作为第一次，嵌入式开
发人员有能力评定和展示他们基于 Windows Embedded 技术开发嵌入式解决方案的技
能，以及获得对他们的知识和进步的认同。任何热衷于 CE 6.0 的人都应当考虑参加
该考试。 我们希望这本书能够加速您的考前准备， 就像 Windows Embedded CE 6.0 加
速了您的开发过程一样。Microsoft 开发团队在此给予最大的祝福！
You can find plenty of information about the CE operating system, development
tools, and concepts in this preparation kit for Microsoft Certified Technology Special-
ist (MCTS) Exam 70-571 “Microsoft Windows Embedded CE 6.0, Developing”
released in May 2008. We are very excited about Exam 70-571. It signifies another
important milestone in the Windows Embedded CE success story. Now, for the first time, embedded developers have the ability to assess and demonstrate their skills
regarding the development of embedded solutions based on Windows Embedded
technologies, and they can gain recognition for their knowledge and proficiency. Any-
body with a passion for CE 6.0 should consider taking the exam. We hope that this
book accelerates your preparation just as Windows Embedded CE 6.0 accelerates
your development processes. Best wishes from all of us here at the Microsoft develop-
ment team!
(2009-06-05, Visual C++, 12459KB, 下载60次)
[操作系统开发] ADTLink
关于链表的所有操作的代码，包括新建、删除、新加等，适合学习操作系统和算法的人使用
List of all operations on the code, including new, delete, new, etc., operating systems and algorithms for learning to use (2009-05-16, Visual C++, 2KB, 下载1次)
[操作系统开发] FileEncrypt
COM 组建的开发，实现系统文件加解密操作！
COM formation of the development, the realization of system files encryption and decryption operation! (2008-09-11, Visual C++, 3482KB, 下载18次)
[操作系统开发] 操作系统_作业调
操作系统模拟程序 简单实现作业调度算法（先来先服算法，短作业优先算法，高响应比算法）
operating system simulation program to achieve a simple scheduling algorithm (first-come first-served algorithm, short operating priority algorithm, a high response ratio algorithm) (2005-05-24, Visual C++, 1KB, 下载107次)