Open Access Open Access  Restricted Access Subscription or Fee Access

Time-Cost Scheduling Algorithm

P.K. Srinivasan

Abstract


Commerce processes are now commonly being defined in terms of workflows, encompassing complex performance models, inter-dependencies between tasks and restrictive Service Level Agreements(SLAs). Moreover, the Cloud Computing paradigm is gaining in popularity as it seeks to reduce the costs of hosting and managing expensive IT infrastructure in-house, while at the same time moving these costs from “infrastructure expenditure” to “operational costs”. The scheduling of business processes/workflows over an external (on-demand) large-scale, distributed Cloud/Grid computing infrastructure is a complex problem. The efficient scheduling of data-intensive applications in Cloud Computing environments is a tough challenge The research will focus on developing job scheduling and resource (compute, memory, bandwidth) allocation algorithms which take into consideration the data requirements of the applications, the inter-dependencies between sub-tasks, the location of replicate sites for data, the network topology and real-time QoS. These tasks may need to be co-hosted on a single platform or assigned to resources very close to each other on the network to minimize network load, costs and/or time for a transaction to complete. This algorithm presents a novel dispensation-time-cost scheduling algorithm which considers the characteristics of cloud computing to accommodate order-intensive cost-constrained workflows by compromising execution time and cost with user input enabled on the fly. The simulation may be performed to demonstrate that the algorithm can cut down the mean execution cost by over considerable percentage(say 16%) while meeting the user-designated deadline or shorten the mean execution time by over reasonable percentage %(about 19%) with in the user designated execution cost .

Keywords


Commerce processes,e-business,infrastructure design

Full Text:

PDF

References


Boss, G., Malladi, P., Quan, D., Legregni, L. and Hall, H. (2008). Cloud Computing (White Paper), IBM, October 2007, http://download.boulder.ibm.com/ibmdl/pub/software/dw/wes/hipods/Cloud_computing_wp_final_8Oct.pdf, accessed on March. 19, 2009.

Broberg, J., Buyya, R. and Tari, Z. (2008). MetaCDN: Harnessing „Storage Clouds‟ for High Performance Content Delivery, Technical Report, GRIDS-TR-2008-10, Grid Computing and Distributed Systems Laboratory, The University of Melbourne, Australia, Aug. 15, 2008. http://www.gridbus.org/reports/meta-cdn2008.pdf, accessed on March. 19, 2009.

Buyya, R. and Venugopal, S. (2004). The Gridbus Toolkit for Service Oriented Grid and Utility Computing: An Overview and Status Report, Proc. of 1st IEEE International Workshop on Grid Economics and Business Models (GECON 2004), , pp. 19-36, Seoul, Korea, April 2004.

Buyya, R., Yeo, C. S. and Venugopal, S. (2008). Market-Oriented Cloud Computing: Vision, Hype, and Reality for Delivering IT Services as Computing Utilities, Proc. of the 10th IEEE International Conference on High Performance Computing and Communications, pp. 5-13, Los Alamitos, CA, USA, September 2008.

Chen, J. and Yang, Y. (2008). Activity Completion Duration based Checkpoint Selection for Dynamic Verification of Temporal Constraints in Grid Workflow Systems. International Journal of High Performance Computing Applications, 22(3):319-329, Sage, 2008.

Fahringer, T., Jugravu, A., Pllana, S., Prodan, R., Slovis, Jr. C. and Truong, H. L. (2005). ASKALON: A Tool Set for Cluster and Grid Computing. Concurrency and Computation: Practice and Experience, 17:143-169, Wiley, 2005.

Grossman, R. L. and Gu, Y. (2008). Data Mining Using High Performance Data Clouds: Experimental Studies Using Sector and Sphere, Proc. of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 920-927, Las Vegas, Nevada, USA, August 2008.

Grossman R. L., Gu Y., Sabala M. and Zhang W. (2008). Compute and Storage Clouds Using Wide Area High Performance Networks, Future Generation Computer Systems, 25:179–183, 2008.

Liu, K., Chen, J., Yang, Y. and Jin, H. (2008). A Throughput Maximization Strategy for Scheduling Order Intensive Workflows on SwinDeW-G, Concurrency and Computation: Practice and Experience, 20(15):1807-1820, Wiley, Oct. 2008.

Maheswaran, M., Ali, S., Siegel, H. J, Hensgen, D. and Freund, R. F. (1999). Dynamic mapping of a class of independent tasks onto heterogeneous computing systems, J. Parallel and Distributed Computing, 59(2):107-131, 1999.

Menasc, D. A. and Casalicchio, E. (2004). A Framework for Resource Allocation in Grid Computing, Proc. of the 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS‟04), pp. 259-267, 2004.

Sakellariou, R., Zhao, H., Tsiakkouri, E. and Dikaiakos, M. D. (2005). Scheduling Workflows with Budget Constraints, CoreGRID, Proc. of Workshop on Integrated research in Grid Computing, pp. 347-357, Pisa, Italy, November 2005.

Vaquero, L. M., Rodero-Merino, L., Caceres, J. and Lindner, M. (2008). A Break in the Clouds: Towards a Cloud Definition, ACM SIGCOMM Computer Communication Review, 39(1):50-55, Dec. 2008.

Yan, J., Yang, Y. and Raikundalia, G. K. (2006). SwinDeW - A Peer-to-Peer based Decentralized Workflow Management System, IEEE Transactions on Systems, Man and Cybernetics, Part A, 36(5):922-935, 2006.


Refbacks

  • There are currently no refbacks.