Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Computer Science Faculty Proceedings & Presentations

Series

Optimal algorithms

Publication Year

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

Dynamic Energy Aware Task Scheduling For Periodic Tasks Using Expected Execution Time Feedback, Sachin Pawaskar, Hesham Ali Feb 2008

Dynamic Energy Aware Task Scheduling For Periodic Tasks Using Expected Execution Time Feedback, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

Scheduling dependent tasks is one of the most challenging problems in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. An interesting application of scheduling is in the area of energy awareness for mobile battery operated devices where minimizing the energy utilized is the most important scheduling policy consideration. A number of heuristics have been developed for this consideration. In this paper, we study the scheduling problem for a particular battery model. In the proposed work, we show how to enhance a well know approach of accounting for …


Dynamic Energy Aware Task Scheduling Using Run-Queue Peek, Sachin Pawaskar, Hesham Ali Feb 2007

Dynamic Energy Aware Task Scheduling Using Run-Queue Peek, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

Scheduling dependent tasks is one of the most challenging problems in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. An interesting application of scheduling is in the area of energy awareness for mobile battery operated devices where minimizing the energy utilized is the most important scheduling policy consideration. A number of heuristics have been developed for this consideration. In this paper, we study the scheduling problem for a particular battery model. In the proposed work, we show how to enhance a well know approach of accounting for …


A Maximal Chain Approach For Scheduling Tasks In A Multiprocessor Systems, Sachin Pawaskar, Hesham Ali Nov 2004

A Maximal Chain Approach For Scheduling Tasks In A Multiprocessor Systems, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

Scheduling dependent tasks is one of the most challenging versions of the scheduling problem in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. As a result, researchers have studied restricted forms of the problem by constraining either the task graph representing the parallel tasks or the computer model. Also, in an attempt to solve the problem in the general case, a number of heuristics have been developed. In this paper, we study the scheduling problem for a fixed number of processors m. In the proposed work, we …