In this paper, a reputation-based grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized grid o...
详细信息
In this paper, a reputation-based grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized grid overlays. The proposed approach builds upon structured peer-to-peer indexing and overlay networking techniques to create a scalable wide-area networking of grid sites for supporting dependable scheduling of applications. The scheduling algorithm considers reliability of a grid resource as a statistical property, which is globally computed in the decentralized grid overlay based on dynamic feedbacks or reputation scores assigned by individual service consumers (grid Resource Brokers). The proposed algorithm can dynamically adapt to changing resource conditions and offer significant performance gains as compared to traditional approaches in the event of unsuccessful job execution or resource failure. We evaluate and demonstrate the feasibility of our approach through an extensive trace driven simulation. The results show that our scheduling technique can reduce the makespan up to 50% and successfully isolate the failure-prone resources from the system.
The Business Process Execution Language for Web services (BPEL) has emerged as the de-facto standard for implementing processes. While being a powerful language, BPEL is difficult to use. As a result only experienced ...
详细信息
The Business Process Execution Language for Web services (BPEL) has emerged as the de-facto standard for implementing processes. While being a powerful language, BPEL is difficult to use. As a result only experienced users are able to select the right construct. However, XPDL, which was proposed by Workflow Management Coalition, are widely accepted by enterprises. Therefore, this paper presents a tool, named as workflow transformation system between XPDL and BPEL (WFTXB) to automatically translate workflow expressed in terms of XPDL onto BPEL, and vice versa. For transformation between XPDL and BPEL, the tool adopts the graph structure as intermediate language. During the transformation, the tool first analyses the structures of process, and gets the result of map-like structure, which is expressed with adjacency matrix. Then the tool scans the adjacency matrix and identifies the structure of block. Finally, the tool generates BPEL or XPDL code.
grids provide infrastructures and solutions to solve large scale cooperative problems such as large scale distributed virtual environment simulation, multi-institutional scientific computing and data analysis, etc. In...
详细信息
ISBN:
(纸本)9781424416509
grids provide infrastructures and solutions to solve large scale cooperative problems such as large scale distributed virtual environment simulation, multi-institutional scientific computing and data analysis, etc. In this paper, the key techniques for gridcomputing based large scale distributed cooperative virtual environment simulation (GDCVES) are discussed and a hierarchical architecture of GDCVES is proposed. The solutions of GDCVES, such as resource management, massive data management, security aware task scheduling, and fault-tolerance are also discussed. To evaluate the feasibility and scalability of GDCVES, a prototype was implemented and the simulation workflow framework is also analyzed.
Any mistaken maintenance for the complicated and distributed grid can bring unpredictable disaster. Here we focus on the system availability issues caused by service dependencies during the maintenance in grid. A nove...
详细信息
Any mistaken maintenance for the complicated and distributed grid can bring unpredictable disaster. Here we focus on the system availability issues caused by service dependencies during the maintenance in grid. A novel mechanism, called Cobweb Guardian, is proposed in this paper. It provides multiple granularities (service-, container-, and node-level) maintenance for service components in grid. By using the Cobweb Guardian, grid administrators can execute the maintaining task safely in runtime with high availability. The evaluation results show that our proposed dependency-aware maintenance can make the grid management more automatic and available.
Our contribution in this paper focuses on addressing mechanism and autorouting in the tree topology. Actually, we improve on the address assignment mechanism which sponsored by ZigBee alliance. The ZigBee stack protoc...
Our contribution in this paper focuses on addressing mechanism and autorouting in the tree topology. Actually, we improve on the address assignment mechanism which sponsored by ZigBee alliance. The ZigBee stack protocol is designed for sensor network which is widely used. This improved address assignment mechanism is called the preemptive distributed address assignment mechanism (PDAAM). Preemptive addressing is very useful, because in the design phase we can not predict the exact node density of the sensor networks, it is particularly suitable for the networks which contain uneven distribution of node density. Further, it gives a routing algorithm. The packet can be routed from a node to the next node in using the assignment pattern to design the nodes addresses.
In this paper, a novel thresholding algorithm is presented to achieve improved image segmentation performance at low computational cost. The proposed algorithm uses the normalized graph cut measure as the thresholding...
详细信息
In this paper, a novel thresholding algorithm is presented to achieve improved image segmentation performance at low computational cost. The proposed algorithm uses the normalized graph cut measure as the thresholding principle to distinguish an object from the background, as such fair treatment of different sets of diversified sizes is ensured. The weight matrices used in evaluating the graph cuts are based on the gray levels of an image, rather than the commonly used image pixels. For most images, the number of gray levels is much smaller than the number of pixels. Therefore, the proposed algorithm occupies much smaller storage space and requires much lower computational costs and implementation complexity than other graph-based image segmentation algorithms. This fact makes the proposed algorithm attractive in various real-time vision applications such as automatic target recognition (ATR). A large number of examples are presented to show the superior performance of the proposed thresholding algorithm compared to existing thresholding algorithms.
grid scheduling which aims at improving resource utilization and grid application performance is a key concern in grid. Currently, much research can be found about grid scheduling and some algorithms on it were propos...
详细信息
grid scheduling which aims at improving resource utilization and grid application performance is a key concern in grid. Currently, much research can be found about grid scheduling and some algorithms on it were proposed. However, since grid resources are autonomic, distributed and their status change over time, those scheduling algorithms did not fit for the cases well. In this paper, a cache based feedback grid scheduling (CBFS) approach is presented to capture the dynamics and impact of simultaneously co-allocated tasks in a grid. In this approach, grid scheduler utilizes recent resource performance data, such as recent task submitting time and execution time of task which are kept in cache and a feedback approach to engineer load balancing across multiple grid resources. After comparing this dynamic grid scheduling approach with previous research, it is found that CBFS is more generous than other scheduling approaches. Experimental results demonstrate that this approach diminishes latency and contributes to the overall grid load balancing, which significantly improves resource utilization and response time of tasks.
暂无评论