This paper studied the real-time performance of three-tier client/server architecture used in remote monitoring system. A scheduling algorithm was adopted in middleware of this architecture, which based on the regulat...
详细信息
ISBN:
(纸本)9780878492268
This paper studied the real-time performance of three-tier client/server architecture used in remote monitoring system. A scheduling algorithm was adopted in middleware of this architecture, which based on the regulation: setting the priority of task according to the percentage of useful data in the data-buffer or the LAD (most locally available data first) but not according to the earliest deadline. Contrast simulation of the improved algorithm and EDF (earliest deadline first algorithm) had been achieved from program developed using VC++ at different average task lengths and update workloads under the tentative parameters such as the size of data in different data-buffer, the time used for fetch an object from these data-buffers and average task inter-arrival time. The results showed that the LAD's completed task percentage before deadlines was higher than EDF, which proved LAD was more suitable to improve the real-time performance of three-tier client/server architecture.
High-speed ATM switches mostly implement the memory architecture of advanced input queuing for unicast traffic. When handling multicast traffic this is infeasible due to the high cost it inserts. A set of multicast sc...
详细信息
ISBN:
(纸本)0780382927
High-speed ATM switches mostly implement the memory architecture of advanced input queuing for unicast traffic. When handling multicast traffic this is infeasible due to the high cost it inserts. A set of multicast scheduling algorithms implementing input queuing has been proposed in the past. In this paper we present a new multicast scheduling algorithm, FINE, that maintains multiple queues for incoming packets in an M x N switch, a total of 2(N) - 1 queues. FINE provides improved characteristics over alternatives as to the throughput it achieves and the fairness it ensures. In addition, it presents suppleness in keeping with the system's properties and its applications features.
Integration of efficient scheduling policies in radio resource management (RRM) strategies is nowadays, of a paramount importance for the success deployment of wireless Long Term Evolution (LTE) systems. This is parti...
详细信息
ISBN:
(纸本)9781479951789
Integration of efficient scheduling policies in radio resource management (RRM) strategies is nowadays, of a paramount importance for the success deployment of wireless Long Term Evolution (LTE) systems. This is particularly effective for downlink where data rates are important and where scheduling decision should enable to allocate, in each Transmission Time Interval (TTI), appropriate resource blocks (RBs) to each mobile user equipment (UE) taking into account several criteria such as channel quality and fairness requirements. In this paper we propose a novel packet scheduling algorithm developed for downlink LTE systems and we investigate its performances compared to three existing scheduling algorithms i.e. Time and Frequency Domain Round Robin (FDRR) Downlink, Best CQI and MY_SCH_Not_Fair [1]. Performance analysis of these algorithms is investigated by simulation of different scenarios in order to evaluate and compare several metrics such as global cell throughput, achievable user throughput and the number of served users. Numerical results show that the implementation of our new proposed algorithm provides significant improvements of the overall system capacity. The main contribution of this algorithm is to enable a better tradeoff between throughput and fairness compared to the above algorithms.
scheduling algorithm is an important step in cloud computing, which determines the effectiveness of the system. Focus on the business requirement of mimic common operating environment (MCOE), especially the incomplete...
详细信息
ISBN:
(纸本)9781728128658
scheduling algorithm is an important step in cloud computing, which determines the effectiveness of the system. Focus on the business requirement of mimic common operating environment (MCOE), especially the incomplete consideration of load balancing and heterogeneous in traditional scheduling algorithms, this paper presents an entropy weight clustering scheduling (EWCS) algorithm, which combines the dynamic heterogeneous redundancy (DHR) architecture of mimetic defense theory and K-Means clustering of machine learning to complete the nodes selection on the cloud platform. This algorithm consists of four steps: risk value screening, load balancing, entropy weight calculation and clustering optimization. The simulation results show that the algorithm is reasonable and can serve MCOE well. It is also an effective attempt to apply machine learning method to scheduling problem.
This paper discusses the packet scheduling algorithm for WEAN differentiated services. To support applications with quality of service requirements, such as video, audio, voice over IP and other multimedia application...
详细信息
ISBN:
(纸本)9781424436927
This paper discusses the packet scheduling algorithm for WEAN differentiated services. To support applications with quality of service requirements, such as video, audio, voice over IP and other multimedia applications in wireless networks, WMM adds prioritized QoS capabilities to Wi-Fi networks and optimizes their performance when multiple concurring applications, each with different latency and throughput requirements, compete for network resources. To realize such proportional throughput and latency differentiated services, this paper presents parameter-dependent priority scheduling algorithm, referred as Arbitrary Channel Reservation, for 802.11e networks. Experiments are carried out to illustrate the throughput performances for different access category under real traffic workloads.
Computational Grids provide computing power by sharing resources across administrative domains. This sharing, coupled with the need to execute distrusted task from arbitrary users, introduces security hazards. This st...
详细信息
ISBN:
(纸本)3540482741
Computational Grids provide computing power by sharing resources across administrative domains. This sharing, coupled with the need to execute distrusted task from arbitrary users, introduces security hazards. This study mainly examines the integration of the notion of "trust" into resource management based on Grid economic model to enhance Grid security. Our contributions are two-fold: First, we propose a trust function which based on dynamic trust changing and construct a Grid trust model based on behavior. Second, we present trust-aware time optimization scheduling algorithm within budget constraints and trust-aware cost optimization scheduling algorithm within deadline constraints. The performance of these algorithms excels that of algorithm without considering trust via theory analysis and simulation experiment.
To solve the problem of high overall scheduling cost in existing cloud based workflow scheduling algorithms when facing a large number of microservice tasks, a microservice workflow scheduling algorithm based on dynam...
详细信息
ISBN:
(纸本)9798350386783;9798350386776
To solve the problem of high overall scheduling cost in existing cloud based workflow scheduling algorithms when facing a large number of microservice tasks, a microservice workflow scheduling algorithm based on dynamic resource selection strategy (DRSS) is proposed - DRSS scheduling algorithm. By utilizing the position of tasks in the workflow to determine their sub deadlines and scheduling priorities, a dynamic resource selection strategy is adopted to schedule tasks and obtain the optimal resources for task execution. Based on this, the task status and resource vector of virtual machine instances are updated. The experimental results show that this algorithm is superior to similar algorithms in terms of scheduling success rate and cost.
For a certain real-time task scheduling problems with characteristics of uncertain task sets, the executing time dynamic changing and the task's mutual coupling strength dynamic changing, a multi-tasking dynamic s...
详细信息
ISBN:
(纸本)9780769536354
For a certain real-time task scheduling problems with characteristics of uncertain task sets, the executing time dynamic changing and the task's mutual coupling strength dynamic changing, a multi-tasking dynamic scheduling algorithm is proposed based on dynamic weight value compensation and adaptive task jumping, which solved the loads storming caused by the dynamic task scheduling as well as the too long system response time caused by the changes of the tasks' coupling coefficient. The scheduling diagram and function of the modules are given firstly. Then, the focuses are the implementation of the execution controller and the weight compensation method based on the research of task weight value, the weight compensation and weight classification. The reliability and efficiency of the algorithm is verified by comparing tests, and has been applied to the combining heavy-duty train's braking condition monitoring and early warning system.
The core concept of cloud computing is the resource pool. Hadoop MapReduce is a software framework for easily writing applications which process vast amounts of data in-parallel on large clusters of commodity hardware...
详细信息
ISBN:
(纸本)9783642242816;9783642242823
The core concept of cloud computing is the resource pool. Hadoop MapReduce is a software framework for easily writing applications which process vast amounts of data in-parallel on large clusters of commodity hardware in a reliable, fault-tolerant manner. A MapReduce job usually splits the input data-set into independent chunks which are processed by the map tasks in a completely parallel manner. We distribute the total slots according to Pi which is the percent of job's unfulfilled tasks in the total unfulfilled tasks. Since the Pi of the large job is bigger, the large job will be allocated more slots. We can clearly improve the response time of the large jobs. This new scheduling algorithm can improve the performance of the system, such as throughout, response time.
By analyzing the priority arbitration bit by bit without destroy in can bus rule, the article elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority's mess...
详细信息
ISBN:
(纸本)9783038352914
By analyzing the priority arbitration bit by bit without destroy in can bus rule, the article elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority's messages will be much more delayed, even lose some data when the bus's bandwidth is widely used and scheduling can't be modified during the system. The dynamic priority promoting method and math model of SQSA and SQMA is achieved in the article, it analyses the model's rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, It is validated that the method of improved dynamic in the article has good performances on the network rate of taking in and sending out in large quantities, the average delay and the rate of network usage by emulational experiments.
暂无评论