The Improvement of Real-Time Performance of 3-Tier C/S Using LAD Scheduling Algorithm in Middleware

2010 ◽  
Vol 139-141 ◽  
pp. 1789-1792
Author(s):  
Jiang Ye ◽  
Jian Li
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Client Server ◽  
The Real ◽  
Remote Monitoring System ◽  
Data Buffer ◽  
Time Performance ◽  
Earliest Deadline ◽  
Server Architecture ◽  
Client Server Architecture

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.

scholarly journals New Scheduling Algorithm for Mobile Teaching Cloud Resource Push

2018 ◽  
Vol 13 (07) ◽  
pp. 17 ◽  
Author(s):  
Qing Wan ◽  
Xueping Yang ◽  
Guanghai Chen
Keyword(s):  
Power Consumption ◽  
Real Time ◽  
Network Traffic ◽  
Scheduling Algorithm ◽  
Adaptive Scheduling ◽  
Mobile Terminals ◽  
The Real ◽  
Time Performance ◽  
Cloud Resource

In order to solve the drawbacks of the traditional message push mechanism in terms of diversity, power consumption, traffic consumption, and message real-time performance, an adaptive scheduling algorithm was designed. Based on the algorithm, an adaptive message push strategy that can dynami-cally allocate message push mode for the terminal was proposed. The exper-imental results showed that this strategy could reduce the power consumption of mobile terminals and save network traffic while adapting to the diversity of terminals. Therefore, it can ensure the real-time performance of messages.

scholarly journals Research on Embedded Multi-task Balancing Scheduling Algorithm

2018 ◽  
Vol 176 ◽  
pp. 01025
Author(s):  
Han Zhuangzhi ◽  
Ma Tianlin
Keyword(s):  
Operating System ◽  
Embedded Systems ◽  
Embedded System ◽  
Real Time ◽  
Scheduling Algorithm ◽  
Task Decomposition ◽  
The Real ◽  
Time Performance ◽  
The Embedded System ◽  
And Task

For embedded systems, there are two cases of using an operating system and not using an operating system. When the real-time task is accomplished by the embedded system of the operating system, the task needs to meet certain conditions and occupy part of the processor's resources. Therefore, based on the method of event interruption, timed interruption and task decomposition, the real-time performance of the completion of the task of the embedded system is achieved. Finally, an embedded radar track compression scheduling algorithm is designed. It is proved through experiment that the track data can be compressed and transmitted in real time.

A new client-server architecture for real-time Micro-Movement ground based SAR system

2016 ◽  
Author(s):  
Chih-Yuan Chu ◽  
Chih-Tien Wang ◽  
Cheng-Yen Chiang ◽  
Voon-Chet Koo ◽  
Yee-Kit Chan ◽  
...  
Keyword(s):  
Real Time ◽  
Client Server ◽  
Server Architecture ◽  
Client Server Architecture

Simulation on Task Scheduling for Multiprocessors Based on Improved Neural Network

2014 ◽  
Vol 513-517 ◽  
pp. 2293-2296
Author(s):  
Xiao Fang Li
Keyword(s):  
Neural Network ◽  
Real Time ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
The Real ◽  
Time Performance ◽  
Task Scheduling Algorithm ◽  
Time Requirements ◽  
Neural Network Algorithm ◽  
Feasible Solutions

This paper mainly discusses task scheduling for multiprocessors. Application requires higher performance of the multiprocessors task scheduling systems. The traditional algorithms majorly consider the accuracy and neglect the real-time performance. In order to improve the real-time performance while maintaining the accuracy, the paper proposes a task scheduling algorithm (GA-ACO) for multiprocessors based on improved neural network. It first builds mathematical models for task scheduling of multiprocessor systems, and then introduces genetic algorithms to quickly find feasible solutions. The simulation results show that the improved neural network algorithm not only has the global optimization ability of genetic algorithm, but also has both local search and the positive feedback capabilities of neural networks; compared with single optimization algorithm, it can quickly find the task scheduling solutions to meet real-time requirements, accelerate the speed of execution of the task, furthermore achieve reasonable, effective task allocation and scheduling for multi-processor.

Single Depth View Based Real-Time Reconstruction of Hand-Object Interactions

2021 ◽  
Vol 40 (3) ◽  
pp. 1-12
Author(s):  
Hao Zhang ◽  
Yuxiao Zhou ◽  
Yifei Tian ◽  
Jun-Hai Yong ◽  
Feng Xu
Keyword(s):  
Real Time ◽  
Synthetic Data ◽  
Real Data ◽  
Depth Image ◽  
Real Time System ◽  
The Real ◽  
Time Performance ◽  
Contact Constraint ◽  
Object Shapes ◽  
Object Interactions

Reconstructing hand-object interactions is a challenging task due to strong occlusions and complex motions. This article proposes a real-time system that uses a single depth stream to simultaneously reconstruct hand poses, object shape, and rigid/non-rigid motions. To achieve this, we first train a joint learning network to segment the hand and object in a depth image, and to predict the 3D keypoints of the hand. With most layers shared by the two tasks, computation cost is saved for the real-time performance. A hybrid dataset is constructed here to train the network with real data (to learn real-world distributions) and synthetic data (to cover variations of objects, motions, and viewpoints). Next, the depth of the two targets and the keypoints are used in a uniform optimization to reconstruct the interacting motions. Benefitting from a novel tangential contact constraint, the system not only solves the remaining ambiguities but also keeps the real-time performance. Experiments show that our system handles different hand and object shapes, various interactive motions, and moving cameras.

Sign in / Sign up

Export Citation Format

Share Document