This paper presents a novel security infrastructure for deploying and using service-oriented Cloud applications securely without having to face the complexity associated with certificate management. The proposal is ba...
详细信息
This paper presents a novel security infrastructure for deploying and using service-oriented Cloud applications securely without having to face the complexity associated with certificate management. The proposal is based on an identity-based cryptographic approach that offers an independent setup of security domains and does not require a trust hierarchy compared to other identity-based cryptographic systems. The service URLs can be used as public keys, such that creating a secure connection to a service is very simple. A comparison between traditional approaches and identity-based cryptography with respect to data transfer requirements is presented.
In this paper, we propose a taxonomy that characterizes and classifies different components of autonomic application management in Grids. We also survey several representative Grid systems developed by various project...
详细信息
In this paper, we propose a taxonomy that characterizes and classifies different components of autonomic application management in Grids. We also survey several representative Grid systems developed by various projects world-wide to demonstrate the comprehensiveness of the taxonomy. The taxonomy not only highlights the similarities and differences of state-of-the-art technologies utilized in autonomic application management from the perspective of Grid computing, but also identifies the areas that require further research initiatives.
Today, due to exciting developments in advanced computing techniques and technologies, many scientists can now make use of dedicated high speed networks and high performance computing. This so-called `e-Science' i...
详细信息
ISBN:
(纸本)9781424498642
Today, due to exciting developments in advanced computing techniques and technologies, many scientists can now make use of dedicated high speed networks and high performance computing. This so-called `e-Science' in enabling scientist across many fields to work together in global virtual research communities. What do these advancements mean for modeling and simulation? This advanced tutorial instigates two key areas that are affecting the way M&S projects are being developed and deployed. Grid computing addresses the use of many computers to speed up applications. Simulation Interoperability deals with linking together remote simulations and/or speeding up the execution of a single run. Through the use of case studies we hope to show that both these areas are making a major impact on the practice of M&S in both industry and science, as well as in turn supporting the future capabilities of e-Science.
Efficient scheduling is a key concern for the effectual execution of performance driven Grid applications, such as workflows. Many list heuristics have been developed for scheduling workflows in centralized Grid envir...
详细信息
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 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.
Efficient scheduling is a key concern for the effectual execution of performance driven Grid applications, such as workflows. Many list heuristics have been developed for scheduling workflows in centralized Grid envir...
详细信息
Efficient scheduling is a key concern for the effectual execution of performance driven Grid applications, such as workflows. Many list heuristics have been developed for scheduling workflows in centralized Grid environment. However, in this paper, we present a distributed list heuristic for decentralized scheduling of workflow applications in global Grids. The simulation results show that the proposed scheduling approach is scalable with respect to increased workload on the system.
Absolutely nothing!? The merit of theory and algorithms in the context of wireless sensor and ad hoc networks is often questioned. Admittedly, coming up with theory success stories that will be accepted by practitione...
详细信息
In this paper, we present a parallelization of a filtering algorithm related to non-linear anisotropic diffusion, used to enhance the performance of an application in a parallel distributed system. The anisotropic dif...
详细信息
ISBN:
(纸本)9780769532578
In this paper, we present a parallelization of a filtering algorithm related to non-linear anisotropic diffusion, used to enhance the performance of an application in a parallel distributed system. The anisotropic diffusion is a well-established technique for image enhancement by means of diffusivity functions, which act as border attenuators. However, it requires a high computational cost when a large amount of data is used. The proposed implementation was parallelized considering both point-to-point and collective communications, adopting the MPI paradigm. Results from both approaches indicate that the proposed algorithm has reached interesting levels of performance (81% and 93% of efficiency, respectively) when compared to the execution of one process in a single computer node. In addition, our results indicate an enhancement of around 21% utilizing the collective communication strategy when compared to point-to-point communication.
暂无评论