The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
One of the serious issues in distributed systems is the design of an efficient dynamic load balancing algorithm that improves the overall performance of the distributed systems. Performance of this dynamic load balancing algorithm heavily depends on the design elements. Therefore, the main concern of this paper is to propose the design of an effective dynamic load balancing algorithm considering various...
It is to select and configure the appropriate constituent components when designing an effective dynamic load balancing algorithm for distributed systems, since the performance of a dynamic load balancing algorithm heavily depends on these components. The main concern of this paper is to analyze and explore the various components for designing dynamic load balancing algorithms and to propose new information...
We study the online stochastic bipartite matching problem, in a form motivated by display ad allocation on the Internet. In the online, but adversarial case, the celebrated result of Karp, Vazirani and Vazirani gives an approximation ratio of 1- 1/e ?? 0.632, a very familiar bound that holds for many online problems; further, the bound is tight in this case. In the online, stochastic case when nodes...
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting row- id lists, via an AND-tree. The performance of this technique depends crucially on the order of lists in this tree: it is important to compute early the intersections that will produce small results. But this optimization is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.