![]() |
Volumn , Issue , 1998, Pages 130-139
|
How 'hard' is thread partitioning and how 'bad' is a list scheduling based partitioning algorithm?
a
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMMUNICATION;
DESIGN;
MULTIPROCESSING SYSTEMS;
THREAD PARTITIONING;
PROGRAM COMPILERS;
|
EID: 0031622190
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/277651.277679 Document Type: Conference Paper |
Times cited : (8)
|
References (31)
|