Scheduling under Precedence, Communication, and Energy Constraints

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We consider the problem of scheduling a set of $n$ tasks on $m$ processors under precedence, communication, and global system energy constraints to minimize makespan. We extend existing scheduling models to account for energy usage and give convex programming algorithms that yield essentially the same results as existing algorithms that do not consider energy, while adhering to a strict energy bound.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Scheduling under Precedence, Communication, and Energy Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scheduling under Precedence, Communication, and Energy Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling under Precedence, Communication, and Energy Constraints will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-216971

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.