搜索资源列表
lianliankan1
- 利用递归来求的，其实连连看的搜索算法也就是搜索从一个点到另外一个点的不超过两次转弯的最短距离！-use recursion to seek the 1000 block of Terry Avenue fact, the search algorithm is a search from one point to another point of not more than twice the minimum distance between turning!
c
- 要求： 1。实现三种算法： 1。先来先服务 2。最短寻道优先（老师会给当前磁头的位置） 3。电梯算法 2。磁道服务顺序从指定的文本文件（TXT文件）中取出 3。输出： 第一行：磁道的服务顺序 第二行：显示移动总道数-Requirements: 1. The realization of the three algorithms: 1. First Come First
cipanyibi
- 磁盘移臂调度过程模拟系统的设计——先来先服务法、最短寻道时间优先算法、电梯算法-The process of shifting the disk arm scheduling simulation system design- first come first serve method, the shortest seek time priority algorithm, Elevator algorithm
cpdd
- 设计五个算法,分别是先来先服务算法,最短寻道时间优先算法,扫描(SCAN)算法,循环扫描(CSCAN)算法,NStepSCAN算法.由人工输入当前的磁道数,由系统随即生成要访问的磁道-The design of the five algorithms, namely, first-come first-serve algorithm, the shortest seek time priority algorithm, scanning (SCAN) algorithm, scanning cy
a1
- 磁盘调度算法:包括先来先服务算法，最短寻道时间算法，电梯寻道算法。-Disk scheduling algorithms: including a first-come first-served algorithm, the shortest seek time algorithm, elevator seek algorithm.
b
- 磁盘调度算法 先来先服务、最短寻道时间算法 操作系统课程设计-Disk scheduling algorithm first-come, first-served, shortest seek time operating system, curriculum design algorithm
disk
- OS磁盘调度演示程序（有图形演示） 先来先服务的磁盘调度功能 最短寻道时间优先的磁盘调度功能。 电梯算法的磁盘调度功能。 -OS disk scheduling demo first come first served the shortest seek time disk scheduling priority function of the disk scheduling functions. Elevator disk scheduling algorithm functi
DiskSchecualing
- （1）设计并实现了一个函数，完成先来先服务的磁盘调度功能 （2）设计并实现了一个函数完成最短寻道时间优先的磁盘调度功能。 （3）设计并实现了一个函数完成电梯算法的磁盘调度功能 -(1) design and implementation of a function, to complete a first-come first-served disk scheduling (2) design and implementation of a function to complete
cipan
- 磁盘调度算法 包括fcfs,最短寻道时间，电梯调度，单项扫描 -Disk scheduling algorithms include fcfs, shortest seek time, elevator scheduling, single scan
cipandiaodu
- 编程序实现下述磁盘调度算法,并求出每种算法的平均寻道长度： 要求设计主界面以灵活选择某算法，且以下算法都要实现 1、先来先服务算法（FCFS） 2、最短寻道时间优先算法（SSTF） 3、扫描算法（SCAN） 4、循环扫描算法（CSCAN） -Programmed to achieve the following disk scheduling algorithms, and calculate the average seek length of each algorit
scan_and_sstf
- 最短寻道时间优先（SSTF）和扫描（SCAN）算法。可以对给出的任意的磁盘请求序列、计算平均寻道长度； 要求可定制磁盘请求序列长度、磁头起始位置、磁头移动方向。-Shortest seek time first (SSTF) and scanning (SCAN) algorithm. Can be given any sequence of disk requests, calculate the average seek length requirements can be customi
disk-schedule
- 操作系统\磁盘调度 磁盘调度的4种调度方式: 先来先服务调度\最短寻道时间优先调度算法\单向扫描/循环扫描调度算法-Operating System \ disk scheduling the four scheduling disk scheduling methods: first-come first-served scheduling \ shortest seek time first scheduling algorithm \ one-way scan/scan sch
Disk-scheduling
- ① 理解和掌握常用的磁盘调度算法的内容和原理。磁盘是可被多个进程共享的设备。当有 多个进程都请求访问磁盘时，应采用一种适当的调度算法，以使各个进程对磁盘的平均访问(主要是寻道)时间最小。 ② 通过本实验，使用先来先服务算法、最短寻道时间优先算法、扫描算法，模拟实现一个简单的磁盘调度系统。 -The understanding and grasp of the commonly used disk scheduling algorithm content and principle.
Josephus
- Josephus小算法，自己下载吧。希望有用呀！~-Josephus algorithm download. Seek to help! ~
fcfs
- fcfs程序，操作系统的磁道算法，包含了最短寻道和优先算法-fcfs program, the operating system tracks algorithm with the shortest seek first algorithm
operating-system
- 计银行家算法,void FCFS(int Han,int DiscL[]) //先来先服务算法(FCFS) void SSTF(int Han,int DiscL[]) //最短寻道时间优先算法(SSTF) int SCAN(int Han,int DiscL[],int x,int y) //扫描算法(SCAN) void CSCAN(int Han,int DiscL[]) //循环扫描算法(CSCAN) void N_Step_SCAN(int Han1,int DiscL
parallel-compute.
- 一个基于OpenMp并行编程的实例，基于多线程，多线程比单线程下节省运行时间的典型例子。算法内容主要是计算矩阵乘积，再求个元素和。可通过"任务管理器"-"性能"查看运行在多核上。-Typical example of a parallel programming based OpenMp instance, save run time based on the multi-threaded, multi-threading than single-threaded. The algorithm
CSharp---Matrix-code
- C#实现的矩阵的各种运算，包括基本的算法，还有矩阵的各种分解，一般求逆和广义矩阵的求逆，很好的学习资料，推荐。-Matrix C# implementation of various operations, including the basic algorithm, there is a matrix of various decomposition generally seek the inverse and generalized matrix inversion, learning ma
CCDU
- 磁盘调度算法.设计程序模拟先来先服务FCFS、最短寻道时间优先SSTF、SCAN和循环SCAN算法的工作过程。-Disk scheduling algorithms. Designed program to simulate a first-come, first-served FCFS, shortest seek first SSTF, SCAN and SCAN loop algorithm works.
chap10
- 整定PID参数时，需采用一种不需要任何初始信息并可以寻求全局最优解的、高效的组合优化方法(When tuning PID parameters, an efficient combination optimization method is needed, which does not need any initial information and can seek global optimal solution)