Results 1 - 9 of 9

Cost-driven scheduling of grid workflows using partial critical paths

by Saeid Abrishami, Mahmoud Naghibzadeh, Dick Epema - Parallel and Distributed Systems, IEEE Transactions on , 2012
"... Abstract—Recently, utility grids have emerged as a new model of service provisioning in heterogeneous distributed systems. In this model, users negotiate with providers on their required Quality of Service and on the corresponding price to reach a Service Level Agreement. One of the most challenging ..."
Abstract - Cited by 19 (1 self) - Add to MetaCart
Abstract—Recently, utility grids have emerged as a new model of service provisioning in heterogeneous distributed systems. In this model, users negotiate with providers on their required Quality of Service and on the corresponding price to reach a Service Level Agreement. One of the most challenging problems in utility grids is workflow scheduling, i.e., the problem of satisfying users ’ QoS as well as minimizing the cost of workflow execution. In this paper, we propose a new QoS-based workflow scheduling algorithm based on a novel concept called Partial Crit-ical Path. This algorithm recursively schedules the critical path ending at a recently scheduled node. The proposed algorithm tries to minimize the cost of workflow execution while meeting a user-defined deadline. The simulation results show that the performance of our algorithm is very promising. Index Terms—grid computing, workflow scheduling, utility grids, economic grids, QoS-based scheduling I.
(Show Context)

Virtual resources allocation for workflow-based applications distribution on a cloud infrastructure

by Tram Truong Huu, Johan Montagnat - In 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing (CCGrid , 2010
"... Abstract—Cloud computing infrastructures are providing re-sources on demand for tackling the needs of large-scale dis-tributed applications. Determining the amount of resources to allocate for a given computation is a difficult problem though. This paper introduces and compares four automated resour ..."
Abstract - Cited by 11 (3 self) - Add to MetaCart
Abstract—Cloud computing infrastructures are providing re-sources on demand for tackling the needs of large-scale dis-tributed applications. Determining the amount of resources to allocate for a given computation is a difficult problem though. This paper introduces and compares four automated resource allocation strategies relying on the expertise that can be captured in workflow-based applications. The evaluation of these strategies was carried out on the Aladdin/Grid’5000 testbed using a real ap-plication from the area of medical image analysis. Experimental results show that optimized allocation can help finding a trade-off between amount of resources consumed and applications makespan. Index Terms—cloud infrastructures, resources allocation, workflows I.
(Show Context)

Mapping of SLA-based workflows with light communication onto Grid resources

by Dang Minh Quan, Jörn Altmann
"... Abstract. Service Level Agreements (SLAs) are currently one of the major research topics in Grid Computing. Among those system components that support SLA-aware Grid jobs, the SLA mapping mechanism has an important position. It is responsible for assigning sub-jobs of the workflow to Grid resources ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Abstract. Service Level Agreements (SLAs) are currently one of the major research topics in Grid Computing. Among those system components that support SLA-aware Grid jobs, the SLA mapping mechanism has an important position. It is responsible for assigning sub-jobs of the workflow to Grid resources in a way that meets the user’s deadline and minimizes costs. Assuming many different kinds of sub-jobs and resources, the process of mapping an SLA-based workflow with light communication defines an unfamiliar and difficult problem. This paper presents a solution to this problem. The quality and efficiency of the algorithm is validated through performance measurements. 1
(Show Context)

Journal of Grid Computing manuscript No.

by Tram Truong, Huu Guilherme Koslovski, Fabienne Anhalt, Johan Montagnat, Pascale Vicat-blanc Primet, Tram Truong Huu, Guilherme Koslovski, Fabienne Anhalt, Johan Montagnat, Pascale Vicat-blanc Primet, G. Koslovski, F. Anhalt, J. Montagnat, P. Vicat-blanc Primet , 2012
"... (will be inserted by the editor) Joint elastic cloud and virtual network framework for application performance-cost optimization ..."
Abstract - Add to MetaCart
(will be inserted by the editor) Joint elastic cloud and virtual network framework for application performance-cost optimization
(Show Context)

DEADLINES BUDGET CONSTRAINT IN MULTIPLE CLOUD WORKFLOWS BY USING TASKS REPLICATION

by Ms. B. Poornima, Prof S. R. Mugunthan
"... Abstract — The cloud infrastructure supplies them to proper environment for developing and executing workflow application in deadline constrained. A workflow application deals with software base application which is to automate at least some degree of process. Existing research in scientific workflo ..."
Abstract - Add to MetaCart
Abstract — The cloud infrastructure supplies them to proper environment for developing and executing workflow application in deadline constrained. A workflow application deals with software base application which is to automate at least some degree of process. Existing research in scientific workflow deals with the idle time for provisioned resource and to replicating task among several clouds. It increases the four well known scientific workflow simulation experiment to dealing with deadline met and to reduce the total execution time corresponds to application as the budget available for replication increases. To increase the capacity of the EIRP algorithm to enabling replication among tasks into multiple clouds. We propose an algorithm for structure aware scheduling and ranking the tasks replication. Also deals with how scheduling processes performed into multiple clouds.
(Show Context)

Vicat-Blanc Primet. Joint Elastic Cloud and Virtual Network Framework for Application Performance-cost Optimization. Journal of Grid Computing, Springer Verlag (Germany), 2011, 9 (1), pp.27-47. <10.1007/s10723-010-9168-6>. <hal-00677784>

by Tram Truong Huu, Guilherme Koslovski, Fabienne Anhalt, Johan Montagnat, Pascale Vicat-blanc Primet, Tram Truong Huu, Guilherme Koslovski, Fabienne Anhalt, Johan Montagnat, Hal Id Hal, Tram Truong, Huu Guilherme Koslovski, Fabienne Anhalt, Johan Montagnat, Pascale Vicat-blanc Primet, Tram Truong Huu , 2012
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract - Add to MetaCart
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Journal of Grid Computing manuscript No. (will be inserted by the editor) Joint elastic cloud and virtual network framework for application performance-cost optimization
(Show Context)

Virtual

by Tram Truong Huu, Johan Montagnat, Tram Truong Huu, Tram Truong Huu, Johan Montagnat , 2012
"... resources allocation for workflow-based applications distribution on a cloud infrastructure ..."
Abstract - Add to MetaCart
resources allocation for workflow-based applications distribution on a cloud infrastructure
(Show Context)

Published and produced by:

by Saeid Abrishami, Mahmoud Naghibzadeh, Dick Epema , 2011
"... series may be reproduced in any form or by any means without prior written permission of the publisher. Recently, utility Grids have emerged as a new model of service provisioning in heterogeneous distributed systems. In this model, users negotiate with service providers on their required Quality of ..."
Abstract - Add to MetaCart
series may be reproduced in any form or by any means without prior written permission of the publisher. Recently, utility Grids have emerged as a new model of service provisioning in heterogeneous distributed systems. In this model, users negotiate with service providers on their required Quality of Service and on the corresponding price to reach a Service Level Agreement. One of the most challenging problems in utility Grids is workflow scheduling, i.e., the problem of satisfying the QoS of the users as well as minimizing the cost of workflow execution. In this paper, we propose a new QoS-based workflow scheduling algorithm based on a novel concept called Partial Critical Paths (PCP), that tries to minimize the cost of workflow execution while meeting a user-defined deadline. The PCP algorithm has two phases: in the deadline distribution phase it recursively assigns sub-deadlines to the tasks on the partial critical paths ending at previously assigned tasks, and in the planning phase it assigns the cheapest service to each task while meeting its sub-deadline. The simulation results show that the performance of the PCP algorithm is very promising. 1
(Show Context)

Virtual resources allocation on Aladdin/Grid’5000 infrastructure through the HIPerNet middleware

by Tram Truong Huu, Johan Montagnat, Guilherme Koslovski, Romaric Guillier, Pascale Vicat-blanc Primet
"... Cloud computing infrastructures are providing resources on demand. Determining the amount of resources to allocate for a given application run is a difficult problem though. This paper introduces and compares four automated resource allocation strategies relying on the expertise that can be captured ..."
Abstract - Add to MetaCart
Cloud computing infrastructures are providing resources on demand. Determining the amount of resources to allocate for a given application run is a difficult problem though. This paper introduces and compares four automated resource allocation strategies relying on the expertise that can be captured in workflow-based applications. The evaluation of these strategies was carried out on the Aladdin/Grid’5000 testbed using the HIPerNET middleware. Experimental results show that optimized allocation can help finding a trade-off between amount of resources consumed and application makespan. I.
(Show Context)