Scheduling of Independent Dedicated Multiprocessor Tasks-Reference-Cited by-同舟云学术

Scheduling of Independent Dedicated Multiprocessor Tasks

Published:2002 Issue: Volume: Page:391-402
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Bampis Evripidis,Caramia Massimiliano,Fiala Jiří,Fishkin Aleksei V.,Iovanella Antonio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36136-7_35

Reference23 articles.

1. M. Ammar, G. Polyzos, and S. Tripathi (Eds.). Special issue on network support for multipoint communication. IEEE Journal Selected Areas in Communications, 15, 1997.

2. Lect Notes Comput Sci;A. K. Amoura,1997

3. E. Bampis and A. Kononov. On the approximability of scheduling multiprocessor tasks with time dependent processing and processor requirements. In Proceedings 15th International Parallel and Distributed Processing Symposium, San Francisco, 2001.

4. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and non-approximability — towards tight results. SIAM Journal on Computing, 27:804–915, 1998.

5. Lect Notes Comput Sci;S. Bischof,1998

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Combinatorial Approximation Algorithms for Spectrum Assignment Problem in Chain and Ring Networks;Combinatorial Optimization and Applications;2017

2. Distance‐adaptive routing and spectrum assignment in rings;IET Networks;2016-05

3. Spectrum management techniques for elastic optical networks: A survey;Optical Switching and Networking;2014-07

4. Makespan Prediction Algorithm for Dedicated Robots Task Allocation;Applied Mechanics and Materials;2013-03

5. Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates;Computers & Operations Research;2008-05