Fast Scheduling Algorithms on Parallel Computers

  • lhst Mayr


Abshnct: With the introduction of prcrallcl processing, scheduling problems have gen-ernl,cd great interest. Although there arc good scqucntial nlgorit ltnls for many sclicduling problcnis, there are few fast pai-nllcl schccluliug algorithms. In this paper we present scvcrnl good schcdulillg nlgorithlns that run 011 l3Rl3W I'IUMS. For the unit time… (More)


4 Figures and Tables

Slides referencing similar topics