Generic placeholder image

Recent Advances in Computer Science and Communications

Editor-in-Chief

ISSN (Print): 2666-2558
ISSN (Online): 2666-2566

Research Article

Combinatorial Double Auction Based Meta-scheduler for Medical Image Analysis Application in Grid Environment

Author(s): Karthikeyan Periyasami*, Arul Xavier Viswanathan Mariammal, Iwin Thanakumar Joseph and Velliangiri Sarveshwaran

Volume 13 , Issue 5 , 2020

Page: [999 - 1007] Pages: 9

DOI: 10.2174/2213275911666190320161934

Price: $65

Abstract

Background: Medical image analysis application has complex resource requirement. Scheduling Medical image analysis application is the complex task to the grid resources. It is necessary to develop a new model to improve the breast cancer screening process. Proposed novel Meta scheduler algorithm allocate the image analyse applications to the local schedulers and local scheduler submit the job to the grid node which analyses the medical image and generates the result sent back to Meta scheduler. Meta schedulers are distinct from the local scheduler. Meta scheduler and local scheduler have the aim at resource allocation and management.

Objective: The main objective of the CDAM meta-scheduler is to maximize the number of jobs accepted.

Methods: In the beginning, the user sends jobs with the deadline to the global grid resource broker. Resource providers sent information about the available resources connected in the network at a fixed interval of time to the global grid resource broker, the information such as valuation of the resource and number of an available free resource. CDAM requests the global grid resource broker for available resources details and user jobs. After receiving the information from the global grid resource broker, it matches the job with the resources. CDAM sends jobs to the local scheduler and local scheduler schedule the job to the local grid site. Local grid site executes the jobs and sends the result back to the CDAM. Success full completion of the job status and resource status are updated into the auction history database. CDAM collect the result from all local grid site and return to the grid users.

Results: The CDAM was simulated using grid simulator. Number of jobs increases then the percentage of the jobs accepted also decrease due to the scarcity of resources. CDAM is providing 2% to 5% better result than Fair share Meta scheduling algorithm. CDAM algorithm bid density value is generated based on the user requirement and user history and ask value is generated from the resource details. Users who, having the most significant deadline are generated the highest bid value, grid resource which is having the fastest processor are generated lowest ask value. The highest bid is assigned to the lowest Ask it means that the user who is having the most significant deadline is assigned to the grid resource which is having the fastest processor. The deadline represents a time by which the user requires the result. The user can define the deadline by which the results are needed, and the CDAM will try to find the fastest resource available in order to meet the user-defined deadline. If the scheduler detects that the tasks cannot be completed before the deadline, then the scheduler abandons the current resource, tries to select the next fastest resource and tries until the completion of application meets the deadline. CDAM is providing 25% better result than grid way Meta scheduler this is because grid way Meta scheduler allocate jobs to the resource based on the first come first served policy.

Conclusion: The proposed CDAM model was validated through simulation and was evaluated based on jobs accepted. The experimental results clearly show that the CDAM model maximizes the number of jobs accepted than conventional Meta scheduler. We conclude that a CDAM is highly effective meta-scheduler systems and can be used for an extraordinary situation where jobs have a combinatorial requirement.

Keywords: Grid computing, meta scheduler, combinatorial auction, medical image, CDAM, grid resource.

Graphical Abstract
[1]
I. Foster, Y. Zhao, I. Raicu, and S. Lu, "Cloud computing and grid computing 360-degree compared", In Grid Computing Environments Workshop IEEE, pp. 1-10, 2008.
[2]
J. Xu, A.Y. Lam, and V.O. Li, "Chemical reaction optimization for task scheduling in grid computing", IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 10, pp. 1624-1631, 2011.
[3]
P. Priscilla, and P. Karthikeyan, "Survey on meta-scheduler in grid environment", IJRCAR, vol. 1, no. 9, pp. 74-78, 2013.
[4]
H. Santhiya, and P. Karthikeyan, "Survey on auction based scheduling in grid and cloud environment", Int. J. Comput. Appl., vol. 62, no. 8, pp. 6-9, 2013.
[5]
P. Karthikeyan, and M. Chandrasekaran, "Dynamic programming inspired virtual machine instances allocation in cloud computing", J. Comput. Theor. Nanosci., vol. 14, no. 1, pp. 551-560, 2017.
[6]
S.K. Garg, S. Venugopal, J. Broberg, and R. Buyya, "Double auction-inspired meta-scheduling of parallel applications on global grids", J. Parallel Distrib. Comput., vol. 73, no. 4, pp. 450-464, 2013.
[7]
G. Baranwal, and D.P. Vidyarthi, "A fair multi-attribute combinatorial double auction model for resource allocation in cloud computing", J. Syst. Softw., vol. 108, pp. 60-76, 2015.
[8]
S. Zaman, and D. Grosu, "Combinatorial auction-based allocation of virtual machine instances in clouds", J. Parallel Distrib. Comput., vol. 73, no. 4, pp. 495-508, 2013.
[9]
L. Tomás, B. Caminero, C. Carrión, and A.C. Caminero, "On the improvement of grid resource utilization: Preventive and reactive rescheduling approaches", J. Grid Comput., vol. 10, no. 3, pp. 475-499, 2012.
[10]
L. Tomás, B. Caminero, C. Carrión, and A.C. Caminero, "Using network information to perform meta-scheduling in advance in Grids", European Conference on Parallel Processing Springer: Berlin, Heidelberg, pp. 431-443, 2010.
[11]
G. Sabin, V. Sahasrabudhe, and P. Sadayappan, "Assessment and enhancement of meta-schedulers for multi-site job sharing", Proceedings 14th IEEE International Symposium on High Performance Distributed Computing, HPDC-14, 2005pp. 144-153
[12]
A. Caminero, O. Rana, B. Caminero, and C. Carrión, "Network-aware heuristics for inter-domain meta-scheduling in Grids", J. Comput. Syst. Sci., vol. 77, no. 2, pp. 262-281, 2011.
[13]
J. Conejero, L. Tomás, B. Caminero, and C. Carrión, "QoS provisioning by meta-scheduling in advance within SLA-Based grid environments", Comput. Inf., vol. 31, no. 1, pp. 73-88, 2012.
[14]
A. Kertesz, J.D. Dombi, and A. Benyi, "Pliant-based virtual machine scheduling solution to improve the energy efficiency of IAAS clouds", J. Grid Comput., vol. 14, no. 1, pp. 41-53, .
[15]
M. Arsuaga-Ríos, M.A. Vega-Rodríguez, and F. Prieto-Castrillo, "Meta-schedulers for grid computing based on multi-objective swarm algorithms", Appl. Soft Comput., vol. 13, no. 4, pp. 1567-1582, 2013.
[16]
I. Rodero, D. Villegas, N. Bobroff, Y. Liu, L. Fong, and S.M. Sadjadi, "Enabling interoperability among grid meta-schedulers", J. Grid Comput., vol. 11, no. 2, pp. 311-336, 2013.
[17]
R.P. Prado, S. García-Galán, J.M. Expósito, A.J. Yuste, and S. Bruque, "Learning of fuzzy rule-based meta-schedulers for grid computing with differential evolution", In International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems Springer: Berlin, Heidelberg, pp. 751-760, 2010.
[18]
K. Chard, and K. Bubendorfer, "A distributed economic meta-scheduler for the grid", In 8th IEEE International Symposium on Cluster Computing and the Grid, CCGRID’08, 2008pp. 542-547

Rights & Permissions Print Export Cite as
© 2022 Bentham Science Publishers | Privacy Policy