Threshold-based priority policies for parallel-server systems with affinity scheduling

Proceedings of the American Control Conference

Volumn 4, Issue , 2001, Pages 2992-2999

  Squillante, M S ^a   Xia, C H ^a   Yao, D D ^a   Zhang, L ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER NETWORKS; CONTROL SYSTEM SYNTHESIS; QUEUEING THEORY; REAL TIME SYSTEMS; SCHEDULING;

AFFINITY SCHEDULING; PARALLEL SERVER STOCHASTIC NETWORKS; PARALLEL SERVER SYSTEMS; THRESHOLD BASED PRIORITY POLICIES;

CONTROL THEORY;

EID: 0034848204     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2001.946370     Document Type: Conference Paper

References (9)

1. Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
2. Heavy traffic resource pooling in parallel-server systems
3. Resource pooling in queueing networks with dynamic routing
4. Stochastic bounds for queueing systems with limited service schedules
5. Using processor-cache affinity information in shared-memory multiprocessor scheduling
6. Analysis of task migration in shared-memory multiprocessors
7. Optimal control of a multiclass parallel-server fluid network
8. On dynamic scheduling of a parallel server system with complete resource pooling