Skip to Main Content
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. To find a mapping solution, the mapping algorithms have to search over a large search space. This situation leads to a compromise between the runtime of the algorithms and the quality of the mapping solutions. This paper presents a way of using parallelized mapping algorithms based on the proposed algorithms to improve the quality of the mapping solutions while maintaining the runtime of the mapping module. Performance measurements thereby deliver evaluation results showing the quality of the method.