Computer Science – Data Structures and Algorithms
Scientific paper
2011-05-26
Computer Science
Data Structures and Algorithms
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.
Felber David
Meyerson Adam
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-216971