Joint QoS optimization for layered computational grid

Many existing grid resource allocation and scheduling algorithms mainly focus on isolated layers of the grid architecture. The inflexibility of the strict layering structure results in an inefficient utilization of the grid resources. This paper takes a system view of the computational grid and aims to jointly optimize global QoS by adopting cross-layer design. Cross-layer design is based on information exchange and joint optimization among multiple grid layers. Parameters from different layers are provided to a cross-layer optimizer, which selects the values of the layer specific parameters maximizing joint global QoS. The objective of the paper is to jointly optimize the parameters of all layers in a decentralized optimization problem and decompose joint QoS optimization into three sub problems at fabric layer, collective layer and application layer. In simulation part, we compare the performance of the global joint QoS optimization approach with application layer local optimization and resource layer local optimization approach, respectively.     

Multi-level scheduling for global optimization in grid computing

The paper presents a multi-level scheduling algorithm for global optimization in grid computing. This algorithm provides a global optimization through a cross-layer optimization realized by decomposing the optimization problem in different sub-problems each of them corresponding to one among the grid layers such as application layer, collective layer and fabric layer. The QoS of an abstraction level is a utility function that assigns at every level a different value and that depends on the kind of task that is executed on the grid. The global QoS is given by processing of the utility function values of the three different levels, using the Lagrangian method. Multi-level QoS scheduling algorithm is evaluated in terms of system efficiency and their economic efficiency, respectively. Economic efficiency includes user utility, service provider’s revenue and grid global utility. System efficiency includes execution success ratio and resource allocation ratio.     

QoS based resource scheduling by computational economy in computational grid

In this paper, we consider multiple QoS based grid resource scheduling. Each of grid task agent's diverse requirements is modeled as a quality of service (QoS) dimension, associated with each QoS dimension is a utility function that defines the benefit that is perceived by a user with respect to QoS choices in that dimension. The objective of multiple QoS based grid resource scheduling is to maximize the global utility of the scheduling system.     

基于多QoS约束的数据网格任务调度算法研究

针对数据网格环境下的多QoS约束任务调度问题,提出了一种基于最早完成时间与QoS相识度的数据网格任务调度算法(data grid task scheduling algorithm based on Min-min and QoS similarity,MS-GTSA).该算法将最早完成时间与S-GTSA算法相结合,在任务调度过程中,选取任务QoS约束与资源QoS匹配最佳,且完成时间最早的一项优先进行调度.在满足任务最佳QoS匹配的同时,时间跨度得到了较大的改善.仿真结果表明,该算法有效降低了任务调度的时间跨度,在综合性能上较S-GTSA算法有所提高.     

A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid

This paper is to solve efficient QoS based resource scheduling in computational grid. It defines a set of QoS dimensions with utility function for each dimensions, uses a market model for distributed optimization to maximize the global utility. The user specifies its requirement by a utility function. A utility function can be specified for each QoS dimension. In the grid, grid task agent acted as consumer pay for the grid resource and resource providers get profits from task agents. The task agent' utility can then be defined as a weighted sum of single-dimensional QoS utility function. QoS based grid resource scheduling optimization is decomposed to two subproblems: joint optimization of resource user and resource provider in grid market. An iterative multiple QoS scheduling algorithm that is used to perform optimal multiple QoS based resource scheduling. The grid users propose payment for the resource providers, while the resource providers set a price for each resource. The experiments show that optimal QoS based resource scheduling involves less overhead and leads to more efficient resource allocation than no optimal resource allocation.     

基于微粒群算法的网格工作流优化调度问题的研究

网格工作流中的调度问题是一个复杂且具有挑战性的问题,它影响着网格工作流执行成功与否及效率的高低.针对具有时序和因果约束关系的网格工作流优化调度问题进行了研究,建立了网格工作流的任务调度模型和调度问题的目标模型,并应用微粒群算法来优化网格工作流中任务的调度.实验结果证明该算法优于传统的调度算法.     

An integrated security-aware job scheduling strategy for large-scale computational grids

All existing fault-tolerance job scheduling algorithms for computational grids were proposed under the assumption that all sites apply the same fault-tolerance strategy. They all ignored that each grid site may have its own fault-tolerance strategy because each site is itself an autonomous domain. In fact, it is very common that there are multiple fault-tolerance strategies adopted at the same time in a large-scale computational grid. Various fault-tolerance strategies may have different hardware and software requirements. For instance, if a grid site employs the job checkpointing mechanism, each computation node must have the following ability. Periodically, the computational node transmits the transient state of the job execution to the server. If a job fails, it will migrate to another computational node and resume from the last stored checkpoint. Therefore, in this paper we propose a genetic algorithm for job scheduling to address the heterogeneity of fault-tolerance mechanisms problem in a computational grid. We assume that the system supports four kinds fault-tolerance mechanisms, including the job retry, the job migration without checkpointing, the job migration with checkpointing, and the job replication mechanisms. Because each fault-tolerance mechanism has different requirements for gene encoding, we also propose a new chromosome encoding approach to integrate the four kinds of mechanisms in a chromosome. The risk nature of the grid environment is also taken into account in the algorithm. The risk relationship between jobs and nodes are defined by the security demand and the trust level. Simulation results show that our algorithm has shorter makespan and more excellent efficiencies on improving the job failure rate than the Min–Min and sufferage algorithms.     

基于服务质量的云工作流调度优化算法

为满足云工作流实例的多样化需求,根据工作流的特点和云环境中资源部署结构,建立多服务质量指标的云工作流调度模型。对蚁群算法进行改进,解决其收敛速度慢、易陷入局部最优等缺点。利用用户对服务质量不同程度的偏好,引入云任务优先次序启发式规则,提出一种基于服务质量的云工作流调度算法(SPACO)。在Cloud Sim平台上,对云工作流调度模型和算法进行仿真分析,将仿真结果与基本蚁群算法(ACO)、改进的蚁群算法(PACO)进行比较,其结果表明该算法能缩短执行时间、降低能耗成本,验证了该模型的可行性和算法的有效性。     

一种基于服务质量保证的多天线跨层调度方法

多天线技术由于其能显著地提升系统吞吐率而备受关注.基站通过选择当前信道状态最好的用户进行通信能进一步提升系统吞吐率.但系统仅根据用户的信道状态信息调度用户会引起用户服务质量的下降.基于以上考虑.提出了一种基于服务质量保证的跨层调度算法.考虑了两种业务类型,实时业务和非实时业务.为了保证这两种不同业务类型不同的服务质量要求,系统为每个用户赋予一个与之对应的优先级参数.优先级参数随用户的服务状态和信道信息动态变化.调度器根据用户的优先级参数调度用户.仿真结果表明,提出的多用户调度算法能在满足用户服务质量要求的前提下,实现对无线资源的有效利用.     

计算网格中动态负载平衡的分布调度模式

网格计算下对资源进行有效的管理和调度可以提高系统的利用率.在对现有若干调度方法的研究和分析基础上,针对计算网格中的负载平衡问题,提出了一种分布式网格作业调度模型,并给出相关算法.算法通过建立主从模式的负载信息收集机制,提供给节点全局负载信息,加速重负载节点的负载转移速度.通过有效的负载平衡模式,解决资源调度中负载平衡及其可靠性问题.     

一种改进的PSO网格调度算法

提出了一种基于独立任务的改进PSO网格调度算法(MCPSO)。该算法结合粒子群优化算法和混沌机制,在保证寻优速度的同时又能兼顾"跳出"局部最优的能力。实验结果表明,与基本粒子群优化算法相比,该算法具有更好的收敛速度和求解质量。     

设备网格中的任务调度算法

基于设备网格环境中仪器设备的利用率和提交任务的QoS需求来考虑,结合任务调度算法Min-min,提出了一种设备网格中的Qos-Balance任务调度算法.该算法既保证了负载均衡性和又可满足提交任务的QoS需求.实验结果表明,该算法是一种可行的设备网格任务调度算法.最后介绍了算法实验的结果分析.     

Pathbook: Cross-layer optimization for full-duplex wireless networks

Recently, Choi et al. designed the first practical full-duplex wireless system, which challenges the basic assumption in wireless communications that a radio cannot transmit and receive on the same frequency at the same time. In this paper, we study cross-layer optimization for full-duplex wireless networks, comprehensively considering various resource and social constraints. We focus on (1) the problem of allocating resources to maximize the total profit of multiple users subject to node constraints and (2) the problem of allocating resources to minimize the network power consumption subject to user rate demands and node constraints. We formulate these problems as convex programming systems. By combining Lagrangian decomposition and subgradient methods, we design distributed iterative algorithms to solve these problems, which compute the optimized user information flow (i.e. user behavior) for the network layer and the optimized node broadcast rate (i.e. node behavior) for the MAC layer. Our algorithms allow each user and each node to adjust its own behavior individually in each iteration. We analyze the convergence rate, the amount of feasibility violation, and the gap between the optimal solution and our solution in each iteration. We also use the dual space information to analyze node load constraint violation.     

Multi economic agent interaction for optimizing the aggregate utility of grid users in computational grid

This paper investigates the interactions between agents representing grid users and the providers of grid resources to maximize the aggregate utilities of all grid users in computational grid. It proposes a price-based resource allocation model to achieve maximized utility of grid users and providers in computational grid. Existing distributed resource allocation schemes assume the resource provider to be capable of measuring user’s resource demand, calculating and communicating price, none of which actually exists in reality. This paper addresses these challenges as follows. First, the grid user utility is defined as a function of the grid user’s the resource units allocated. We formalize resource allocation using nonlinear optimization theory, which incorporates both grid resource capacity constraint and the job complete times. An optimal solution maximizes the aggregate utilities of all grid users. Second, this paper proposes a new optimization-based grid resource pricing algorithm for allocating resources to grid users while maximizing the revenue of grid providers. Simulation results show that our proposed algorithm is more efficient than compared allocation scheme. Li Chunlin received the ME in computer science from Wuhan Transportation University in 2000, and PhD degree in Computer Software and Theory from Huazhong University of Science and Technology in 2003. She now is an associate professor of Computer Science in Wuhan University of Technology. Her research interests include computational grid, distributed computing and mobile agent. She has published over 15 papers in international journals. Li Layuan received the BE degree in Communication Engineering from Harbin Institute of Military Engineering, China in 1970 and the ME degree in Communication and Electrical Systems from Huazhong University of Science and Technology, China in 1982. Since 1982, he has been with the Wuhan University of Technology, China, where he is currently a Professor and PhD tutor of Computer Science, and Editor in Chief of the Journal of WUT. He is Director of International Society of High-Technol and Paper Reviewer of IEEE INFOCOM, ICCC and ISRSDC. His research interests include high speed computer networks, protocol engineering and image processing. Professor Li has published over 150 technical papers and is the author of six books. He also was awarded the National Special Prize by the Chinese Government in 1993.     

网格计算中基于信任机制的层次任务调度模型

提出了一种分布式层次任务调度模型,该模型将任务调度分两层进行,并且将信任机制引入其中以提高网格的服务质量及运行效率。提出了适应该模型的调度算法,算法同时考虑了网格实体间的信任关系、预测执行时间、QoS需求和价格因素,并动态调整它们在交易中所占的比重,从而较好地适应不同用户的需求。分析和仿真表明,该调度模型增强了网格环境的安全性和适用性,提高了执行效率,并降低了交易失败率。     

Utility-based QoS optimisation strategy for multi-criteria scheduling on the grid

The paper presents quality of service (QoS) optimisation strategy for multi-criteria scheduling on the grid, based on a mathematical QoS model and a distributed iterative algorithm. Three QoS criteria are considered, namely payment, deadline and reliability, which are formulated as utility function. The optimisation problem is split into two parts: task optimisation performed on behalf of the user and resource optimisation performed on behalf of the grid. The strategy employs three types of agents: task agents responsible for task optimisation, computation resource and network resource agents responsible for resource optimisation. The agents apply economic models for optimisation purposes. Dynamic programming is used to optimise the total system utility function in terms of an iterative algorithm. The objective of multi-criteria scheduling is to maximise the global utility of the system. This paper proposes an iterative scheduling algorithm that is used to perform QoS optimisation-based multi-criteria scheduling. The proposed QoS optimisation-based multi-criteria scheduling problem solution has been practically examined by simulation experiments.     

APEX: adaptive disk scheduling framework with QoS support

APEX is an adaptive disk scheduling framework with Quality-of-Service (QoS) support designed for environments with highly varying disk bandwidth usage. APEX is based on a three-layer scheduling architecture: (1) the upper layer realizes different service classes using a set of queues; (2) the mid-layer distributes available disk bandwidth among these queues; and (3) the lower layer is handled by the disk itself, which does the final ordering of disk requests. We demonstrate the use of APEX in an example scenario, a Learning-on-Demand (LoD) application supported by a multimedia system, where students can search for and playback multimedia-based learning material. In this paper, we present the scheduling concepts of APEX which are based on an extended token bucket algorithm. The disk requests scheduled for service are assembled into batches in order to exploit the intelligence of modern disks. Combined with a specialized work-conservation scheme, this enables APEX to apply bandwidth where it is needed, without the loss of efficiency. We demonstrate, through simulations, that APEX provides both higher throughput and lower response times than other mixed-media disk schedulers while still avoiding deadline violations for real-time requests. We also show its robustness with respect to misaligned bandwidth allocation. The work was conducted while Ketil Lund was an employee at UniK – University Graduate Center, Kjeller, Norway.     

Cross-layer optimization for wireless mesh networks with smart antennas

A cross-layer optimization framework for wireless mesh networks is presented where at each node, various smart antenna techniques such as beam-forming, spatial division multiple access and spatial division multiplexing are employed. These techniques provide interference suppression, capability for simultaneous communication with several nodes and transmission with higher data rates, respectively, through multiple antennas. By integrating different combinations of the multi-antenna techniques in physical layer with various constraints from MAC and network layers, three Mixed Integer Linear Programming (MILP) models are presented to minimize the system activation time. Since these optimization problems are complex combinatorial, the optimal solution is approached by a Column Generation decomposition method. The numerical results for different network scenarios with various node densities, number of antennas, transmission ranges and number of sessions are provided. It is shown that the resulted directive, multiple access and multiplexing gains combined with scheduling, effectively increase both the spectrum spatial reuse and the capacity of the links and therefore, enhance the achievable system throughput. Our cross-layer approach is also extended to consider heterogeneous networks and we present a multi-criteria optimization framework to model the design problem where the objective is to jointly minimize the cost of deployment and the system activation time. Our results reveal the benefits of joint design in terms of reducing the cost of deployment while achieving higher system performance.     

Joint contexts optimization for mobile grid

This paper presents joint contexts optimization in mobile grid. The paper describes device context information for context-aware services in the mobile device collaboration. The objective of the paper is to dynamically deliver services to mobile grid users according to current context of mobile grid environment. A utility function is used as objective function that expresses values for the current contexts. The optimization is carried out by the joint context parameter optimizer with respect to an objective function. A joint contexts optimization algorithm is proposed which decomposes mobile grid system optimization problem into sub-problems. In the experiment, the performance evaluation of joint contexts optimization algorithm is conducted.     

LTE下行基于QoS的混合业务调度算法

针对现有调度算法不能同时满足多用户多业务的性能需求等问题,提出了一种新的基于服务质量（QoS）的长期演进（LTE）项目下行调度算法。该算法改进了修正的最大加权时延优先（M—LWDF）算法的延时分式,用信道质量指示（CQI）值直接替代用户的瞬时速率,降低了计算复杂度。此外,兼顾了确保比特率（GBR）和QoS等级标识符（QCI）等QoS参数。仿真结果表明,该算法在保证小区的频谱效率的前提下,降低了实时业务的延时,提高了非实时业务的吞吐量,对LTE下行链路是一个很好的选择。