- Grid-JQA: A QoS Guided Scheduling Algorithm for Grid Computing. - It is the responsibility of the grid resource management system to distribute such jobs among a heterogeneous pool of servers, trying to optimize the resource usage and provide the best possible quality of service.. - In this chapter, we proposed Grid-JQA (Khanli &. - Grid-JQA provides management for quality of service on different types of resources, including networks, CPUs, and disks. - The formula is a unit less combination of the parameters together with weighting factors. - Main features of the resource manager include resource selection based on active database rules (Khanli &. - A brief history of the resource management in grid. - Grid-JQA is going to address the subtask management while the topology information and resource publishing are handled management, formulating the matching problem as an object placement problem dynamically (Khanli &. - (2010) proposed Grid broker selection strategies to resolve the broker selection problem in multiple grid scenarios (Rodero et al., 2010). - The host then communicates with brokers, chooses a suitable broker, and then becomes part of the broker-managed resources. - In Javelin the burden of the subtask management and monitoring is layered on the client side. - Grid-JQA tries to keep the clients as thin as possible and refers the subtask management and monitoring, and the matching to the broker of the system (Khanli &. - Legion supports autonomy with a jurisdiction magistrate (JM), which may reject requests if the offered requests do not match the policy of the site being managed by the JM. - (a) The abstract process of the matchmaking model. - (b) The abstract process of the bidding model (Wang et al., 2010).. - That is the resources advertise themselves to the broker and the users send their requests to the broker. - Then the broker matches the resources and the tasks by using some policies. - Because, after matching the broker does not interfere in Condor. - But in our work, the broker manages the activities till the results return to the user. - The disadvantage of managing broker till the end is that the broker becomes too busy. - Here there are two possible methods, (a) after the broker finds the best matched resource. - The advantages of the broker management till end are:. - For guarantying the QoS parameters, the broker should monitor till the results return to the user.. - The broker can execute the tasks with more priority in duplicate mode.. - Efficient resource selection in every resource management approach is one of the major challenges. - Grid-JQA 3. - Dup Grid-JQA That we can consider:. - As it was explained, the resources should introduce themselves to the broker. - Using schedulers, such as (Xen Scheduler Howto, 2005), a resource can assign a percentage of CPU to a given machine effectively regulating the CPU usage of the group of processes encapsulated in it. - And also it includes some parameters such as the bandwidth and the delay were calculated or estimated by the broker. - Finally the broker inserts the record of QoS parameters for each resource into the database. - Note that, q ires and q itask have the same unit, and the broker compares q ires with q itask for each i from 1 to k. - Also, the client introduces a weight for each parameter to show the importance of the parameter. - This argument can be addressed by the introduction of the proper weights. - We take into consideration the Optimum solution just for the sake of the comparison.. - The algorithm finds the values of the assignment of each resource to n tasks at first. - Optimum Algorithm 4.2 Grid-JQA. - Grid-JQA has time complexity O(n) instead of O(n 3 ) for Optimum method and (as shown in next section by simulation), the difference between Grid-JQA and Optimum is acceptable.. - Grid-JQA uses threshold in (4) instead of finding maximum and minimum for each assignment (Fig. - If summation is more than the Threshold, the broker will choose it as the best matched resource.. - The broker starts calculating (14) for record R 1 . - So the broker assigns R i to the task. - Now, the problem is “what can be the amount of the threshold. - Therefore when there are a lot of strong and free resources it is better that the broker assigns the strong resource to weak task. - So the Threshold should be greater than one and the broker should select a resource precisely. - In this method Grid-JQA acts like an Optimum method.. - So the broker should select a resource as soon as it finds a free resource and the broker does not wait for strong resources.. - Next section shows that Grid-JQA is similar to Optimum using simulation. - But Grid-JQA has time complexity O(n) instead of time complexity O(n 3 ) for Optimum.. - 4.3 Dup Grid-JQA. - Dup Grid-JQA assigns free strong resources to tasks executed in weak resources in duplicate mode. - Reference (Kondo, 2005) shows that for the application with 100 tasks, 90% of the tasks are completed in about 39 minutes, but the application does not finish until 79 minutes have passed, which is almost identical to the turnaround time for a much larger application with 400 tasks.. - The first cause is task failures that occur near the completion of the application. - When a task fails, it must be restarted from scratch, and when this occurs near the end of the application execution, it will delay the application completion. - Dup Grid-JQA is a solution for the second cause. - As when the 60% of execution time of application completes Dup Grid-JQA schedules remaining tasks in duplicate mode. - The requirement of memory must be completely satisfied by the resource, but the assignment of the memory more than requirements can not improve performance. - The application definition consists of the following fields:. - Min/Max of the number of tasks in application (CountMin/Max) 6. - The resource definition consists of the following fields:. - Min/Max of available bandwidth from the resource to the broker (BandwidthMin/Max) 4. - Dup Grid-JQA, out proposed solution, that adds new feature to Grid-JQA. - In all other methods, if the broker does not find the proper resource, it will assign the best available resource to task. - After this, in all figures, horizontal axis indicates the number of the resources, and the vertical axis indicates the turnaround time in msec.. - For strong requirement Grid-JQA is like Optimum method. - Because, if Grid-JQA does not find the proper resource, it will assign the best resource as like Optimum.. - Dup Grid-JQA has minimum turnaround time when the number of free resource is from 10 (half of the task number) to 30 (1.5 times more than the task number). - When the number of free resources is less than the number of tasks, the Optimum method and Grid-JQA do not have better performance than the General method. - Also, when the number of free resources is more than two times of the task number, the results are not improving.. - Most of the time, Grid-JQA has less turnaround time than Wait method (figures 5, 6, and 10). - Grid-JQA Duplicate. - General Optimum Grid-JQA. - Comparing Grid-JQA and Optimum method shows that they are same for strong request (e.g. - The difference between Grid-JQA and Optimum is for low requests (e.g. - 1000-2000) that Optimum method has less turnaround time than Grid-JQA. - Second, in this simulation the threshold is one, but as explained before, the threshold can be changed dynamically in related to environment changes so Grid-JQA can be similar to Optimum method.. - 11 the difference between Grid-JQA and Optimum will be decreased. - So with changing the threshold, Grid-JQA approaches to Optimum method.. - Most of the time Dup Grid-JQA has less turnaround time in comparison with other methods. - And the broker uses the results produced sooner.. - So Dup Grid-JQA is suitable and reliable method for matching in grid environment.. - General Optimum Grid-JQA Duplicate Wait. - Grid-JQA and Dup Grid-JQA are proposed and compared with Optimum method.. - The Optimum method has time complexity O(n 3 ) that is decreased to O(n) by using Grid- JQA with ignorable differences. - The Dup Grid-JQA resource selection selects resources based on threshold scheduling and fault tolerance by duplicating the execution of failed tasks or delayed tasks. - The simulation shows that Dup Grid-JQA performs best.. - Finally, Dup Grid-JQA has minimum turnaround time and it is the best solution for matching in grid environment.. - Also, we will investigate ways to select the best value of the threshold.. - Proceedings of the 2nd IEEE International Conference on e-Science and Grid Computing, e-Science '06.. - Combinatorial Auction-Based Protocols for Resource Allocation in Grids, in: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS'05.. - et al. - In proceedings of the international workshop on Quality of Service, page 27-36. - “Grid-JQA - a new architecture for QoS-guaranteed grid computing system”, Proc. - of the 14th Euromicro Conference on Parallel, Distributed and Network-based processing, France, PDP2006, Feb 15-17.. - “Grid-JQA - grid java based quality of service management by active database”, Proc. - of the 4th Australian Symposium on Grid Computing and e-Research, AusGrid06, Jan.. - Surfer: An extensible pull-based framework for resource selection and ranking, in: Proceedings of the 4th IEEE International Symposium on Cluster Computing and the Grid.. - Proceedings of the 8th International Conference on Distributed Computing Systems.. - Design and Evaluation of a Resource Selection Framework for Grid Applications, in: Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing.. - Matchmaking: Distributed resource management for high throughput computing, in: Proceedings of the 7th IEEE International Symposium on High Performance.