DocumentCode :
3129061
Title :
On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements
Author :
Bampis, Evripidis ; Kononov, Alexander
Author_Institution :
LaMI
fYear :
2000
fDate :
23-27 April 2000
Firstpage :
2144
Lastpage :
2151
Keywords :
Application specific processors; Approximation algorithms; Computer networks; Computer science education; Educational programs; Job shop scheduling; Mathematics; Partitioning algorithms; Polynomials; Processor scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing Symposium., Proceedings 15th International
Conference_Location :
San Francisco, CA, USA
ISSN :
1530-2075
Print_ISBN :
0-7695-0990-8
Type :
conf
DOI :
10.1109/IPDPS.2001.925214
Filename :
925214
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3129061
بازگشت