The week's pick
Random Articles
Reseach Article
A Survey on Determining the Characteristics of Deadlock, Scheduling and Workflow Instances and Providing New Algorithms for the Issues Arising in Hybrid Cloud
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 110 - Number 14 |
| Year of Publication: 2015 |
| Authors: B.arunkumar, T.ravichandran |
10.5120/19386-0883
|
B.arunkumar, T.ravichandran . A Survey on Determining the Characteristics of Deadlock, Scheduling and Workflow Instances and Providing New Algorithms for the Issues Arising in Hybrid Cloud. International Journal of Computer Applications. 110, 14 ( January 2015), 26-29. DOI=10.5120/19386-0883
Abstract
Effective scheduling is a key concern for the execution of performance driven cloud applications. We have analyzed the various characteristics of deadlock, its occurrences and the strategies to overcome it. We have also discussed some of the algorithms used for scheduling and workflow in hybrid and grid computing. To overcome this, we can use dynamic-critical path algorithm and Cost based workflow scheduling algorithm. The goal of Grid computing is to aggregate the power of widely distributed resources. Grid is not capable of optimizing multiple scheduling but it is possible in cloud. Cloud computing is an emerging technology that provide the users on demand service. One of the issues is the occurrence of deadlock because many users are requesting for the same resource. 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.
References
- T. Werner, "Target gene identification from expression array data by promoter analysis," Biomolecular Engineering, vol. 17, pp. 87–94, 2001.
- 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/.
- GROMACS, http://www. gromacs. org.
- 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.
- 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.
- 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.
- K. Srimanotham and V. Muangsin, "Scheduling workflow-based parameter-sweep applications with best-intermediate-result-first heuristic," in Cluster Computing, IEEE International Conference on. Los Alamitos, CA, USA: IEEE Computer Society, 2006, pp. 1–6.
- S. Smanchat, M. Indrawan, S. Ling, C. Enticott, and D. Abramson, "Scheduling multiple parameter sweep workflow instances on the grid," in Proceedings of the 2009 Fifth IEEE International Conference on e-Science, ser. E-SCIENCE '09. Washington, DC, USA: IEEE Computer Society, 2009, pp. 300–306.
- D. Abramson, B. Bethwaite, C. Enticott, S. Garic, and T. Peachey, "Parameter exploration in science and engineering using manytask computing," IEEE Transactions on Parallel and Distributed Systems, vol. 22, pp. 960–973, 2011.
- A. Mandal, K. Kennedy, C. Koelbel, B. Liu, and L. Johnsson, "Scheduling strategies for mapping application workflows onto the grid," in Proceedings of the 14th International Symposium on High Performance Distributed Computing (HPDC), Research Triangle Park, NC, USA, July 2005, pp. 125–134.
- Y. -K. Kwok and I. Ahmad, "Static scheduling algorithms for allocating directed task graphs to multiprocessors," ACM Computing Survey, vol. 31, no. 4, pp. 406–471, September 1999.
- M. Wieczorek, M. Siddiqui, A. Villazon, R. Prodan, and T. Fahringer, "Applying advance reservation to increase predictability of workflow execution on the grid," in Proceedings of the 2nd International Conference on e-Science and Grid Computing, Dec. 2006, pp. 82–82
- 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
- S. -D. Lang, "An extended banker's algorithm for deadlock avoidance," IEEE Transactions on Software Engineering, vol. 25, no. 3, pp. 428–432, May/June 1999.
- A. Shoshani and E. Coffman, "Sequencing tasks in multi-process, multiple resource systems to avoid deadlocks," in Proceedings of the 11th Annual Symposium on Switching and Automata Theory,October 1970, pp. 225–233
- Y. Wang, "Transparent dataflow detection and use in workflow scheduling: Concurrency and deadlock avoidance," 2008, PhD thesis, University of Alberta, Canada.
- Y. Wang and P. Lu, "Dataflow detection and applications to workflow scheduling," Concurrency and Computation: Practice and Experience, vol. 23, no. 11, pp. 1261–1283, 2011.
Index Terms
Keywords