Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving a request, including a first application priority, to run a task for an application. At least one second application priority is identified. A maximum number of parallel tasks per application priority is determined. Application priority weights are assigned to the first application priority and the second application priorities. Application priority divisors are determined, for the first application priority and the second application priorities, based on a respective application priority weight and a number of currently running applications of a respective application priority. A number of parallel tasks for the first application and other applications are determined based on the maximum number of allowable parallel tasks per application, an overall divisor, and a respective application priority weight.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving, in a dispatching layer, a request to run a first task for a first application, the request including a first application priority. At least one second application priority of at least one currently running application is identified. A maximum number of allowable parallel tasks per application is determined. Application priority weights are assigned to each of the first application priority and the at least one second application priority. A number of parallel tasks for the first application and the at least one currently running application are determined based on the maximum number of allowable parallel tasks per application and the assigned application priority weights. A first number of parallel tasks are assigned to the first application. The first application is executed using the assigned first number of parallel tasks.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes tracking assignments by a dispatcher of tasks to servers in a data structure. The data structure includes at least one entry for each server, with a number of entries per server being based on a capacity of the server. Servers with greater capacity have more entries than servers with lesser capacity. An entry represents either an assignment of a task to a server or an available slot indicating an availability of a server to execute a task. A first server has a lesser capacity than a second server. The tracking of assignment of tasks to servers in the data structure results in more tasks being assigned to the second server than the first server, due to faster task completion by the second server.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving, by a first dispatcher in a dispatching layer, a first request to run a first task for a first application, the first request including a first application priority. A determination is made that the first application priority is lower than at least one higher application priority of another application. Execution of the first application is suspended based on determining that the first application priority is lower than the at least one higher application priority. An indication that an application having a higher application priority has finished is received. A determination is made that the first application priority is a highest application priority of currently-running applications. The first task for the first application is dispatched to a first application server.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving a request to run a first task for a first application, the request including a first application priority. At least one second application priority of at least one currently running application is identified. A dispatching algorithm is executed, to dispatch the first task to a first application server based on the first application priority and the at least one second application priority. Destination information is returned, in response to the request, for the first application server, for execution of the first task for the first application, at the first application server, using the first resources.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes tracking assignments by a dispatcher of tasks to servers in a data structure. The data structure includes at least one entry for each server, with a number of entries per server being based on a capacity of the server. Servers with greater capacity have more entries than servers with lesser capacity. An entry represents either an assignment of a task to a server or an available slot indicating an availability of a server to execute a task. A first server has a lesser capacity than a second server. The tracking of assignment of tasks to servers in the data structure results in more tasks being assigned to the second server than the first server, due to faster task completion by the second server.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving a request to run a first task for a first application, the request including a first application priority. At least one second application priority of at least one currently running application is identified. A dispatching algorithm is executed, to dispatch the first task to a first application server based on the first application priority and the at least one second application priority. Destination information is returned, in response to the request, for the first application server, for execution of the first task for the first application, at the first application server, using the first resources.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving a request, including a first application priority, to run a task for an application. At least one second application priority is identified. A maximum number of parallel tasks per application priority is determined. Application priority weights are assigned to the first application priority and the second application priorities. Application priority divisors are determined, for the first application priority and the second application priorities, based on a respective application priority weight and a number of currently running applications of a respective application priority. A number of parallel tasks for the first application and other applications are determined based on the maximum number of allowable parallel tasks per application, an overall divisor, and a respective application priority weight.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving, in a dispatching layer, a request to run a first task for a first application, the request including a first application priority. At least one second application priority of at least one currently running application is identified. A maximum number of allowable parallel tasks per application is determined. Application priority weights are assigned to each of the first application priority and the at least one second application priority. A number of parallel tasks for the first application and the at least one currently running application are determined based on the maximum number of allowable parallel tasks per application and the assigned application priority weights. A first number of parallel tasks are assigned to the first application. The first application is executed using the assigned first number of parallel tasks.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving, by a first dispatcher in a dispatching layer, a first request to run a first task for a first application, the first request including a first application priority. A determination is made that the first application priority is lower than at least one higher application priority of another application. Execution of the first application is suspended based on determining that the first application priority is lower than the at least one higher application priority. An indication that an application having a higher application priority has finished is received. A determination is made that the first application priority is a highest application priority of currently-running applications. The first task for the first application is dispatched to a first application server.

Abstract: One embodiment of the present invention may be described as an automated gaming system comprising an outcome generating means, a platform surrounding it, and a plurality of player stations. Player stations are communicatively linked to the outcome generating means to provide players with participations in a wagering game. The automated gaming system is adapted to provide player stations to at least five players to concurrently participate in the game, these players being located at similar distance from the outcome generating means and being offered an unobstructed view of the outcome generating means since the player stations are located on one side of a player when the player faces the outcome generating means.