|
Volumn 30, Issue 1, 2000, Pages 145-160
|
Preemptive scheduling of parallel jobs on multiprocessors
a a a a |
Author keywords
Competitive analysis; Parallel programs; Processor scheduling; Unknown information
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
GRAPH THEORY;
MATHEMATICAL MODELS;
PARALLEL ALGORITHMS;
PARALLEL PROCESSING SYSTEMS;
SCHEDULING;
THEOREM PROVING;
COMPETITIVE ANALYSIS;
PREEMPTIVE SCHEDULING;
PROCESSOR SCHEDULING;
UNKNOWN INFORMATION;
OPTIMIZATION;
|
EID: 0034457296
PISSN: 00975397
EISSN: None
Source Type: Journal
DOI: 10.1137/S0097539797315598 Document Type: Article |
Times cited : (15)
|
References (38)
|