The Community for Technology Leaders
RSS Icon
Issue No.03 - July-September (2011 vol.4)
pp: 196-206
Dang Minh Quan , International University in Germany, Bruchsal
Laurence T. Yang , St. Francis Xavier University, Antigonish
Service Level Agreements (SLAs) are currently one of the major research topics in Grid computing. Among many system components for supporting of SLA-aware Grid jobs, the SLA mapping module holds an important position and the capability of the mapping module depends on the runtime of the mapping algorithm. With the previously proposed algorithm to optimize the execution time of the workflow, the mapping module may develop into the bottleneck of the system if many requests come in during a short period of time. This paper presents a parallel mapping algorithm to optimize the execution time of the workflow, which can reduce the runtime of the mapping algorithm without reducing the quality of the mapping solutions. Performance measurements thereby deliver evaluation results showing the quality of the method. The speedup of the algorithms and the quality of the solutions are significantly improved when using eight CPUs comparing to using one CPU.
Information technology and systems, scheduling, process management, distributed systems, services computing.
Dang Minh Quan, Laurence T. Yang, "Parallel Mapping with Time Optimization for SLA-Aware Compositional Services in the Business Grid", IEEE Transactions on Services Computing, vol.4, no. 3, pp. 196-206, July-September 2011, doi:10.1109/TSC.2011.27
[1] R. Lovas, G. Dózsa, P. Kacsuk, N. Podhorszki, and D. Drótos, "Workflow Support for Complex Grid Applications: Integrated and Portal Solutions," Proc. Second European across Grids Conf., pp. 129-138, 2004.
[2] A. Sahai, S. Graupner, V. Machiraju, and A. Moorsel, "Specifying and Monitoring Guarantees in Commercial Grids through SLA," Proc. Third IEEE/ACM Int'l Symp. Cluster Computing and the Grid (CCGrid '03), pp. 292-300, 2003.
[3] D.M. Quan and O. Kao, "On Architecture for an SLA-Aware Job Flows in Grid Environments," J. Interconnection Networks, vol. 6, no. 3, pp. 245-264, 2005.
[4] D.M. Quan and J. Altmann, "Resource Allocation Algorithm for Light Communication Grid-Based Workflows within an SLA Context," Int'l J. Parallel, Emergent and Distributed Systems, vol. 24, no. 1, pp. 31-48, 2009.
[5] D.M. Quan, "Error Recovery Mechanism for Grid-Based Workflow within SLA Context," Int'l J. High Performance Computing and Networking, vol. 5, nos. 1/2, pp. 110-121, 2007.
[6] D.M. Quan and D.F. Hsu, "Mapping Heavy Communication Grid-Based Workflows onto Grid Resources within an SLA Context Using Metaheuristics," Int'l J. High Performance Computing and Application, vol. 22, no. 3, pp. 330-346, 2008.
[7] P. Brucker, Scheduling Algorithm, third ed. Springer Verlag, 2004.
[8] M. Mastrolilli and L.M. Gambardella, "Effective Neighborhood Functions for the Flexible Job Shop Problem," J. Scheduling, vol. 3, pp. 3-20, 2000.
[9] Y.K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors," ACM Computing Surveys, vol. 31, pp. 406-471, 1999.
[10] M.P. Singh and M.A. Vouk, "Scientific Workflows: Scientific Computing Meets Transactional Workflows," http://www. papers/databases/workflows sciworkflows.html , 1997.
[11] E. Deelman, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, S. Patil, M. Su, K. Vahi, and M. Livny, "Pegasus: Mapping Scientific Workflows onto the Grid," Proc. Second European across Grids Conf., pp. 11-20, 2004.
[12] D.P. Spooner, S.A. Jarvis, J. Cao, S. Saini, and G.R. Nudd, "Local Grid Scheduling Techniques Using Performance Prediction," IEE Proc. Computers and Digital Techniques, vol. 150, pp. 87-96, 2003.
[13] M. Hovestadt, "Scheduling in HPC Resource Management Systems: Queuing versus Planning," Proc. Ninth Workshop Job Scheduling Strategies for Parallel Processing, pp. 1-20, 2003.
[14] P.E. Black, Algorithms and Theory of Computation Handbook. CRC Press, 1999.
[15] D. Thain, T. Tannenbaum, and M. Livny, "Distributed Computing in Practice: The Condor Experience," Concurrency and Computation: Practice and Experience, vol. 17, nos. 2-4, pp. 323-356, 2005.
[16] R. Duan, R. Prodan, and T. Fahringer, "Run-Time Optimization for Grid Workflow Applications," Proc. Seventh IEEE/ACM Int'l Conf. Grid Computing (GRID '06), pp. 33-40, 2006.
[17] S. Ayyub and D. Abramson, "GridRod - A Service Oriented Dynamic Runtime Scheduler for Grid Workflows," Proc. 21st ACM Int'l Conf. Supercomputing, pp. 43-52, 2007.
[18] T. Ma and R. Buyya, "Critical-Path and Priority Based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids," Proc. 17th Int'l Symp. Computer Architecture and High Performance Computing (SBAC-PAD '05), pp. 251-258, 2005.
[19] F. Berman, H. Casanova, A. Chien, K. Cooper, H. Dail, A. Dasgupta, W. Deng, J. Dongarra, L. Johnsson, K. Kennedy, C. Koelbel, B. Liu, X. Liu, A. Mandal, G. Marin, M. Mazina, J. Mellor-Crummey, C. Mendes, A. Olugbile, M. Patel, D. Reed, Z. Shi, O. Sievert, H. Xia, and A. YarKhan, "New Grid Scheduling and Rescheduling Methods in the GrADS Project," Int'l J. Parallel Programming, vol. 33, pp. 209-229, 2005.
[20] H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman, "Heuristics for Scheduling Parameter Sweep Applications in Grid Environments," Proc. Ninth Heterogeneous Computing Workshop (HCW '00), pp. 349-363, 2000.
[21] J. Blythe, S. Jain, E. Deelman, Y. Gil, K. Vahi, A. Mandal, and K. Kennedy, "Task Scheduling Strategies for Workflow-Based Applications in Grids," Proc. IEEE Int'l Symp. Cluster Computing and the Grid (CCGrid '05), pp. 759-767, 2005.
[22], Feb. 2009.
[23] A.K. Elmagarmid, Database Transaction Models for Advanced Applications. Morgan Kaufmann, 1992.
[24] D. Georgakopoulos, M. Hornick, and A. Sheth, "An Overview of Workflow Management: From Process Modeling to Workflow Automation Infrastructure," Distributed and Parallel Databases, vol. 3, no. 2, pp. 119-153, 1995.
[25] IEEE Data Eng., M. Hsu, ed., Special Issue on Workflow and Extended Transaction Systems, vol. 16, no. 2, 1993.
[26] L. Fischer, Workflow Handbook. Future Strategies Inc., 2004.
[27] S. Ludtke, P. Baldwin, and W. Chiu, "EMAN: Semi-Automated Software for High-Resolution Single-Particle Reconstruction," J. Structure Biology, vol. 128, pp. 146-157, 1999.
[28] G.B. Berriman, J.C. Good, and A.C. Laity, "Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory," Proc. Astronomical Data Analysis Software and Systems (ADASS '03), vol. 13, pp. 145-167, 2003.
[29] J. Yu and R. Buyya, "A Taxonomy of Scientific Workflow Systems for Grid Computing," ACM SIGMOD Record, vol. 34, no. 3, pp. 44-49, 2005.
[30] R. Wolski, "Experiences with Predicting Resource Performance On-Line in Computational Grid Settings," ACM SIGMETRICS Performance Evaluation Rev., vol. 30, no. 4, pp. 41-49, 2003.
[31] B. An, A.V. Vasilakos, and V. Lesser, "Evolutionary Stable Resource Pricing Strategies," Proc. ACM SIGCOMM, 2009.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool