Description: 此为操作系统实验报告： scan,cscan算法模拟磁盘调度 内含：程序流程图 设计思路 主要源码等等。 简介：磁盘是一种高速、大容量、旋转型、可直接存取的存储设备。它作为计算机系统的辅助存储器，担负着繁重的输入输出任务、在多道程序设计系统中，往往同时会有若干个要求访问磁盘的输入输出请求等待处理。系统可采用一种策略，尽可能按最佳次序执行要求访问磁盘的诸输入输出请求。-operating system for this experiment : scan, cscan scheduling algorithm simulation disk containing : flowchart design major source so on. Description : disk is a high-speed, high-capacity, rotating type, direct access storage devices. As computer systems support memory, shoulders the heavy task of input and output, multiple procedures in the system design, while there are often a number of requests to visit disk input and output requests pending. Platform: |
Size: 6144 |
Author:何浩 |
Hits:
Description: 最佳调度问题，假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。
-Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to complete a full first mission. Platform: |
Size: 1024 |
Author:朱亚华 |
Hits:
Description: 1. 最早截止时间优先EDF（Earliest DeadlineFirst）算法是非常著名的实时调度算法之一。在每一个新的就绪状态，调度器都是从那些已就绪但还没有完全处理完毕的任务中选择最早截止时间的任务，并将执行该任务所需的资源分配给它。在有新任务到来时，调度器必须立即计算EDF，排出新的定序，即正在运行的任务被剥夺，并且按照新任务的截止时间决定是否调度该新任务。如果新任务的最后期限早于被中断的当前任务，就立即处理新任务。按照EDF算法，被中断任务的处理将在稍后继续进行。
-1. The first priority deadline for EDF (Earliest DeadlineFirst) algorithm is a very famous one in real-time scheduling algorithm. In every state of readiness for a new, scheduler from those already in place but has not fully dealt with the mandate to select the earliest deadline for the task, and the implementation of the tasks required for the allocation of resources to it. In the arrival of new tasks, the scheduler must immediately calculate EDF, from the new sequencing, that is the task of running was curtailed, and new tasks in accordance with the deadline for deciding whether to dispatch the new tasks. If the new mission as early as the deadline for the immediate task was interrupted immediately to deal with new tasks. In accordance with the EDF algorithm, the task was interrupted to deal with will be at a later date to continue. Platform: |
Size: 2048 |
Author:wjx |
Hits:
Description: 基于RTlinux平台的实时多任务调度策略，运
用模块化的设计方法，编制了程序解释模块、速度过渡模块、插补和运动学算法模 块、人机接口模块和伺服驱动模块，并实现了面向用户的软PLC功能 。-RTLinux-based platform for real-time multi-task scheduling strategy, using modular design methods, the preparation of the procedures explained module, the speed of the transition module, interpolation and kinematics algorithm module, man-machine interface module and servo drive modules, and to achieve a user-oriented soft PLC functions. Platform: |
Size: 5111808 |
Author:li |
Hits:
Description: 网格环境下的Min_Min任务调度算法的研究，
利用SIMGRID模拟，在LINUX环境下运行，MIN_MIN任务调度算法的研究-Grid Task Scheduling Algorithm Min_Min of the study, the use of SIMGRID simulation run in the LINUX environment, MIN_MIN Task Scheduling Algorithm Platform: |
Size: 1381376 |
Author:lihongfeng |
Hits:
Description: 实现网格中含有依赖任务调度的GS算法，其中根据任务在各个机器上的执行时间和任务之间的依赖关系来计算出任务的调度顺序-The realization of the grid containing the GS-dependent task scheduling algorithm, in which the task in accordance with the implementation of the various machines on time and task-dependent relationship between the task scheduler to calculate the order of Platform: |
Size: 4096 |
Author:吴明 |
Hits:
Description: 假设有n个任务由k个可并行工作的机器完成。完成任务i需要时间为Ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。
-Suppose there are n-task by the k-parallel machine can be completed. I need time to complete the task Ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks. Platform: |
Size: 1024 |
Author:孙云 |
Hits:
Description: 调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks. Platform: |
Size: 16384 |
Author:pactric |
Hits:
Description: ARM Cortex M3及M0定制操作系统
高度可裁剪性，最小系统内核仅974Byte
支持优先级抢占和时间片轮转
自适应任务调度算法
零中断延时时间
堆栈溢出检测
信号量、邮箱、队列、事件标志、互斥等同步通信方式
支持多种编译器：ICCARM、ARMCC、GCC -Specially designed for Cortex-M series
Scalable, minimal system kernel is only 974Byte
Adaptive Task Scheduling Algorithm.
Supports preemptive priority and round-robin
Interrupt latency is 0
Stack overflow detection option
Semaphore, Mutex, Flag, Mailbox and Queue for communication & synchronisation
Supports the platforms of ICCARM, ARMCC, GCC Platform: |
Size: 77824 |
Author:rd |
Hits:
Description: An example of heurestic NEH algorithm implemented for task scheduling in C-An example of heurestic NEH algorithm implemented for task scheduling in C++ Platform: |
Size: 1024 |
Author:milithrar |
Hits:
Description: On the basis of author’s former work, this
paper presents an improved ant colony algorithm,
namely adaptive ant colony algorithm. In the proposed
algorithm, the value of evaporation rate ρ is adaptively
changed and a minimum value ρmin is assigned. Thereby,
the evaporation rate ρ is under control and will never be
reduced to 0. Then the paper applies the proposed
algorithm to grid task scheduling. Comparing
experimental results with the original algorithm show
that the proposed algorithm is more efficient both in task
scheduling efficiency and resource load. Platform: |
Size: 280576 |
Author:rishi |
Hits:
Description: 基于轮转的任务调度算法，主要是适用于linux的操作系统，希望对大家有帮助-Based on the rotary task scheduling algorithm, mainly is suitable for the Linux operating system, and we want to help
Platform: |
Size: 1024 |
Author:翟海波 |
Hits:
Description: 基于权限轮转的任务调度算法，主要是适用于linux的操作系统，希望对大家有帮助-Based on the authority of the rotary task scheduling algorithm, mainly is suitable for the Linux operating system, and we want to help
Platform: |
Size: 2048 |
Author:翟海波 |
Hits:
Description: 任务调度算法。依据严蔚敏C数据结构编写，可作为数据结构实验的源代码。使用C++编写。包括一个头文件一个cpp文件。用于模拟CPU事件任务到达的处理流程。-Task scheduling algorithm. Based YanWeiMin C data structures to prepare, can be used as the experimental data structure of the source code. Use C++ writing. Including a header file a cpp file. Used to simulate the CPU event task arrival processes. Platform: |
Size: 18432 |
Author:VongRuohang |
Hits:
Description: 高性能计算机体系结构相关。异构系统中相关的调度算法、容错调度算法文章，特别是有关调度算法对系统可用性、系统性能方面的影响。-Heterogeneous system scheduling algorithm and fault-tolerant scheduling algorithm, especially the effect of the scheduling algorithm on system performance and system availability. Platform: |
Size: 4525056 |
Author:sunj |
Hits:
Description: ①设计进程控制块PCB表结构（与实验一的结构相同），分别适用于优先数调度算法和循环轮转调度算法。
②建立进程就绪队列。对两种不同算法编制入链子程序。
③编制两种进程调度算法：1）优先数调度；2）循环轮转调度-Design process control block, PCB table structure and the structure are the same, respectively, applicable to the number of priority scheduling algorithm and round robin scheduling algorithm.
Set up process ready queue. Two kinds of different algorithms are compiled into chain routines.
The preparation of two kinds of process scheduling algorithm: 1) the number of priority scheduling 2) round robin scheduling
Platform: |
Size: 15360 |
Author:薛帅强 |
Hits:
Search - task scheduling algorithm