A high-speed dynamic instruction scheduling scheme for supersealar processors

2005 ◽  
Author(s):  
M. Goshima ◽  
K. Nishino ◽  
Y. Nakashima ◽  
S. Mori ◽  
T. Kitamura ◽  
...  
Keyword(s):  
High Speed ◽  
Instruction Scheduling ◽  
Scheduling Scheme

scholarly journals A Channel Based Fair Scheduling Scheme For Downlink High Speed Data In CDMA Networks

2021 ◽  
Author(s):  
Ying Zhao
Keyword(s):  
High Speed ◽  
Packet Scheduling ◽  
Radio Resource Management ◽  
Research Work ◽  
Tolerance Factor ◽  
System Throughput ◽  
Fair Allocation ◽  
Scheduling Scheme ◽  
Cdma Networks ◽  
High Speed Data

High speed data transmission in wireless networks demands better radio resource management schemes. The research work for this thesis considers packet scheduling in downlinks of a cellular CDMA system for delay-tolerant applications. In this thesis, a packet scheduling scheme is proposed that attempts to provide fair allocation of individuals throughout and obtain relatively high system throughput. It is based on combined consideration of channel conditions, required throughput and achieved average throughput. A priority factor and system tolerance factor are introduced. We confirmed the trade-off between system throughout (i.e., efficiency) and individual throughput (i.e., fairness) by both analysis and simulation. Relative performance between the proposed scheme and traditional schemes is evaluated through simulation to confirm the analytical observations. The sensitivity of system tolerance factor towards efficiency and fairness was also investigated. Overall, the proposed scheme performs between absolute unfairness scheme and absolute fairness scheme in term s of system throughput and fair allocation of individual throughput.

scholarly journals Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Yu Zhou ◽  
Leishan Zhou ◽  
Yun Wang
Keyword(s):  
High Speed ◽  
Ant Colony Algorithm ◽  
Travel Demand ◽  
Maintenance Cost ◽  
High Speed Railway ◽  
Scheduling Scheme ◽  
Scheduling Model ◽  
Traditional Approaches

High-speed railway is one of the most important ways to solve the long-standing travel difficulty problem in China. However, due to the high acquisition and maintenance cost, it is impossible for decision-making departments to purchase enough EMUs to satisfy the explosive travel demand. Therefore, there is an urgent need to study how to utilize EMU more efficiently and reduce costs in the case of completing a given task in train diagram. In this paper, an EMU circulation scheduling model is built based on train diagram constraints, maintenance constraints, and so forth; in the model solving process, an improved ACA algorithm has been designed. A case study is conducted to verify the feasibility of the model. Moreover, contrast tests have been carried out to compare the efficiency between the improved ACA and the traditional approaches. The results reveal that improved ACA method can solve the model with less time and the quality of each representative index is much better, which means that efficiency of the improved ACA method is higher and better scheduling scheme can be obtained.

Sign in / Sign up

Export Citation Format

Share Document