Abstract: A database management engine provides a user interface that allows users to access and modify employee information in a database. The database includes entries for employees, and each database entry includes identifying information about the associated employee. A user can request to modify data within database entries, for instance in order to update information associated with an employee. Responsive to the request, the database management engine identifies liabilities associated with the database modification stemming from associated tax laws. Based on the identified tax liabilities, the engine computes the aggregate tax liability owed by the employer and/or employee. Before modifying a database entry, the engine modifies the user interface to include interface elements detailing the computed aggregate tax liability. The user explicitly can be required to confirm the database modification in view of the aggregate tax liability.

Abstract: Embodiments for graphical processing unit (GPU) resource sharing in a computing cluster, by a processor device. Resource-specific stages are dynamically generated in a directed acyclic graph (DAG) using a DAG interpreter for a set of tasks by creating equivalence stages in the DAG having an associated inserted set of shuffle stages, the equivalence stages created based on a determined cost of each stage of the set of shuffle stages. Backlog tasks are scheduled and tasks within the set of tasks are shifted among respective stages in the equivalence stages according to the determined cost to avoid overlapping allocation of the GPU resource during central processing unit (CPU) execution of the respective tasks of the set of tasks.

Abstract: Embodiments for graphical processing unit (GPU) resource sharing in a computing cluster, by a processor device. Resource-specific stages are dynamically generated in a directed acyclic graph (DAG) using a DAG interpreter for a set of tasks by creating equivalence stages in the DAG having an associated inserted set of shuffle stages, the equivalence stages created based on a determined cost of each stage of the set of shuffle stages. Backlog tasks are scheduled and tasks within the set of tasks are shifted among respective stages in the equivalence stages according to the determined cost to avoid overlapping allocation of the GPU resource during central processing unit (CPU) execution of the respective tasks of the set of tasks.