An ACO-based approach for scheduling task graphs with communication costs


In this paper we introduce a new algorithm for computing near optimal schedules for task graph scheduling problems. In contrast to conventional approaches for solving those scheduling problems, our algorithm is based on the same principles that ants use to find shortest paths between their nest and food sources. Like their natural counterparts, artificial… (More)
DOI: 10.1109/ICPP.2005.18

5 Figures and Tables


  • Presentations referencing similar topics