Abstract
This article aims to present the first ideas for developing a framework for load-balancing called GetLB. Considering the electronic funds transfer (EFT) context, GetLB offers a new scheduling heuristic that optimizes the selection of Processing Machines to execute transactions in a processing center. Instead of using the Round-Robin typical approach, the proposal combines data from computation, network, memory and disc metrics for producing a unified scheduling approach, denoted LL (i,j). The proposal calculates the load level of executing an i-typed transaction on a j specific Processing Machine. Furthermore, the load-balancing framework also enables notifications triggered by Processing Machines to the Dispatcher for informing it about asynchronous events such as administrative tasks or transactions disposing. Aiming to evaluate GetLB, a simple prototype was developed by using Java RMI. Preliminary tests revealed that the framework is feasible, outperforming the number of queued transactions obtained with the Round-Robin approach. Keywords: Electronic Funds Transfer, transactions, load balancing, remote method invocation
Highlights
Routing approaches and efficient dispatch of requests are fundamental elements in electronic transactions systems (Araujo et al, 2009; Liu et al, 2010)
This architecture comprises a unique local area network in which Processing Machines are homogeneous among themselves. Concerning this scenario, we developed a new infrastructure for processing centers in which applies a different treatment over both the network and Processing Machines
This organization enables companies to extend their processing center to different cities or countries. Some countries such as Chile (South America) have especial rules in which all electronic transactions must be processed by machines located in national territory. Considering that both Processing Machines and the transactions may be modeled as a heterogeneous system, we developed a scheduling heuristic called LL (Load Level)
Summary
Routing approaches and efficient dispatch of requests are fundamental elements in electronic transactions systems (Araujo et al, 2009; Liu et al, 2010). The most common scheduling approach on processing centers comprises the use of the so-called Round-Robin technique (Rojas-Cessa and Lin, 2004). It operates with a circular list for mapping consumers to producers. Since the transactions are heterogeneous, Round-Robin algorithm can distribute them for processing on highly loaded machines, leaving others with moderate load or idle. This strategy restricts the use of computational resources with specialized features, such as those that have hardware assisted cryptography or decoding image capabilities. It addresses the most important issues relating to technical and scientific contributions of the work
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
