Papers by Keyword: Resource Allocation

Abstract: Cloud computing is provides resource allocation which facilitates the cloud resource provider responsible to the cloud consumers. The main objective of resource manager is to assign the dynamic resource to the task in the execution and measures response time, execution cost, resource utilization and system performance. The resource manager is optimizing the resource and measure the completion time for assign resource. The resource manager is also measure to execute the resource in the optimal way to complete the task in minimum completion time. The virtualization is techniques mandatory to allocate the dynamic resource depends on the users need. There are also green computing techniques involved for enhanced the no of server. The skewness is basically used to enhance the quality of service using the various parameters. The proposed algorithms are considered to allocate the cloud resource as per the users requirement. The advantage of proposed algorithm is to view the analysis of cpu utilization and also reduced the memory usage.

Abstract: In this paper, a centralized inter-network resource allocation scheme is proposed aiming at the inter-network interference problem in Wireless Body Area Networks (WBAN). To achieve the goal, a centralized inter-network resource allocation algorithm called CRAS is proposed. Extensive simulation results show the effectiveness of CRAS in ensuring the normal communication of WBAN users and reducing allocation failure number, comparing with RAN.

Abstract: In the dense crowded area, the communication resource allocation method has a very broad application space in the communication research field. Therefore, an improved communication resource distribution method in the dense crowded area is proposed based on pheromone search algorithm. In the dense crowded area, the regional communication network is constructed, and the pheromone of each resource node is taken with initialization processing. The collection of communication resource allocation task is obtained, the execution time of task is calculated, and the communication channel is selected. According to the pheromone concentration, all the pheromones are updated. The optimal channel of optimized communication resource allocation is searched, and the algorithm is improved. The simulation results show that the improved algorithm is applied in the regional allocation of communication resources in crowded area, the communication time can be effectively reduced, and the utilization of communication resources is improved, it will have a prospect application value in practice.

Abstract: Energy efficient resource allocation is one of the critical issues for the coordinated multipoint (CoMP) transmission system, where the signal received by each mobile station needs to be converged among multiple base stations (BSs) in the same cluster. However, as the interaction of the system is frequent, the overhead of the backhaul signaling will be enormous. In this paper, an iterative resource allocation and scheduling algorithm (IRASA) with dual method is proposed to solve the optimization problem aiming to maximize the system energy efficiency, which considers the backhaul capacity constraints, circuit power consumption and zero forcing pre-coding (ZFP). Simulation results show that our proposed IRASA can significantly improve the energy efficiency of the system with the backhaul capacity constraints.

Abstract: For influence factors to engineering progress in project management of fund, resource allocation and climate etc, establish a schedule control model under the minimum cost. Using genetic algorithms for analysis, obtained the earliest start time of each working procedure at minimum costs. This method can avoid the impact of human factors and provides the powerful theory support for the policy-maker.

Abstract: The effective resource allocation in production system is the key to high performance. This paper firstly analyses the entropy increase which damages the factors’ operation, then the information entropy theory is extended to establish a complexity model based on size, difficulty, and state diversity. On the basis of complexity, the decline of factors’ utilization efficiency is described. Moreover, some specific management methods are introduced to illustrate the importance of complexity control.

Abstract: This paper aims to address the issues related to renewable energy (RE) resources optimization at rural areas. A transportation algorithm is proposed in order to optimize the utilization of renewable energy and allocate various renewable energy resources to different demand stations. A rural area in Sarawak, Malaysia is selected as a pilot area for implementing the proposed method. The total annual energy demand for the pilot research area is 860,567.12 kWh, while the annual renewable energy potentially available is 879,419.48 kWh. The simulation results of this transportation model reflect that although there is a potential for solar and wind energy at the selected rural area, the model has selected hydropower and biomass as a more viable option. The results obtained from the proposed transportation model have been verified with the results of other RE studies. It is proven that the developed model could be used as a decision making tool to evaluate application of various alternative renewable energy resources and to determine the optimal location for development of these resources.

Abstract: The auto test program of ATS only test and verify the specific instrument and switch. The assignment of instruments and switches in the ATLAS test program which can test the specific instrument and switch is presented. Inorder to improve the test efficiency of the test program,a method is also presented to reduce the redundant action in the testing loop.

Abstract: This paper studies a multiple common due-window assignment problem on a single machine. The job-dependent due-windows are obtained based on common flow allowance criteria. We assume that the processing time of a job is controllable by the resource amount assigned to it. The objective is to find the optimal size and location of the multiple common due-windows, the set of jobs assigned to each due window, the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location, earliness and tardiness of jobs and resource cost. We propose an optimal algorithm to solve the problem.

Abstract: This paper studies a multiple common due date assignment problem on a single machine. The job-dependent due dates are obtained based on common flow allowance criteria. We assume that the processing time of a job is controllable by the resource amount assigned to it. The objective is to find the optimal multiple common dues, the set of jobs assigned to each due date, the sequence of jobs and resource allocation scheme to minimize a total cost based on earliness and tardiness of jobs, the common dues and resource cost. We propose an optimal algorithm to solve the problem.