Energy-aware scheduling of application execution

Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C718S102000, C718S103000, C718S104000, C718S106000, C718S107000, C713S320000

Reexamination Certificate

active

08032891

ABSTRACT:
A mobile device (10) manages tasks (18) using a scheduler (20) for scheduling tasks on multiple processors (12). To conserve energy, the set of tasks to be scheduled are divided into two (or more) subsets, which are scheduled according to different procedures. In a specific embodiment, the first subset contains tasks with the highest energy consumption deviation based on the processor that executes the task. This subset is scheduled according to a power-aware procedure for scheduling tasks primarily based on energy consumption criteria. If there is no failure, the second subset is scheduled according to a real-time constrained procedure that schedules tasks primarily based on the deadlines associated with the various tasks in the second subset. If there is a failure in either procedure, one or more tasks with the lowest energy consumption deviation are moved from the first subset to the second subset and the scheduling is repeated.

REFERENCES:
patent: 4612418 (1986-09-01), Takeda et al.
patent: 5790817 (1998-08-01), Asghar et al.
patent: 5887143 (1999-03-01), Saito et al.
patent: 6112023 (2000-08-01), Dave et al.
patent: 6112221 (2000-08-01), Bender et al.
patent: 6112225 (2000-08-01), Kraft et al.
patent: 6195676 (2001-02-01), Spix et al.
patent: 6243788 (2001-06-01), Franke et al.
patent: 6353844 (2002-03-01), Bitar et al.
patent: 6430594 (2002-08-01), Akiyama et al.
patent: 6591287 (2003-07-01), More et al.
patent: 6889330 (2005-05-01), Chauvel et al.
patent: 6986068 (2006-01-01), Togawa
patent: 2002/0019843 (2002-02-01), Killian et al.
patent: 2002/0040442 (2002-04-01), Ishidera
patent: 2002/0073129 (2002-06-01), Wang et al.
patent: 2002/0099756 (2002-07-01), Catthoor et al.
patent: 2002/0120663 (2002-08-01), Binns
patent: 2002/0124196 (2002-09-01), Morrow et al.
patent: 2003/0028659 (2003-02-01), Mesarina et al.
patent: 2003/0061260 (2003-03-01), Rajkumar
patent: 2003/0115242 (2003-06-01), Hayduk
patent: 2004/0088710 (2004-05-01), Ronkka et al.
patent: 1 182 538 (2002-02-01), None
patent: WO 02/39242 (2002-05-01), None
Rae et al. “Application-Specific heterogeneous multiprocessor synthesis using differential-evolution”, Proceeding 11thInternational Symposium, Dec. 998. pp. 83-88.
Rae et al. “Voltage reduction of application specific heterogeneous multiprocessor systems for power minimisation”, Proceedings of the ASP-Dac 2000, Jan. 2000. pp. 147-152.
Yang et al. “Energy-Aware Runtime Scheduling for Embedded-Multiprocessors SOCs”, IEEE, 2001, pp. 46-58.
Raghunathan et al. “Adaptive Power-Fidelity in Energy-Aware Wireless Embedded Systems”, IEEE, 2001, pp. 106-115.
Swaminathan et al. “Real-time task scheduling for energy-aware embedded systems”, The Franklin Institute. Publsihed by Elsevier Science Ltd. 2001, pp. 729-750.
“A Parallel Algorthm for Preemptive Scheduling of Uniform Machines”, Charles U. Martel, Journal of Parallel and Distributed Computing Academic Press, Duluth, MN, US, vol. 5, No. 6, Dec. 1, 1988, pp. 700-715, XP000007702, ISSN: 0743-7315.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Energy-aware scheduling of application execution does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Energy-aware scheduling of application execution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Energy-aware scheduling of application execution will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4280395

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