An adaptive workflow scheduling scheme based on an estimated data processing rate for next generation sequencing in cloud computing

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 341
  • Download : 0
The cloud environment makes it possible to analyze large data sets in a scalable computing infrastructure. In the bioinformatics field, the applications are composed of the complex workflow tasks, which require huge data storage as well as a computing-intensive parallel workload. Many approaches have been introduced in distributed solutions. However, they focus on static resource provisioning with a batchprocessing scheme in a local computing farm and data storage. In the case of a largescale workflow system, it is inevitable and valuable to outsource the entire or a part of their tasks to public clouds for reducing resource costs. The problems, however, occurred at the transfer time for huge dataset as well as there being an unbalanced completion time of different problem sizes. In this paper, we propose an adaptive resourceprovisioning scheme that includes run-time data distribution and collection services for hiding the data transfer time. The proposed adaptive resource-provisioning scheme optimizes the allocation ratio of computing elements to the different datasets in order to minimize the total makespan under resource constraints. We conducted the experiments with a well-known sequence alignment algorithm and the results showed that the proposed scheme is efficient for the cloud environment. © 2012 KIPS.
Publisher
Korea Information Processing Society (KIPS)
Issue Date
2012-12
Language
Korean
Citation

Journal of Information Processing Systems, v.8, no.4, pp.555 - 566

ISSN
1976-913X
URI
http://hdl.handle.net/10203/104419
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0