|
Volumn , Issue , 2000, Pages 29-33
|
Cellular automata approach to scheduling problem
|
Author keywords
Computer architecture; Computer science; Concurrent computing; Content addressable storage; Delay; Electronic mail; Linear approximation; Multiprocessing systems; Processor scheduling; Scheduling algorithm
|
Indexed keywords
APPROXIMATION ALGORITHMS;
ASSOCIATIVE STORAGE;
CELLULAR AUTOMATA;
COMPUTER SCIENCE;
ELECTRONIC MAIL;
GENETIC ALGORITHMS;
MULTIPROCESSING SYSTEMS;
PARALLEL PROCESSING SYSTEMS;
PROBLEM SOLVING;
PROGRAM PROCESSORS;
SCHEDULING;
SCHEDULING ALGORITHMS;
CONCURRENT COMPUTING;
DELAY;
INITIAL ALLOCATIONS;
LINEAR APPROXIMATIONS;
NEAR-OPTIMAL SOLUTIONS;
NONLINEAR STRUCTURE;
PROCESSOR SCHEDULING;
SCHEDULING PROBLEM;
COMPUTER ARCHITECTURE;
|
EID: 0012581954
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/PCEE.2000.873596 Document Type: Conference Paper |
Times cited : (11)
|
References (5)
|