The paper addresses the problem of scheduling periodic messages in demand priority network standardized by IEEE 802.12 Committee. As regards the real time property of the demand priority network, unnecessary blocking ...
详细信息
ISBN:
(纸本)0818685034
The paper addresses the problem of scheduling periodic messages in demand priority network standardized by IEEE 802.12 Committee. As regards the real time property of the demand priority network, unnecessary blocking time due to its round robin based MAC protocol may cause periodic messages to miss their hard deadlines and result in low schedulability of periodic messages. We propose a new message scheduling algorithm to enforce a priority based preemptive message transmission on the frame basis. Before a node transmits a periodic message, it broadcasts the priority of message for all nodes to construct a network wide ready queue in order of priority. A node can transmit a periodic message only when its message is at the head of the ready queue. We have derived sufficient and necessary conditions for both static and dynamic priority assignment in order to determine the schedulability of periodic messages. The simulation study shows that the proposed algorithm significantly improves the guarantee ratio of periodic messages.
On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and capability to handle dynamic user access patterns. Previous studies on time-critical on-demand data broadcast...
详细信息
On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and capability to handle dynamic user access patterns. Previous studies on time-critical on-demand data broadcast were under the assumption that each client requests only one data item at a time. Little work, however, has considered the on- demand broadcast with time-critical multi-item requests. In this paper, we study the problem arising in this new environment and observe that existing single item based scheduling algorithms are unable to manage multi-item requests efficiently. Thus, a new scheduling algorithm that combines the benefit of data item scheduling and request scheduling is proposed. The performance results show that the proposed algorithm is superior to other classical algorithms under a variety of factors. Our algorithm not only reduces deadline-missing ratio of requests, but also saves broadcast channel bandwidth.
Task scheduling for Distributed Control System (DCS) influences not only on the resource utilization of system, but also on the control performance of system. Firstly, loop task is investigated and task model and syst...
详细信息
ISBN:
(纸本)9781424487363
Task scheduling for Distributed Control System (DCS) influences not only on the resource utilization of system, but also on the control performance of system. Firstly, loop task is investigated and task model and system model are given. Based on heuristic task allocation method and Earliest Deadline First (EDF), the task scheduling algorithm for DCS is prevented. And the schedulable condition is given. According to the relationship of the performance of DCS and sampling periods, particle swarm optimization (PSO) algorithm is adopted to optimize the performance index of DCS. Simulation results show that the performance index of DCS can be improved obviously under condition that guarantee the tasks are finished before their deadlines by adopting the algorithm presented in this paper.
In this paper, an HSDPA packet scheduling algorithm based on particle swarm for distributed station is studied. This algorithm can be applied for non-real time service packet scheduling. A weighted object function is ...
详细信息
In this paper, an HSDPA packet scheduling algorithm based on particle swarm for distributed station is studied. This algorithm can be applied for non-real time service packet scheduling. A weighted object function is proposed for the non-real time service. The channel information and time delay information are combined by the weighted methods, and an intelligent packet scheduling algorithm is proposed where particle swarm algorithm is applied to solve this problem. The computer simulations confirm that this intelligent scheduling algorithm achieves a good compromise between the fairness of users and the throughput of the system for non-real-time service, and the performance is better than the proportional fair algorithm.
The demand for high-speed data communication and the use of real-time applications in mobile networks is becoming increasingly high and communication systems that specialise in downlink packet transfer are being devel...
详细信息
The demand for high-speed data communication and the use of real-time applications in mobile networks is becoming increasingly high and communication systems that specialise in downlink packet transfer are being developed and deployed. In these high-speed downlink packet networks, scheduling at the base station is one of the key technologies to accomplish such high speed. A scheduling algorithm that is based on the proportional fair criterion is widely used in commercial networks, but the problem with such an algorithm is that it does not schedule real-time application traffic efficiently. This paper proposes a new scheduling algorithm for real-time applications that does not need substantial change in the existing system and coexists efficiently with the proportional fair criterion. We evaluate the characteristics of the proposed algorithm through computer simulation and show that the efficiency of the proposed algorithm is better than that of existing algorithms.
Random unitary beamforming is one of the schemes reducing the amount of feedback information in multiuser diversity techniques with multiple-antenna downlink transmission. In Multiple-Input Multiple-Output (MIMO) syst...
详细信息
Random unitary beamforming is one of the schemes reducing the amount of feedback information in multiuser diversity techniques with multiple-antenna downlink transmission. In Multiple-Input Multiple-Output (MIMO) systems, throughput performance is greatly improved using AMC (Adaptive Modulation and Coding). Throughput performance is also improved by allocating power among streams appropriately. In random unitary beamforming, transmitter has only partial channel state information (CSI) of each receiver. Thus, it is difficult for random unitary beamforming to use conventional power allocation methods that use full CSI at all the receivers. In this paper, we propose a new scheduling algorithm with power allocation for downlink random unitary beamforming that improves throughput performance without full CSI. We provide numerical results of the proposed scheduling algorithm and compare them to those of the conventional random unitary beamforming scheduling algorithm.
Grid can integrate massive idle resources into a high-performance supercomputer, which is good choice for resolving the complicated engineering optimization problems. However, the heterogeneous, distributed and dynami...
详细信息
ISBN:
(纸本)9781424435296
Grid can integrate massive idle resources into a high-performance supercomputer, which is good choice for resolving the complicated engineering optimization problems. However, the heterogeneous, distributed and dynamic characters of the grid resources makes tasks scheduling are very difficult in the engineering optimization. A grid scheduling algorithm which is based on resources monitoring and load adjusting is presented for tasks scheduling in the grid environments. This method uses monitoring information of the resources to select the powerful resources and finish the initial distribution. Load adjusting will prevent the imbalance adaptively based on the feedback information form the selected resources. Simulations have been carried out and more detail analysis has been done for the algorithm. At last, a sample of injection plastic optimization was conducted on grid by using the scheduling model, and results prove that the proposed method is reasonable and effective.
The Ant Colony Optimization algorithms (ACO) are computational models inspired by the collective foraging behavior of ants. By looking at the strengths of ACO, they are the most appropriate for scheduling of tasks in ...
详细信息
ISBN:
(纸本)9781424486533
The Ant Colony Optimization algorithms (ACO) are computational models inspired by the collective foraging behavior of ants. By looking at the strengths of ACO, they are the most appropriate for scheduling of tasks in soft real-time systems. In this paper, ACO based scheduling algorithm for real-time operating systems (RTOS) has been proposed. During simulation, results are obtained with periodic tasks, measured in terms of Success Ratio & Effective CPU Utilization and compared with Earliest Deadline First (EDF) algorithm in the same environment. It has been observed that the proposed algorithm is equally optimal during under loaded conditions and it performs better during overloaded conditions.
This paper presents a dynamic and heuristic vulnerability detection of scheduling algorithm which based on host load. algorithm adjusts the detection dynamically based on the assessed value of host load. During the op...
详细信息
This paper presents a dynamic and heuristic vulnerability detection of scheduling algorithm which based on host load. algorithm adjusts the detection dynamically based on the assessed value of host load. During the operation of vulnerability detection, load estimates on the smaller host priority vulnerability detection. The algorithm is applied in real network environment of the community. The implementation of the scheduling algorithm through the actual system show that it can improve the central server's efficiency of vulnerability test effectively and reduce the adverse effect on host load at the same time.
In order to enhance the performance of networked control system, a novel scheduling algorithm is proposed. MCF (maximum-change-first) which is the simplified MEF-TOD is used to design the basic priority, and then, LDL...
详细信息
In order to enhance the performance of networked control system, a novel scheduling algorithm is proposed. MCF (maximum-change-first) which is the simplified MEF-TOD is used to design the basic priority, and then, LDLP (larger-delay-lower-priority) strategy is used to dynamically adjust the priority of the message. In the view of the importance of the message, the new scheduling algorithm called MCF-LDLP gives a more sound foundation to design the priority. The EDF, MEF and MCF-LDLP are simulated and the results are compared in IAE, settle time and override which showed that although the proposed scheduling algorithm discard more messages, the overall performance of the control system are better than the others, even under the circumstances of an over-loaded network or severe disturbance.
暂无评论