<--- Back to Details
First PageDocument Content
Linux kernel / Concurrent computing / Planning / Scheduling / O(1) scheduler / Completely Fair Scheduler / Preemption / Thread / Nice / Scheduling algorithms / Computing / Computer architecture
Date: 2008-04-01 00:31:42
Linux kernel
Concurrent computing
Planning
Scheduling
O(1) scheduler
Completely Fair Scheduler
Preemption
Thread
Nice
Scheduling algorithms
Computing
Computer architecture

Yet another new scheduler?! Our Design Objectives

Add to Reading List

Source URL: anirban.org

Download Document from Source Website

File Size: 1,11 MB

Share Document on Facebook

Similar Documents

A CASE FOR IDEA PREEMPTION OF STATE COMMON-LAW TORT CLAIMS BASED ON SPECIAL EDUCATION STUDENTS’ INFLICTION OF SERIOUS BODILY INJURY UPON ANOTHER AT SCHOOL BY CURTIS GONZALEZ JURIS DOCTOR EXPECTED DECEMBER 2006

DocID: 1tDPk - View Document

Stateless Model Checking with Data-Race Preemption Points Ben Blum Garth Gibson Carnegie Mellon University, USA

DocID: 1trAM - View Document

Lock Holder Preemption Avoidance via Transactional Lock Elision Dave Dice Tim Harris

DocID: 1tkb9 - View Document

Optimizing Preemption-Overhead Accounting in Multiprocessor Real-Time Systems ∗ Bryan C. Ward Abhilash Thekkilakattil

DocID: 1t9BR - View Document

PALSGRAF, PUNITIVE DAMAGES, AND PREEMPTION Benjamin C. Zipursky∗ INTRODUCTION The standard One-L curriculum remains heavy on Torts, Contracts, and Property, presumably on the theory that these subjects will help studen

DocID: 1sZep - View Document