Robust data placement in urgent computing environments

Authors:
Jason M. Cope;Nick Trebon;Henry M. Tufo;Pete Beckman
Affiliations:
Department of Computer Science, University of Colorado at Boulder, UCB 430, 80309, USA;Department of Computer Science, University of Chicago, 1100 East 58th Street, IL 60637, USA;Department of Computer Science, University of Colorado at Boulder, UCB 430, 80309, USA;Mathematics and Computer Science Division, Argonne National Laboratory, 9700 S. Cass Ave, IL 60439, USA
Venue:
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Year:
2009

Citing 0
Cited 2

A data placement strategy in scientific cloud workflows

Future Generation Computer Systems
Integrated data placement and task assignment for scientific workflows in clouds

Proceedings of the fourth international workshop on Data-intensive distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed urgent computing workflows often require data to be staged between multiple computational resources. Since these workflows execute in shared computing environments where users compete for resource usage, it is necessary to allocate resources that can meet the deadlines associated with time-critical workflows and can tolerate interference from other users. In this paper, we evaluate the use of robust resource selection and scheduling heuristics to improve the execution of tasks and workflows in urgent computing environments that are dependent on the availability of data resources and impacted by interference from less urgent tasks.