Abstract: Examples of load balancing across multiple computing nodes of distributed computing systems is described herein. Examples include determining whether an application request is part of a first application request set or a second application request set, and routing the application request to a first computing node or a second computing node of a computing node cluster based on the determination. Other examples include determining whether a database operation request directed to a database is part of a first database operation set or a second database operation set, and routing the database operation request to a first server using a first instance of the database or a second server using a second instance of the database based on the determination. Routing the application and database operation requests based on criteria of the respective request may improve execution efficiency of the requests.

Abstract: An aspect of the present disclosure is directed to scheduling of a fixed number of non-sharable resources. In one embodiment, a schedule data specifying respective durations in which a non-sharable resource is allocated to corresponding sets of users is maintained. A check is performed in a duration (between start and end time instances) whether the non-sharable resource is being used by a set of users specified in the schedule data. The non-sharable resource is deallocated from the set of users within the duration if checking determines that the non-sharable resource is not being used by the set of users. Accordingly, the non-sharable resource is made available for allocation before the end time instance.

Abstract: The present invention is a system and method for searching a large database of dig location tickets for tickets of particular interest. A user can locate an area of concern on an on-screen map and can view a list of tickets received for a given date range of the map. For example, when underground plant damage occurs in a particular region, users need not text-search in the database to locate a particular ticket that may have caused the damage, but can instead locate the ticket using the enhanced on-screen map of the invention.