Multi-core processors are already prevalent in general-purpose computing systems with manufacturers currently offering up to a dozen cores per processor. Real-time and embedded systems adopting such processors gain increased computational capacity, improved parallelism, and higher performance per watt. However, using multi-core processors in real-time applications also introduces new challenges...

task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other on...

this paper proposes a novel technique for solving generation scheduling and ramp rate constrained unit commitment. a modified objective function associated with a new start-up cost term is introduced in this paper. the proposed method is used to solve generating scheduling problem satisfying srr, minimum up and down time as well as ramp rate constraints. two case studies are conducted to implem...

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. hence, integration has been proposed to decide about these problems concurrently. main problem in integration is how we can relate pro...

proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified mach...

In this paper we study the performance gain achieved by introducing dynamic subcarrier scheduling schemes to OFDM systems in the presence of heterogeneous traffic streams. Dynamic subcarrier scheduling copes with channel state variation by dynamically assigning different subcarriers to terminals, e.g. in the downlink of a cellular system. In addition to the channel state variations, also the ar...

In this paper we study the performance gain achieved by introducing dynamic subcarrier scheduling schemes to OFDM systems in the presence of heterogeneous traffic streams. Dynamic subcarrier scheduling copes with channel state variation by dynamically assigning different subcarriers to terminals, e.g. in the downlink of a cellular system. In addition to the channel state variations, also the ar...

Interest in broadband wireless access (BWA) has been growing due to increased user mobility and the need for data access at all times. IEEE 802.16e based WiMAX networks promise the best available quality of experience for mobile data service users. Unlike wireless LANs, WiMAX networks incorporate several quality of service (QoS) mechanisms at the Media Access Control (MAC) level for guaranteed ...

MESSIAHS is a set of mechanisms supporting task placement in heterogeneous, distributed, autonomous systems. MESSIAHS provides a substrate on which scheduling algorithms can be implemented. The chief design goals for MESSIAHS include support for autonomy, flexibility, scalability and efficiency. These mechanisms were designed to support diverse task placement and load balancing algo-