Sciweavers

47 search results - page 8 / 10
» Parallel machine scheduling with precedence constraints and ...
Sort
View
JSSPP
2000
Springer
13 years 9 months ago
Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
Fabrizio Petrini, Wu-chun Feng
IPPS
2006
IEEE
13 years 11 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
ICCCN
2007
IEEE
14 years 2 days ago
An Energy-Efficient Scheduling Algorithm Using Dynamic Voltage Scaling for Parallel Applications on Clusters
In the past decade cluster computing platforms have been widely applied to support a variety of scientific and commercial applications, many of which are parallel in nature. Howev...
Xiaojun Ruan, Xiao Qin, Ziliang Zong, Kiranmai Bel...
ICDCS
1995
IEEE
13 years 9 months ago
Analysis of Resource Lower Bounds in Real-Time Applications
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
Raed Alqadi, Parameswaran Ramanathan
IOR
2007
106views more  IOR 2007»
13 years 5 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker