A new optimal approach for multiple optimisation objectives grid resource allocation and scheduling

We present a jointly optimal selection and scheduling scheme for the lossy transmission of frames governed by a dependency relation and a delay constraint over a link with limited capacity. A main application for this is scalable video streaming. Our objective is to select a subset of frames and decide their transmission schedule such that the overall video quality at the receiver is maximized. The problem is solved for two of the most common classes of dependency structures for video encoding, which include as a special case the popular hierarchical dyadic structure. We formally characterize the structural properties of an optimal transmission schedule in terms of frame dependency. It is shown that regardless of the subset of frames selected for transmission, any optimal schedule has an equivalent canonical form that is a subsequence of a unique universal sequence containing all frames. The canonical form can be computed efficiently through the construction of a dependency tree. This leads to separable but jointly optimal frame selection and scheduling algorithms that have quadratic computational complexity in the number of frames. Simulation with video traces demonstrates that the optimal scheme can substantially outperform existing suboptimal alternatives.

The paper is targeted at concerning pricing approach for grid resource scheduling with QoS guarantees. The two major parties in Grid, namely, resource consumers who submit various applications, and resources providers who share their resources, usually have different motivations when they join the Grid. These incentives are presented by objective functions in scheduling. Economic grid QoS scheduling algorithm adopt both application-centric and resource-centric scheduling objective function aim to optimize the performance of each individual grid user and the performance of the grid resources. The economic cost and profit are considered by grid users and resource providers respectively. Objective functions and QoS scheduling optimization algorithms are proposed. QoS scheduling optimization is decomposed into two sub optimizations of grid user's cost and grid resource provider's profit by utilizing dynamic programming. QoS scheduling algorithm is an interactive process in economic market coordinating grid users and grid resource providers to achieve optimal QoS scheduling. Experiments are to compare the proposed economic QoS scheduling with three partial optimisation approaches, which only consider one criterion.

To address the problem of maritime vessels requiring external emergency repair support when damaged at sea, this paper proposes an optimized scheduling model for maritime vessel emergency repairs and solves it using an improved Multi-dimensional Dynamic List Scheduling (MPLDS) algorithm. The basic process for emergency repair of maritime equipment is established, and an optimized scheduling constraint model for tasks-resources is constructed. The model is divided into two parts: an effect-based action optimization method and a constraint model for optimized scheduling. The improved MPLDS algorithm is applied to solve the constraint model, fully considering time, cost, and the importance between tasks and support platforms during the optimized scheduling process, and a case study is conducted to verify its accuracy. The results show that the improved MPLDS algorithm, by fully utilizing priority mediation methods to solve the optimized scheduling constraint model, can meet the basic demands of support planners in various aspects and achieve efficient emergency repair support for damaged maritime vessels.

This work studies the power optimal dynamic scheduling problem in multi-channel multi-user wireless access networks. Users have quality-of-service (QoS) requirements on the minimum rates with statistical delay guarantees. Only one user is allowed to transmit over a channel in a given time slot. This work considers two scenarios: homogeneous and heterogeneous users. For the former scenario, the optimal scheduling policy can be derived, and an online scheduling algorithm for the optimal policy is proposed using online time-averaging without requiring a-priori known fading statistics. For the latter scenario, the optimal scheduling problem is combinatorially hard; hence, even when the fading statistics are available, computing the optimal policy is intractable. Consequently, this work develops a sub-optimal online scheduling algorithm with linear complexity which does not require a-priori known fading statistics. Moreover, the scheduling algorithm satisfies the QoS constraints for the users. Illustrative results demonstrate the performance of the proposed scheduling algorithms in various settings.

As Grid technologies evolve quickly on Internet, research related to resource scheduling faces new opportunities and challenges. These new technologies, ideas and approaches provide a new environment for researching and developing the economy-based resource scheduling system. Aiming at the hierarchical Grid model, following utility optimization thinking, while an universal flexible utility function is provided for addressing the Grid users’ QoS requirements of deadline and budget, this paper proposes a new Grid resource scheduling algorithm, which can not only increase the utilization of resources and system throughput, but also realize cost-time optimization between resource providers and users within Grid systems. On the basis of having described the different functional parts of the proposed algorithm, two kinds of simulative experiments about completion time and cost of tasks are conducted. Finally, the experiment results show that the proposed algorithm is effective.

The integration of multiple Radio Access Technologies (RATs) of licensed or unlicensed bands is considered as a cost-efficient way to greatly increase network capacity of mobile networks. In this paper, we propose a Smart Aggregated RAT Access (SARA) strategy with aim to maximize network throughput while meeting diverse traffic Quality of Service (QoS) requirements. We consider a scenario where users with different QoS requirements access to the Heterogeneous Network (HetNet) with coexisting Cellular-WiFi. In order to maximize network resource utilization in such a complex and dynamic environment, we exploit multi-agent reinforcement learning to perform RAT selection in conjunction with resource allocation for individual users based on sensing dynamic channel states and traffic characteristics. We first use Nash Q-learning to provide a set of feasible RAT access strategies, and then employ Monte-Carlo (MCTS) based Q-learning to perform resource allocation which tries to maximize system throughput while meeting traffic QoS requirements. Numerical results reveal that the network access capacity can be maximized while meeting traffic QoS requirements with limited number of searches by using our proposed SARA. Compared with traditional WiFi offloading schemes, SARA can significantly improve system resource utilization and capacity while guaranteeing QoS requirements of UEs.

With the changes in the era of science and technology, the emergence of 5G technology makes a communication speed leap, and the delay is also getting shorter and shorter. At present, the computing power of computing equipment is also steadily improving. As one of its key technologies, mobile edge computing (MEC) is becoming more and more important. Here, we introduce MEC task scheduling and device collaboration algorithms based on deep learning. Aiming at the multi-task joint optimization scheduling strategy microtearing mode to minimize the total service cost of multiple tasks, we establish a theoretical optimization model of multi-task joint scheduling and use the model to design a multi-task cloud collaborative optimization scheduling algorithm based on Livepeer Token rules. We propose a deep-learning device collaboration algorithm based on alternating direction multiplier. The sub differential algorithm and the improved conjugate gradient method are designed to solve the sub problem respectively. This paper simulates the proposed deep-learning task scheduling algorithm and device collaboration algorithm. The simulation results show that, in the task scheduling algorithm, the proposed algorithm reduces the cost of completing the task, but in the total task time, this algorithm has a certain gap compared with other algorithms. In the equipment collaboration algorithm, with the increase of the n value, the algorithm converges in a certain iteration increment; in terms of algorithm convergence, the algorithm needs 142 iterations at most to achieve convergence, and the fastest speed only needs 17 iterations. In the experiment based on real data sets, the proposed algorithm is also better than the other two algorithms. From these results, we can see that the proposed algorithm has good convergence, stability, and scalability, and it has excellent performance in task scheduling and device collaboration of MEC.

Coordinated optimization scheduling operation of integrated energy system considering demand response and carbon trading mechanism

Task Scheduling is one of the key elements in any distributed-memory machine (DMM), and an efficient algorithm can help reduce the interprocessor communication time. As optimal scheduling of tasks to DMMs is a strong NP-hard problem, many heuristic algorithms have been introduced in the literature. This paper presents a Task Duplication based Scheduling (TDS) algorithm which can schedule directed acyclic graphs (DAGs) with a complexity of O(|V|/sup 2/), where |V| is the number of tasks in the DAG. This algorithm generates an optimal schedule for a class of DAGs which satisfy a simple cost relationship. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling schemes in terms of the schedule length and algorithm complexity.

The combination of non-orthogonal multiple access (NOMA) and transmit antenna selection (TAS) techniques has recently attracted significant attention due to the low cost, low complexity, and high diversity gains. Meanwhile, random linear coding (RLC) is considered to be a promising technique for achieving high reliability and low latency in multicast communications. In this paper, we consider a downlink system with a multi-antenna base station and two multicast groups of single-antenna users, where one group can afford to be served opportunistically, while the other group consists of comparatively low-power devices with limited processing capabilities that have strict quality of service (QoS) requirements. In order to boost reliability and satisfy the QoS requirements of the multicast groups, we propose a cross-layer framework, including NOMA-based TAS at the physical layer and RLC at the application layer. In particular, two low-complexity TAS protocols for NOMA are studied in order to exploit the diversity gain and meet the QoS requirements. In addition, RLC analysis aims to facilitate heterogeneous users, such that sliding window-based sparse RLC is employed for computational restricted users, and conventional RLC is considered for others. Theoretical expressions that characterize the performance of the proposed framework are derived and verified through simulation results.

The Grid can be seen as a collection of services each of which performs some functionality. Grid users often submit their applications in the form of workflows with certain Quality of Service (QoS) requirements imposed on the workflows. These workflows detail the composition of Grid services and the level of service required from the Grid. This paper addresses workload allocation techniques for Grid workflows. We model a Grid service as a G/G/1 queue and minimise failures (QoS requirement violation) of jobs by solving a mixed-integer non-linear program (MINLP). The novel approach is evaluated through an experimental simulation and the results confirm that the proposed workload allocation strategy performs considerably better in terms of satisfying QoS requirements of Grid workflows than scheduling algorithms that don?t employ such workload allocation techniques.

The provision of Quality of Service (QoS) in Grids (systems made of heterogeneous computing resources geographically dispersed) is still a challenging task that needs the attention of the research community. Since reservations of resources may not always be possible, another possible way of enhancing the QoS perceived by Grid users is by performing meta-scheduling of jobs in advance, where jobs are scheduled some time before they are actually executed. Hence, it becomes more likely that the appropriate resources are available to run the job whenever needed. One of the drawbacks of this scenario is that fragmentation appears as a well known effect in job allocations into resources. Fragmentation also becomes the cause for poor resource utilization. For these reasons, a new technique has been developed to tackle fragmentation problems, which consists of rescheduling already scheduled tasks. To this end, some heuristics have been implemented to figure out which intervals need replanning and to select the jobs which are involved in that rescheduling process. On top of that, another heuristic has been implemented to put rescheduled jobs as close together as possible so that fragmentation is avoided or reduced to the minimum. This technique has been tested using a real test bed involving heterogeneous computing resources from different organizations. An evaluation is presented that illustrates the efficiency of this approach to meet the users' QoS requirements.

Currently the research on the grid workflow scheduling algorithms commonly suffer by one or several of the following drawbacks: grid workflow model of directed acyclic graph (DAG), not enough considerations of multi-dimensional Quality of Service (QoS) parameters and single objective optimal scheduling. Based on abstract grid workflow language (AGWL) model, this paper presents an algorithm for multi-objective optimal grid workflow scheduling with QoS constraints, which make uses of an improved NSGA-II algorithm. Theoretical analysis and experimental results indicate the feasibility and efficiency of the algorithm.KeywordsQuality of service (QoS)grid workflow schedulingNSGA-II

Integrated energy systems (IESs) are complex multisource supply systems with integrated source, grid, load, and storage systems, which can provide various flexible resources. Nowadays, there exists the phenomenon of a current power system lacking flexibility. Thus, more research focuses on enhancing the flexibility of power systems by considering the participation of IESs in distribution network optimization scheduling. Therefore, the optimal scheduling of IESs considering virtual heat storage and electric vehicles (EVs) is proposed in this paper. Firstly, the basic structure of IESs and mathematical models for the operation of the relevant equipment are presented. Then, an optimal scheduling strategy of an IES considering virtual heat storage and electric vehicles is proposed. Finally, an IES with an IEEE 33-node distribution network, 20-node Belgian natural gas network, and 44-node heating network topologies is selected to validate the proposed strategy. The proposed models of integrated demand response (IDR), EV orderly charging participation, virtual heat storage, and actual multitype energy storage devices play the role of peak shaving and valley filling, which also helps to reduce the scheduling cost from CNY 11,253.0 to CNY 11,184.4. The simulation results also demonstrate that the proposed model can effectively improve the operational economy of IESs, and the scheduling strategy can promote the consumption of renewable energy, with the wind curtailment rate decreasing from 63.62% to 12.50% and the solar curtailment rate decreasing from 56.92% to 21.34%.

Grid Computing provides sharing of geographically distributed resources among large scale complex applications. Due to dynamic nature of resources in grid, there is a need of highly efficient job scheduling and resource management policies in grid. In this paper, a novel Grid Resource Scheduler (GRS) is proposed to effectively utilize the available resources in Grid. Proposed GRS contributes, an optimal job scheduling algorithm on Job Rank-Backfilling policy and a resource matching algorithm based on ranking of resources with best fit allocation model. Performance of GRS is measured by considering a web based BLAST algorithm -- a bioinformatics application -- . GRS aims in reducing; Make span of the job workflow and execution time of varied size jobs. The experimental results prove that proposed job scheduling and resource matching algorithms performs better when evaluated against widely used FCFS job scheduling and biggest free resource matching strategies.