This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value

scheduling aimed at capturing some key aspects of energy minimization. In this model, each job is to be executed between its arrival time and deadline by a single processor with variable speed, under the assumption that energy usage per unit time, P, is a convex function of the processor speed s. We give

Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activities for applications with loops. We show that to find a schedule that has the minimal switching activities among all

The design challenge for large-scale multiprocessors is (1) to minimize communication overhead, (2) allow communication to overlap computation, and (3) coordinate the two without sacrificing processor cost/performance. We show that existing message passing multiprocessors have unnecessarily high

by a clear strategy that arose from a theoretical analysis of the scheduling algorithm: concentrate on minimizing overheads that contribute to the work, even at the expense of overheads that contribute to the critical path. Although it may seem counterintuitive to move overheads onto the critical path

tardiness to corresponding cost function values. A novel cost-minimizing scheduling framework is introduced to schedule requests of workflows so as to minimize the sum of cost func-tion values for all workflows. The utility of the proposed scheduler is compared to another previously known scheduling policy

The Highball Project is developing a high speed, packet-switched network using distributed reservation and scheduling algorithms. In order to ensure a consistent global state at all times in this model, reservation requests for data bursts must be received by all the nodes before the bursts can

• The LMP formulation has been revised in MR-382 • Previous formulation that was approved as part of (MR-00348-R06) mimics the LMP formulation used by the Dispatch Scheduling Optimization (DSO) engine • The revision addresses the differences between how the Day-Ahead Calculation Engine (DACE

n a hard real-time cyctem, every time-T critical task must meet its timing con-1 straint, typically specified as its deadline. (A task is a granule of computa-tion treated by the scheduler as a unit of work to be allocated processor time, or scheduled.) If any time-critical task fails to complete

Time-indexed linear programming formulations have recently received a great deal of attention for their practical effectiveness in solving a number of single-machine scheduling problems. We show that these formulations are also an important tool in the design of approximation algorithms with good