Back to Results
First PageMeta Content
Concurrent computing / Scheduling algorithms / Operations research / Planning / Scheduling / Kernel / Operating system / Thread / Preemption / Computing / Computer architecture / Software


Achieving Predictable Timing and Fairness Through Cooperative Polling by
Add to Reading List

Document Date: 2008-04-01 00:30:29


Open Document

File Size: 1,08 MB

Share Result on Facebook

City

Kolkata / /

Country

India / /

Facility

The University Of British Columbia November / University of Toronto / Anirban Sinha The University of British Columbia November / Institute of Engineering / /

IndustryTerm

coop poll algorithm / diverse hardware / cooperative fairshare algorithm / fairshare algorithm / kernel fairshare algorithm / dispatcher algorithm / commodity operating systems / process scheduling algorithm / /

OperatingSystem

Linux / /

Organization

Institute of Engineering and Management / Computer Science Department / Faculty of Graduate Studies / University of Toronto / University of British Columbia / /

Person

Kan / Gitika / Meghan / Gang / Satyajit Chakrabarti / Brad / Ashvin Goel / Andrei / Charles / Bimal Kumar Mitra / Camilo / Abhishek / Brendan Cully / Mayukh / Robert Love / Krasic / Norman Hutchinson / Andy Warfield / Mike Tsai / Mike Wood / Cuong / Geoffrey Lefebvre / Late / /

/

Position

well-tuned fair-share scheduler / supervisor / Single Player / scheduler / fair-share scheduler / /

Technology

process scheduling algorithm / Linux / API / Kernel Scheduling Algorithm / 49 2.3 The User level Fairshare Algorithm / operating system / Shared Memory / operating systems / Kernel Algorithm / Fairshare Scheduling Algorithm / Load Balancing / Kernel cooperative fairshare algorithm / 8 2.3 Event dispatcher algorithm / Chip-Multithreaded Processors / Kernel Fairshare Algorithm / 26 2.12 The coop poll algorithm / fairshare algorithm / /

SocialTag