Location:
Search - preemptive
Search list
Description: 抢先式防止IE弹出窗口-preemptive prevent IE pop-up window
Platform: |
Size: 54825 |
Author: 李晋江 |
Hits:
Description: 这是操作系统实验的调度算法,包含时间片轮转法,抢占式优先权算法,非抢占式优先权算法,先来先服务算法,短作业(进程)优先调度算法.
-This is the experimental operating system scheduling algorithms, including time-rotate, Preemptive priority algorithm, non-preemptive priority algorithm, first-come first-serve algorithm, short operations (process), priority scheduling algorithm.
Platform: |
Size: 15062 |
Author: 梁狂 |
Hits:
Description: TCP/IP Winsock编程实例，利用Winsock编程由同步和异步方式，同步方式逻辑清晰，编程专注于应用，在抢先式的多任务操作系统中(WinNt、Win2K)采用多线程方式效率基本达到异步方式的水平，应此以下为同步方式编程要点进行快速通信
-TCP / IP Winsock programming examples, the use of Winsock programming from synchronous and asynchronous, synchronous mode logic clear and programming focus on the application, preemptive multitasking operating system (WinNt, Win2K) using multithreading efficient way to achieve the basic level asynchronous mode, the following should be here for synchronous mode programming essentials for quick communication
Platform: |
Size: 2951 |
Author: sxy |
Hits:
Description: Windows CE 是微软公司开发的一种嵌入式操作系统。它是一种模块化的、实时的、有强大通信能力的、抢先式、多任务的嵌入式操作系统。-Windows CE is Microsoft's embedded operating system. It is a modular, real-time, a powerful communications capabilities, preemptive multitasking embedded operating system.
Platform: |
Size: 2609441 |
Author: 杨爽 |
Hits:
Description: 引入事件驱动观念的抢占式多任务微型实时内核——MicroStar的设计与实现；提出基于事件的优先级这一新概念。-introduction of the concept of event-driven preemptive multi-tasking real-time micro-kernel -- the design and MicroStar achieved; Based on the proposed priority of this new concept.
Platform: |
Size: 52970 |
Author: 许友来 |
Hits:
Description: 抢占式优先权进程调度模拟程序，这是我校操作系统的实验必修程序之一。-Preemptive priority scheduling process simulation program, this is my school operating systems experimental procedure compulsory one.
Platform: |
Size: 35242 |
Author: 青柿子 |
Hits:
Description: 多任务系统，供大家学习，交流，ＵＣ／ＯＳ为内河抢占式的系统，和ＷＩＮＤＯＷＳ系统不同．-multi-tasking system, we learn, communicate, UC / OS Preemptive for river systems, and different Windows system.
Platform: |
Size: 44142 |
Author: 李语 |
Hits:
Description: 本程序实现FCFS先来先服务，SPF短进程优先，FPF_Reaved抢占式高优先级，TimePiece时间片轮转这四种进程调度算法。
程序运行时根据提示选择相应进程调度算法，然后调用函数GetRandProc(LPVOID lpParam)（程序专门为该函数开辟新的线程）产生随机进程并将其插入到就绪队列中然后再用相应的进程调度算法调度进程运行。
-the program FCFS first-come first-serve, SPF short process priority, Preemptive FPF_Reaved high-priority, TimePiece time to rotate the four-process scheduling algorithm. Running time prompted the selection process scheduling algorithm, then the function call GetRandProc (LPVOID lpParam) (specialized procedures for the letter several open up new threads) random process and will be inserted into its place queue Then the corresponding process scheduling algorithm scheduling The process runs.
Platform: |
Size: 21730 |
Author: mayfar |
Hits:
Description: 从Keil C51 的内存空间管理方式入手,着重讨论实时操作系统在任务调度时的重入问题,分析一些解决
重入的基本方式与方法:分析实时操作系统任务调度的占先性,提出非占先的任务调度是能更适合于
Keil C51 的一种调度方式。为此,构造这一实时操作系统,并有针对性地介绍此系统的堆管理方法、任务
的建立以及任务的切换等。-from Keil C51 memory space management mode. focused on real-time operating system in the task of re-scheduling into problems, the analysis of some important means to solve the basic ways and means : Analysis of real-time task scheduling the operating system take precedence, The proposed non-preemptive task scheduling can be more suited to a Keil C51 scheduling approach. To this end, the structure of the real-time operating systems, and targeted presentation of the heap management methods, and the establishment of task switching, and other tasks.
Platform: |
Size: 252797 |
Author: jun |
Hits:
Description: 简易非抢先式实时多任务操作系统的设计与应用-Summary Non-preemptive multi-tasking real-time operating system design and application
Platform: |
Size: 8112 |
Author: sam |
Hits:
Description: 基于非抢占的动态优先级调度算法模拟源程序-based on non-preemptive dynamic priority scheduling algorithm simulation program
Platform: |
Size: 1429 |
Author: 姚义磊 |
Hits:
Description: 在操作系统中，由于进程总数多于处理机，它们必然竞争处理机。进程调度的功能就是按一定策略、动态地把处理机分配给处于就绪队列中的某一进程并使之执行。根据不同的系统设计目标，可有多种选择某一进程的策略。有两种基本的进程调度方式，即剥夺方式(preemptive mode)和非剥夺方式(non-preemptive mode)。前者指就绪队列中一旦有优先级高于现行进程优先级的进程出现时，系统便立即把处理机分配给高优先级的进程。当然，被剥夺了处理机的进程的有关状态和上下文都必须妥善保存以便今后恢复。后者是，一旦处理机分给了某进程，除非该进程的时间片已满或它主动放弃处理机引起进程调度的原因与操作系统的类型有关，大体可归结为以下几种：
(1) 进程运行完毕
(2) 进程提出I/O请求；
(3) 进程执行某种原语操作(如P操作)导致进程阻塞；
(4) 时间片已满；
(5) 可剥夺方式中，就绪队列中某进程的优先级变得高于现行进程；，系统不得以任何理由剥夺该现行进程的处理机。
-the operating system, due process than the total number of processor, and they will compete processor. Process scheduling function is to a certain strategy, Dynamic processor allocation of land to put in place a cohort of the implementation process of making it. According to various system design objectives, can have a wide choice of a process strategy. There are two basic process scheduling, that is deprived of means (preemptive mode) and non-denial mode (non-preempti 've mode). The former refers to ready queue once they have priority over the current process priority class process, the system will immediately processors allocated to high-priority process. Of course, the processors are deprived of the process of the state and context must be properly preserved for future restoration.
Platform: |
Size: 235735 |
Author: 李明 |
Hits:
Description: TinyWorks操作系统。
每个任务占6~10个字节的RAM空间，整个系统占1k左右的代码空间，支持16个优先级的占先式调度，支持时间片调度。
最大特点：建立的任务越多、并且系统越繁忙时调度越快，最快比系统闲时快数十倍！
用AVR-GCC编译，支持MEGA8-TinyWorks operating system. Each task for 6 ~ 10 bytes of RAM space, the system as a whole accounted for around 1k code space, 16 support the priority preemptive scheduling, support for time-scheduling. The biggest characteristics : the establishment of the mandate of the more systematic and more heavy scheduling and faster than the fastest system in his spare time a few times fast! Using AVR-GCC compiler support MEGA8
Platform: |
Size: 7226 |
Author: lbb |
Hits:
Description: 这是操作系统实验的调度算法,包含时间片轮转法,抢占式优先权算法,非抢占式优先权算法,先来先服务算法,短作业(进程)优先调度算法.
-This is the experimental operating system scheduling algorithms, including time-rotate, Preemptive priority algorithm, non-preemptive priority algorithm, first-come first-serve algorithm, short operations (process), priority scheduling algorithm.
Platform: |
Size: 247808 |
Author: 梁狂 |
Hits:
Description: 基于非抢占的动态优先级调度算法模拟源程序-based on non-preemptive dynamic priority scheduling algorithm simulation program
Platform: |
Size: 1024 |
Author: 姚义磊 |
Hits:
Description: TinyWorks操作系统。
每个任务占6~10个字节的RAM空间，整个系统占1k左右的代码空间，支持16个优先级的占先式调度，支持时间片调度。
最大特点：建立的任务越多、并且系统越繁忙时调度越快，最快比系统闲时快数十倍！
用AVR-GCC编译，支持MEGA8-TinyWorks operating system. Each task for 6 ~ 10 bytes of RAM space, the system as a whole accounted for around 1k code space, 16 support the priority preemptive scheduling, support for time-scheduling. The biggest characteristics : the establishment of the mandate of the more systematic and more heavy scheduling and faster than the fastest system in his spare time a few times fast! Using AVR-GCC compiler support MEGA8
Platform: |
Size: 7168 |
Author: lbb |
Hits:
Description: 抢占式的优先级调度，可以动态演示其过程！-Preemptive priority scheduling, dynamic demonstration of its process can be!
Platform: |
Size: 1024 |
Author: wl |
Hits:
Description: 操作系统，模拟抢占式短进程优先调度算法,先来先服务算法-Operating systems, process simulation of short-priority preemptive scheduling algorithm, first-come first-serve algorithm
Platform: |
Size: 6144 |
Author: jdk_1_ok |
Hits:
Description: 基于 AVR 单片机的 抢占式内核 提供完整的服务-The AVR microcontroller preemptive kernel full service
Platform: |
Size: 61440 |
Author: 王明 |
Hits:
Description: 实用的多任务排序Preemptive task
，如果任务A和任务B定时同时定时到，该执行哪个？如果执行A，那么B就得舍弃，注意，是舍弃，不是等一会再执行B。还有，如果某个任务执行时间出现抖动，整个系统和其它任务都要遭殃了，等等。
在我的代码中，力求解决这些问题。在此，我不打算带着大家一行一行分析代码。这玩意讲解没用，自己去悟懂了才是王道，我的代码注释得已经很详细了其实。
代码的重点是SCH51.C和T0_INIT.C两个文件，使用之前一定要先看看CONFIG.H的配置情况。task.c文件内容你可以自定义来实现。其它的我都有注释的。
-If the task is very large, the timer big trouble, because the microcontroller interrupt program should end as soon as possible. Moreover, if the timing of the task A and task B simultaneously timed to the implementation of what? If you do A, then B must abandon, note that is discarded and not wait for a while before running B. Also, if a task execution time jitter occurs, the entire system and other tasks have to suffer, and so on. In my code, to try to resolve these issues. At this point, I do not intend to bring everyone to the code line by line analysis. This stuff is useless to explain, understand themselves to realize is king, my code was already very detailed notes in fact. Code is focused SCH51.C and T0_INIT.C two documents, we must first look CONFIG.H before using the configuration. task.c contents of the file you can customize to achieve. I have another comment.
Platform: |
Size: 546816 |
Author: zixing |
Hits: