In this paper we address a new problem that has not been addressed in the past: how to improve energy efficiency for both unicast and multicast services without violating QoS requirements of mobile stations in 802.16e...
详细信息
In this paper we address a new problem that has not been addressed in the past: how to improve energy efficiency for both unicast and multicast services without violating QoS requirements of mobile stations in 802.16e wireless networks. We propose a scheduling set based integrated scheduling (SSBIS) algorithm to solve the problem. SSBIS partitions all the mobile stations into multicast scheduling Sets and a unicast scheduling Set on the principle of minimizing mobile stations' energy consumptions by making use of the multicast transmission scheme and it adopts different scheduling policies based on the attributes of the scheduling Sets to improve energy efficiency of the whole system. Numerical results show that SSBIS can result in a significant overall energy saving while at the same time guaranteeing the minimum data rates of mobile stations.
IEEE 802.16e standard defines a wireless broadband access network technology. The standard specifies the QoS support at the MAC level. To meet the QoS requirements, the scheduling algorithm at base station (BS) has to...
详细信息
IEEE 802.16e standard defines a wireless broadband access network technology. The standard specifies the QoS support at the MAC level. To meet the QoS requirements, the scheduling algorithm at base station (BS) has to efficiently allocate slots for each connection request. The standard does not specify the detailed algorithm but leaves it open for implementation. In this paper, a Slot-based BS scheduling algorithm with Maximum Latency Guarantee and Capacity First (SMLG-CF) is proposed. With SMLG-CF, the connection is chosen with highest slot capacity first. With the assistance of dynamic sub-frame adjustment, the average system transmission rate can be enhanced. Through the finer slots calculation and proper allocation of transmission time and frequency, the maximum latency guarantee can be achieved for urgent requests. We simulate and compare the proposed mechanism with deficit fair priority queue (DFPQ) scheduling algorithm and Highest Urgency First (HUF) scheduling algorithm in terms of maximum latency violation rate and average transmission rate. The simulation results reveal that the applicability of the proposed mechanism.
In this work, we study the behaviour of different resource scheduling strategies when doing job orchestration in grid environments. We empirically demonstrate that scheduling strategies based on reinforcement learning...
详细信息
In this work, we study the behaviour of different resource scheduling strategies when doing job orchestration in grid environments. We empirically demonstrate that scheduling strategies based on reinforcement learning are a good choice to improve the overall performance of grid applications and resource utilization.
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and is therefore NP-complete. However a co...
详细信息
ISBN:
(纸本)9780780358324
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and is therefore NP-complete. However a commonly-encountered instance of this problem (m=2) can be solved in polynomial time. For the general case (m>2), we present a mixed-integer linear programming (MILP) model for optimal scheduling and apply it to a representative core-based system using an MILP solver. We also extend the MILP model to allow optimal test set selection from a set of alternatives. Finally we present an efficient heuristic algorithm for handling larger systems for which the MILP model may be infeasible.
The use of the reservation table technique to create optimal cyclic schedules is explored. A detailed discussion and analyses are presented of the properties that determine the theoretical maximum initiation rate, the...
详细信息
The use of the reservation table technique to create optimal cyclic schedules is explored. A detailed discussion and analyses are presented of the properties that determine the theoretical maximum initiation rate, the set of all possible initiation strategies, efficient strategies that yield the maximum realizable performance, and the methods for adding delay to a reservation table so that its maximum realizable rate achieves the theoretical maximum rate. These methods inherently allow multiple devices to be reserved concurrently. They can deal with transport time explicitly. They achieve higher initiation rates by including cycles that involve multiple job initiations. The optimizations are fully valid, not heuristic. These scheduling algorithms can be coupled with the planning environment reported by J.K. Chaar and R.A. Volz (1989). The integrated planning/scheduling framework forms a major component of a software engineering environment that the authors are currently developing.< >
scheduling schemes have important effects on the performance of load sharing in distributed *** the load sharing policy based on CPU-memory has made the system memory an important role in effecting the system performa...
详细信息
scheduling schemes have important effects on the performance of load sharing in distributed *** the load sharing policy based on CPU-memory has made the system memory an important role in effecting the system performance, it can reduce the paging fault and enhance the usage of the system resource. In light of the characteristics of the load sharing based on the CPU-memory and the variation of the jobs in executing, new CPU local scheduling schemes named more memory-request more CPU Slice based on Round Robin (RR-MMMCS) mechanism and more memory-request more CPU slice based on predicting (MMMCS-P) mechanism, are ***, the effects on the load sharing policy based on the CPU-memory of the variance of the interarrival time and service time are discussed. The tracedriven simulations show that the load sharing policy based on the CPU-memory and RR-MMMCS,MMMCS-P scheduling schemes are effective and have better performance in average response time for both CPU-memory and memory-bound jobs.
Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI) is available. Under fast fading, howeve...
详细信息
ISBN:
(纸本)9781424435128
Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI) is available. Under fast fading, however, the channel may change too quickly for the scheduler to track the instantaneous CSI. In this paper, instead of the instantaneous CSI, the scheduler performs its task according to the stochastic behavior of the channel state. A basic schedule consists of a set of simultaneously transmitting links. The essence of the scheduling problem is to determine a mixed schedule consisting of a weighted sum (TDMA mixture) of a number of basic schedules to optimize a certain utility objective. A key to reducing scheduling complexity is to identify the Pareto-efflcient basic schedules, referred to as the extreme-point schedules, so that the construction of the optimal mixed schedule can be based on the extreme-point schedules rather than all the basic schedules. The precise identification of the extreme-point schedules, however, is intractable computationally. We show in this paper that identifying a slightly larger superset of the extreme-point schedules can be highly efficient using a Perron-Frobenius condition: simulation experiments indicate that oftentimes there are only very few extraneous non-extreme-point schedules in the superset. Building on the effective identification method, we propose a fast scheduling algorithm. This algorithm beats the algorithm without using the identification method by a complexity-reduction factor of 166 in a 15-link network. In addition, numerical results suggest that our algorithm is robust to variations of system parameters.
A fuzzy production system for multiobjective scheduling is described in this paper. Based on the heuristic search principle in AI, this system takes the heuristic algorithms used for finding optimal or quasi optimal s...
详细信息
A fuzzy production system for multiobjective scheduling is described in this paper. Based on the heuristic search principle in AI, this system takes the heuristic algorithms used for finding optimal or quasi optimal sequences of different single objectives as the production rules, and the fuzzy min-operator with nonlinear membership function as the test criterion. It is able to find an optimal or quasi-optimal processing sequence to meet many different objective functions simultaneously.
Transmission scheduling is a key design problem in wireless multi-hop networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time division multiple access (...
详细信息
Transmission scheduling is a key design problem in wireless multi-hop networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time division multiple access (TDMA) frame length. There exists some interesting scheduling algorithms called topology-transparent TDMA scheduling algorithms, which do not require the detailed topology information, and are suitable for the wireless environment. However, a framework to compare the performance of these algorithms properly and fairly is still lacking. The objective of this work is to propose a uniform framework for topology-transparent scheduling algorithms. Under some fundamental constraints, an optimal solution is provided to the scheduling problem of topology-transparent algorithms. Furthermore, under the proposed framework, we analyze the relationship among all existing topology-transparent algorithms. We then develop an adaptive topology-transparent algorithm, which can always give an optimal solution under a set of the system design parameters.
暂无评论