Before handing out my midterm exam the Thursday before Spring Break, unease in classroom was palpable. I questioned, is it right thing to do give a now? Two days prior we learned online instruction would begin week after spring break for and possibly longer. This an unprecedented scenario. never took seminar titled, How Continue Teaching During Pandemic. resolved myself with attitude of we’ll g...

Scalability becomes the basic need for distributed systems. With the increase of users, load on application servers also keep increasing. This requires a critical action to balance the load on servers. Load balancing is the concept of balancing load on servers using various load balancing techniques. In this paper we discuss various load-balancing techniques that are currently available. We dis...

This paper proposes a technique for load balancing on symmetric multiprocessor systems, where tasks are placed in queues for being processed. Load balancing on processers was run using the RED algorithm and fuzzy system. This system which involves three threads and load balancing was carried out based on these threads. Load balancing operation was carried out in symmetric processers. Load balan...

The balancing numbers are natural numbers n satisfying the Diophantine equation 1 + 2 + 3 + · · · + (n − 1) = (n + 1) + (n + 2) + · · · + (n + r); r is the balancer corresponding to the balancing number n.The n balancing number is denoted by Bn and the sequence {Bn} ∞ n=1 satisfies the recurrence relation Bn+1 = 6Bn−Bn−1. The balancing numbers posses some curious properties, some like Fibonacci...

It is well known that balancing and Lucas-balancing numbers are expressed as determinants of suitable tridiagonal matrices. The aim of this paper is to express certain subsequences of balancing and Lucas-balancing numbers in terms of determinants of tridiagonal matrices. Using these tridiagonal matrices, a factorization of the balancing numbers is also derived.

The implementation of a load balancing policy on a continuous basis in a delay-limited distributed computing environment may not only drain the computational resources of each computational element (CE), but can also lead to an unnecessary exchange of loads between the CEs. This degrades the system performance, measured by the overall completion time of the total tasks in the system. Thus, for ...