Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/55649
Title: Performance evaluation of heuristics for scheduling pipelined multiprocessor tasks
Authors: Ercan, MF
Oguz, C
Fung, YF
Issue Date: 2001
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2001, v. 2073, p. 61-70 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: This paper presents the evaluation of the solution quality of heuristic algorithms developed for scheduling multiprocessor tasks in a class of multiprocessor architecture designed for real-time operations. MIMD parallelism and multiprogramming support are the two main characteristics of multiprocessor architecture considered. The solution methodology includes different techniques including simulated annealing, tabu search, as well as well-known simple priority rule based heuristics. The results obtained by these different techniques are analyzed for different number of jobs and machine configurations.
Description: International Conference on Computational Science, ICCS 2001, 28-30 May 2001
URI: http://hdl.handle.net/10397/55649
ISBN: 3540422323
9783540422327
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Nov 19, 2017

Page view(s)

44
Last Week
2
Last month
Checked on Nov 20, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.