Multiprocessor task graph scheduling

I started to invetsigate the multiprocessor task graph scheduling during my PhD and since then, I'am still using sometimes to try some ideas

The benchmarks

To test different methods, I've used a synthetic set of graphs generated by a tool called Andes-Synth and also some graphs from robotics

The benchmark is available here
Best Known results
GraphBest know results
Bellfordm71 936 050
l193 794 250
Diamond-1m131 940 750
l276 758 950
Diamond-2m127 224 450
l218 954 400
Diamond-3m176 982 100
l228 590 500
Diamond-4m132 875 550
l164 264 000
Divconqm97 307 880
l169 043 350
fftm29 888 250
l102 647 300
Gaussm226 882 900
l307 395 800
Iteratifm16 733 350
l47 936 700
ms-gaussm4 598 559 550
l2 559 388 750
prologm60 499 350
l258 529 350
qcdm1 173 100 600
l2 038 576 050
elbowm6630
stanfordm627q
ssc574
677
782
886
989

Pascal Rebreyend
Last modified: Tue Jun 30 10:26:52 CEST 2009
Valid HTML 4.01!