Energy-efficient multiprocessor scheduling for flow time and makespan
نویسندگان
چکیده
منابع مشابه
Energy-efficient multiprocessor scheduling for flow time and makespan
We consider energy-efficient scheduling on multiprocessors, where the speed of each processor can be individually scaled, and a processor consumes power s if it runs at speed s, where α > 1. A scheduling algorithm needs to decide both processor allocations and speeds for a set of parallel jobs whose parallelism can vary with time. The objective is to minimize the sum of overall energy consumpti...
متن کاملEnergy-Efficient Scheduling for Homogeneous Multiprocessor Systems
We present a number of novel algorithms, based on mathematical optimization formulations, in order to solve a homogeneous multiprocessor scheduling problem, while minimizing the total energy consumption. In particular, for a system with a discrete speed set, we propose solving a tractable linear program. Our formulations are based on a fluid model and a global scheduling scheme, i.e. tasks are ...
متن کاملSheet-Metal Shop Scheduling Considering Makespan and Flow Time Criteria
Sheet-metal parts typically follow a unidirectional flow in the sheet-metal shop. In the first cutting stage, a large sheet is cut to different unfolded parts with a laser cutting machine. To avoid waste material different parts are combined on a sheet. Next, the 2D parts are transformed to 3D products with air bending. In this bending stage, timeconsuming set-ups between production layouts are...
متن کاملEnergy efficient semi-partitioned scheduling for embedded multiprocessor streaming systems
In this paper, we study the problem of energyminimization whenmapping streaming applications with throughput constraints to homogeneous multiprocessor systems in which voltage and frequency scaling is supported with a discrete set of operating voltage/frequency modes. We propose a soft real-time semi-partitioned scheduling algorithm which allows an even distribution of the utilization of tasks ...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.07.007