CFP last date
20 March 2024
Call for Paper
April Edition
IJCA solicits high quality original research papers for the upcoming April edition of the journal. The last date of research paper submission is 20 March 2024

Submit your paper
Know more
Reseach Article

De-De Dodging Algorithm for Scheduling Multiple Workflows in Hybrid Cloud

by B. Arunkumar, T. Ravichandran
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 79 - Number 15
Year of Publication: 2013
Authors: B. Arunkumar, T. Ravichandran

B. Arunkumar, T. Ravichandran . De-De Dodging Algorithm for Scheduling Multiple Workflows in Hybrid Cloud. International Journal of Computer Applications. 79, 15 ( October 2013), 5-9. DOI=10.5120/13815-1808

@article{ 10.5120/13815-1808,
author = { B. Arunkumar, T. Ravichandran },
title = { De-De Dodging Algorithm for Scheduling Multiple Workflows in Hybrid Cloud },
journal = { International Journal of Computer Applications },
issue_date = { October 2013 },
volume = { 79 },
number = { 15 },
month = { October },
year = { 2013 },
issn = { 0975-8887 },
pages = { 5-9 },
numpages = {9},
url = { },
doi = { 10.5120/13815-1808 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-06T21:53:03.304095+05:30
%A B. Arunkumar
%A T. Ravichandran
%T De-De Dodging Algorithm for Scheduling Multiple Workflows in Hybrid Cloud
%J International Journal of Computer Applications
%@ 0975-8887
%V 79
%N 15
%P 5-9
%D 2013
%I Foundation of Computer Science (FCS), NY, USA

Workflow-based applications usually consist of multiple instances depending on a single workflow, which are jobs with control or data dependencies to provide a well-defined scientific computation task, with each instances acting on its own input data. Due to the raise in convention of many applications currently, there is necessitating for high processing and storage capacity along with the consideration of cost and instance use and also without any deadlocks between those instances. To improve the performance of the entire system a high degree of concurrency is obtained by running multiple instances at the same time. On the other hand, since the amount of storage is limited on most systems, deadlock due to numerous storage requests would-be a problem. In this paper we have proposed a new dependency and deadlock avoidance (De-De algorithm) algorithm along with the consideration of both instance and value. The TCHC algorithm that comes to the decision of desiring which resource should be chartered from public providers is now combined with the newly proposed De-De algorithm considering that each instance of both single and multiple workflows should work without any deadlocks. To address this problem, we have combined two new concepts with the traditional problem of deadlock avoidance by proposing a single algorithm that can maximize active (not just allocated) resource utilization and minimize makespan. Our approach is based on the well-known banker's algorithm, but our algorithms make the important distinction between active and passive resources, which is not a part of previous approaches. Through simulation-based studies, we show how our proposed algorithms are better than the classic banker's algorithm.

  1. Yang Wang and Paul Lu, "Maximizing Active Storage Resources with Deadlock Avoidance in Workflow Based Computations" Ieee Transactions On Computers-2012
  2. T. Werner, "Target gene identification from expression array data by promoter analysis," Biomolecular Engineering, vol. 17, pp. 87–94, 2001.
  3. D. Szafron, P. Lu, R. Greiner, D. Wishart, B. Poulin, R. Eisner, Z. Lu, J. Anvik, C. Macdonell, A. Fyshe, and D. Meeuwis, "Proteome analyst: Custom predictions with explanations in a webbased tool for high-throughput proteome annotations," Nucleic Acids Research, vol. 32, pp. W365–W371, 7 2004, http://webdocs. cs. ualberta. ca/?bioinfo/PA/.
  4. GROMACS, http://www. gromacs. org.
  5. M. Schmidt, K. Baldridge, J. Boatz, S. Elbert,M. Gordon, J. Jensen, S. Koseki, N. Matsunaga, and J. Montgomery, "The general atomic and molecular electronic structure system," Journal of Computational Chemistry, vol. 14, pp. 1347–1363, 1993,http://www. msg. ameslab. gov/GAMESS/GAMESS. html.
  6. B. Ludascher, I. Altintas, C. Berkley, D. Higgins, E. Jaeger, M. Jones, E. Lee, J. Tao, and Y. Zhao, "Scientific workflow management and the kepler system," Concurrency and Computation: Practice & Experience, Special Issue on Scientific Workflows, 2005.
  7. E. Deelman, D. Gannon, M. Shields, and I. Taylor, "Workflows and e-science: An overview of workflow system features and capabilities," Future Gener. Comput. Syst. , vol. 25, no. 5, pp. 528– 540, May 2009.
  8. A. Ramakrishnan, G. Singh, H. Zhao, E. Deelman, R. Sakellariou, K. Vahi, K. Blackburn, D. Mayers, and M. Samidi, "Scheduling data-intensive workflows onto storage-constrained distributed resources," in Proceedings of the 7th IEEE International Symposium on Cluster Computing and the Grid, 2007, pp. 401–409.
  9. J. Bent, D. Thain, A. Arpaci-Dusseau, R. H. Arpaci-Dusseau, and M. Livny, "Explicit control in a batch-aware distributed file system," in Proceedings of Networked Systems Design and Implementation (NSDI), San Francisco, California, USA, 2004, pp. 365–378.
  10. W. Zhang, J. Cao, Y. Zhong, L. Liu, and C. Wu, "An integrated resource management and scheduling system for grid data streaming applications," in Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing, ser. GRID '08. Washington, DC, USA: IEEE Computer Society, 2008, pp. 258–265.
  11. "Block-based concurrent and storage-aware data streaming for grid applications with lots of small files," in Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, ser. CCGRID '09. Washington, DC, USA: IEEE Computer Society, 2009, pp. 538–543.
Index Terms

Computer Science
Information Sciences


TCHC algorithm De-De algorithm Scheduling Multiple workflows hybrid cloud.