Research on Simulation Analysis of Elimination Conflicts in Large Financial System

2014 ◽  
Vol 687-691 ◽  
pp. 4890-4893
Author(s):  
Zhen Sheng Zhuang
Keyword(s):  
Task Scheduling ◽  
Single Channel ◽  
Simulation Analysis ◽  
Scheduling Algorithm ◽  
Financial System ◽  
Data Matrix ◽  
Dynamic Feedback ◽  
Dynamic Relationship ◽  
The Matrix ◽  
Feedback Scheduling

Data of financial system traffic randomness large, the data is not fixed to a single channel by multiple users is difficult to form a unified task scheduling rules. In this paper, we put forward a multi-user flexible financial system task scheduling algorithm based on decision distance. The algorithm adopted decision distance can get the data of dynamic relation matrix, and use dynamic feedback scheduling method to control the matrix, in order to ensure the rationality of the task allocation and reduced the probability of task conflict in the system. The dynamic feedback scheduling decisions distance can analyze data from the use of case decisions using the resource nodes, get the dynamic relationship between data matrix, the matrix is ​​analyzed to extract maximum data connection group with no maximum data connections correlation data, which will be filtered with a smaller maximum data associated with the connection data.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

2020 ◽  
Vol 13 ◽  
Author(s):  
Ge Weiqing ◽  
Cui Yanru
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Task Completion ◽  
Improved Genetic Algorithm ◽  
Fitness Functions ◽  
Task Scheduling Algorithm ◽  
Simulation Results

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

ExperimentSubset: an R package to manage subsets of Bioconductor Experiment objects

2021 ◽  
Author(s):  
Irzam Sarfraz ◽  
Muhammad Asif ◽  
Joshua D Campbell
Keyword(s):  
Single Cell ◽  
R Package ◽  
Poor Quality ◽  
Data Matrix ◽  
Supplementary Information ◽  
Data Provenance ◽  
Rna Seq ◽  
Efficient Management ◽  
The Matrix ◽  
The Relationship

Abstract Motivation R Experiment objects such as the SummarizedExperiment or SingleCellExperiment are data containers for storing one or more matrix-like assays along with associated row and column data. These objects have been used to facilitate the storage and analysis of high-throughput genomic data generated from technologies such as single-cell RNA sequencing. One common computational task in many genomics analysis workflows is to perform subsetting of the data matrix before applying down-stream analytical methods. For example, one may need to subset the columns of the assay matrix to exclude poor-quality samples or subset the rows of the matrix to select the most variable features. Traditionally, a second object is created that contains the desired subset of assay from the original object. However, this approach is inefficient as it requires the creation of an additional object containing a copy of the original assay and leads to challenges with data provenance. Results To overcome these challenges, we developed an R package called ExperimentSubset, which is a data container that implements classes for efficient storage and streamlined retrieval of assays that have been subsetted by rows and/or columns. These classes are able to inherently provide data provenance by maintaining the relationship between the subsetted and parent assays. We demonstrate the utility of this package on a single-cell RNA-seq dataset by storing and retrieving subsets at different stages of the analysis while maintaining a lower memory footprint. Overall, the ExperimentSubset is a flexible container for the efficient management of subsets. Availability and implementation ExperimentSubset package is available at Bioconductor: https://bioconductor.org/packages/ExperimentSubset/ and Github: https://github.com/campbio/ExperimentSubset. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Software-Defined Optimal Computation Task Scheduling in Vehicular Edge Networking

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 955
Author(s):  
Zhiyuan Li ◽  
Ershuai Peng
Keyword(s):  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Dynamic Network ◽  
Parameter Tuning ◽  
Global Optimum ◽  
Research Field ◽  
Edge Computing ◽  
Transmission Delay ◽  
Smart Vehicles ◽  
Network Bandwidth

With the development of smart vehicles and various vehicular applications, Vehicular Edge Computing (VEC) paradigm has attracted from academic and industry. Compared with the cloud computing platform, VEC has several new features, such as the higher network bandwidth and the lower transmission delay. Recently, vehicular computation-intensive task offloading has become a new research field for the vehicular edge computing networks. However, dynamic network topology and the bursty computation tasks offloading, which causes to the computation load unbalancing for the VEC networking. To solve this issue, this paper proposed an optimal control-based computing task scheduling algorithm. Then, we introduce software defined networking/OpenFlow framework to build a software-defined vehicular edge networking structure. The proposed algorithm can obtain global optimum results and achieve the load-balancing by the virtue of the global load status information. Besides, the proposed algorithm has strong adaptiveness in dynamic network environments by automatic parameter tuning. Experimental results show that the proposed algorithm can effectively improve the utilization of computation resources and meet the requirements of computation and transmission delay for various vehicular tasks.

Sign in / Sign up

Export Citation Format

Share Document