Documents Presentations
Scheduling Complete Trees on two uniform processors with any integer speed ratios and communication delays
Title
Scheduling Complete Trees on two uniform processors with any integer speed ratios and communication delays
Date
2004.04.07
Language
French
Summary
During this presentation I explain how the algorithm in the article operates. Beside this I try to solve a more general case an do set up a dedicated algorithm for it.
