<--- Back to Details
First PageDocument Content
Thread / CPU time / Computer multitasking / Context switch / Central processing unit / Windows NT processor scheduling / Real-time operating system / Completely Fair Scheduler / Scheduling algorithms / Computing / Scheduling
Date: 2007-01-07 19:22:26
Thread
CPU time
Computer multitasking
Context switch
Central processing unit
Windows NT processor scheduling
Real-time operating system
Completely Fair Scheduler
Scheduling algorithms
Computing
Scheduling

Add to Reading List

Source URL: web.cs.wpi.edu

Download Document from Source Website

File Size: 164,59 KB

Share Document on Facebook

Similar Documents

Software engineering / Computing / Software requirements / Modeling languages / Systems engineering / Systems analysis / Enterprise modelling / KAOS / Planning Domain Definition Language / I* / Diagram / Use case

Using GORE method for Requirement Engineering of Planning & Scheduling Javier Martnez Silva Department of Mechatronics Engineering University of S˜ao Paulo, S˜ao Paulo, Brazil, Professor Morais, 2231

DocID: 1xW1J - View Document

Business / Economy / Scheduling / Information technology management / Operations research / Production planning / Schedule / Workflow / Business process management / Program evaluation and review technique / Hierarchical task network / Job shop scheduling

Hierarchical Task Model with Alternatives for Predictive-reactive Scheduling Marek Vlk and Roman Barta´k (supervisor) Charles University in Prague, Faculty of Mathematics and Physics Malostranske´ na´m. 25, Pra

DocID: 1xVDu - View Document

Theoretical computer science / Mathematics / Logic in computer science / Proof theory / Programming language semantics / Metalogic / Model theory / Symbol / Net / Constructible universe / Sequent / Permutation

From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis ⋆ ˇ Pavol Cern´ y1 , Edmund M. Clarke2 , Thomas A. Henzinger3 , Arjun 4

DocID: 1xVyQ - View Document

Constraint programming / Theoretical computer science / Computing / Wireless sensor network / Wireless networking / Applied mathematics / Satisfiability modulo theories / Sensor node / Constraint satisfaction / Mathematical optimization / Constraint

Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers∗ Gergely Kovásznai, Csaba Biró, and Balázs Erdélyi Eszterházy Károly University, Eger, Hungary IoT Research

DocID: 1xVqK - View Document

2016 IEEE Real-Time Systems Symposium On-Line Event-Driven Scheduling for Electric Vehicle Charging via Park-and-Charge 1

DocID: 1xVlA - View Document