Task scheduling and virtual machine allocation policy in cloud computing environment

Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time of data intensive tasks. How- ever, most of the current resource allocation policies focus only on network conditions and physical hosts. And the computing power of VMs is largely ignored. This paper proposes a comprehensive resource allocation policy which consists of a data intensive task scheduling algorithm that takes account of computing power of VMs and a VM allocation policy that considers bandwidth between storage nodes and hosts. The VM allocation policy includes VM placement and VM migration algorithms. Related simulations show that the proposed algorithms can greatly reduce the task comple- tion time and keep good load balance of physical hosts at the same time.

Flexible Task Scheduling Based on Edge Computing and Cloud Collaboration

With the rapid development and popularization of 5G and the Internetof Things, a number of new applications have emerged, such as driverless cars.Most of these applications are time-delay sensitive, and some deficiencies werefound during data processing through the cloud centric architecture. The data generated by terminals at the edge of the network is an urgent problem to be solved atpresent. In 5 g environments, edge computing can better meet the needs of lowdelay and wide connection applications, and support the fast request of terminalusers. However, edge computing only has the edge layer computing advantage,and it is difficult to achieve global resource scheduling and configuration, whichmay lead to the problems of low resource utilization rate, long task processingdelay and unbalanced system load, so as to lead to affect the service quality ofusers. To solve this problem, this paper studies task scheduling and resource collaboration based on a Cloud-Edge-Terminal collaborative architecture, proposes agenetic simulated annealing fusion algorithm, called GSA-EDGE, to achieve taskscheduling and resource allocation, and designs a series of experiments to verifythe effectiveness of the GSA-EDGE algorithm. The experimental results showthat the proposed method can reduce the time delay of task processing comparedwith the local task processing method and the task average allocation method.

A Low Complexity Algorithm for Subcarrier-and-Bit Allocation in OFDMA-Based LTE Systems

In this paper, we propose optimum and sub-optimum resource allocation and opportunistic scheduling solutions for orthogonal frequency division multiple access （OFDMA）-based multicellular systems. The applicability, complexity, and performance of the proposed algorithms are analyzed and numerically evaluated. In the initial setup, the fractional frequency reuse （FFR） technique for inter-cell interference cancellation is applied to classify the users into two groups, namely interior and exterior users. Adaptive modulation is then employed according to the channel state information （CSI） of each user to meet the symbol error rate （SER） requirement. There then, we develop subcarrier-and-bit allocation method, which maximizes the total system throughput subject to the constraints that each user has a minimum data rate requirement. The algorithm to achieve the optimum solution requires high computational complexity which hinders it from practicability. Toward this suboptimum method with the reduced to the order of O（NIO, the total number of subcarriers end, we complexity propose a extensively where N and K denote and users, respectively. Numerical results show that the proposed algorithm approaches the optimum solution, yet it enjoys the features of simplicity, dynamic cell configuration, adaptive subearrier-and-bit allocation, and spectral efficiency.

Research on Key Technology of Web Vulnerability Detection System Based on Cloud Environment

In the light of the defect of web vulnerability detection system, combined with the characteristics of high efficient and sharing in the cloud environment, a design proposal is presented based on cloud environment, which analyses the key technology of gaining the URL, task allocation and scheduling and the design of attack detection. Experiment shows its feasibility and effectiveness in this paper.

Tabu search based resource allocation in radiological examination process execution

Efficient resource scheduling and allocation in radiological examination process （REP） execution is a key requirement to improve patient throughput and radiological resource utilization and to manage unexpected events that occur when resource scheduling and allocation decisions change due to clinical needs. In this paper, a Tabu search based approach is presented to solve the resource scheduling and allocation problems in REP execution. The primary objective of the approach is to minimize a weighted sum of average examination flow time, average idle time of the resources, and delays. Unexpected events, i.e., emergent or absent examinations, are also considered. For certain parameter combinations, the optimal solution of radielogical resource scheduling and allocation is found, while considering the limitations such as routing and resource constraints. Simulations in the application case are performed. Results show that the proposed approach makes efficient use ofradiological resource capacity and improves the patient throughput in REP execution.

Improved resource allocation strategy in SU-CoMP network

Coordinated multi-point transmission and reception （CoMP） for single user, named as SU-CoMP, is considered as an efficient approach to mitigate inter-cell interference in orthogonal frequency division multiple access （OFDMA） systems. Two prevalent approaches in SU-CoMP are coordinated scheduling （CS） and joint processing （JP）. Although JP in SU-CoMP has been proved to achieve a great link performance improvement for the cell-edge user, efficient resource allocation （RA） on the system level is quite needed. However, so far limited work has been done considering JP, and most existing schemes achieved the improvement of cell-edge performance at cost of the cell-average performance degradation compared to the single cell RA. In this paper, a two-phase strategy is proposed for SU-CoMP networks. CS and JP are combined to improve both cell-edge and cell-average performance. Compared to the single cell RA, simulation results demonstrate that, the proposed strategy leads to both higher cell-average and cell-edge throughput.