Back to Results
First PageMeta Content
Association for Computing Machinery / Job scheduler / Computing / Computer science / Academia / Scheduling algorithms / SIGMETRICS / Scheduling


1 “All Can Win” Theorems – Why Biased Scheduling is Fair The problem: The SYNC (Scheduling Your Network Connections) project is largely motivated by a single question: Is it possible to reduce the expected response
Add to Reading List

Document Date: 2007-06-27 02:12:21

Open Document

File Size: 49,21 KB

Share Result on Facebook

City

San Diego / /

Company

IBM / Rai / Addison-Wesley Publishing Company / Network Appliance / Cisco Systems / Queueing Systems / EMC2 Corporation / Next Generation Internet Networks / John Wiley & Sons / /

Country

France / /

Facility

Prentice Hall / /

IndustryTerm

Web requests / wireless channels / Web servers / web server protocols / shortest remaining processing time discipline / busy internet services / web server resources / web server scheduling policies / web server employing / web workloads / web performance / Internet Technologies / Web server / Apache web server / shortest processing remaining time discipline / /

OperatingSystem

Linux / /

Organization

Congress / National Science Foundation / Institut Eurecom / /

Person

Job Scheduling Strategies / M. Agarwal / Max Figure / Ernst Biersack / A. Zwart / K. Sigman / Williamson / N. Bansal / M. Agrawal / A. Wierman / Job Sizes / H. Feng / V / C. W. Yang / M. Nuyens / S. Shakkottai / M. Harchol-Balter / B. Schroeder / /

Position

representative / unified priority-based scheduler / /

ProvinceOrState

California / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

web server protocols / LAN / LAS algorithm / Linux / queueing theory / Avi / MPEG-4 / HTTP / Simulation / Operating System / Quality of Service / Operating Systems / WAN / Parallel Processing / Web server / Two-level processor / /

URL

http /

SocialTag