Mounira Belmabrouk

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
— In this paper, we focus on scheduling the 2-steps graph with UET tasks, i.e. tasks with the same length, in a heterogeneous environment where processors are uniform and have different speeds. Given a 2-steps graph of size n and p processors, we determine the lower bound of the execution time of any scheduling by maximizing the activity of each processor.(More)
  • 1