Abstract: An optimized method of processing queries requesting a description of a spatial relationship between a test geometry and a query geometry, such as points, lines, polygons, and collections thereof, is disclosed. A first part of the method finds a first spatial relationship between a minimum bounding rectangle (MBR) of the test geometry and an In-Memory R-tree (IMR-tree) built to describe the query geometry. If the first relationship does not specify the requested description, then a second part of the method uses the IMR-tree of the query geometry to find a second spatial relationship between the test geometry itself and the query geometry. Optimizations are applied to the first part and to the second part. Optimizations in the second part depend on the test geometry.

Abstract: A system and method can support cooperative concurrency in a priority queue. The priority queue, which includes a calendar ring and a fast lane, can detect one or more threads that contend to claim one or more requests in the priority queue. Then, a victim thread can place a request in the fast lane in the priority queue, and release a contending thread, which proceeds to consume the request in the fast lane.

Abstract: A method for managing bandwidth of a bus connecting a peripheral device to a host system includes sending, over the bus, a first read request to the host system, incrementing a pending read counter by an amount corresponding to the requested data, receiving, in response to sending the first read request, at least a portion of the requested data from the host system, decrementing the pending read counter by an amount corresponding to the at least the portion of the requested data, and comparing the counter and a threshold to obtain a result. Based on the result, a scheme is selected for managing the bandwidth of the bus. The scheme specifies a ratio of read requests and write requests to be sent on the bus. The method further includes sending, based on the scheme, a second request that is a write request or a second read request.

Abstract: A system for the management of rack-mounted field replaceable units (FRUs) that affords the enhanced availability and serviceability of FRUs provided by blade-based systems but in a manner that accommodates different types of FRUs (e.g., in relation to form factors, functionality, power and cooling requirements, and/or the like) installed within a rack or cabinet.

Abstract: A method for content addressable memory (CAM) error recovery that includes detecting an error in an entry of a CAM, identifying an address of the entry in the CAM, copying data from the address in the backup random access memory (RAM) into the entry of the CAM to obtain a corrected CAM, clearing a results (first in first out) FIFO structure based on detecting the error, performing, using the corrected CAM, a match request stored in a replay FIFO structure to obtain a revised result, and storing the revised result in the results FIFO structure.

Abstract: A system for the management of rack-mounted field replaceable units (FRUs) that affords the enhanced availability and serviceability of FRUs provided by blade-based systems but in a manner that accommodates different types of FRUs (e.g., in relation to form factors, functionality, power and cooling requirements, and/or the like) installed within a rack or cabinet.

Abstract: A method for optimized address pre-translation for a host channel adapter (HCA) static memory structure is disclosed. The method involves determining whether the HCA static memory structure spans a contiguous block of physical address space, when the HCA static memory structure spans the contiguous block of physical address space, requesting a translation from a guest physical address (GPA) to a machine physical address (MPA) of the HCA static memory structure, storing a received MPA corresponding to the HCA static memory structure in an address control and status register (CSR) associated with the HCA static memory structure, marking the received MPA stored in the address CSR as a pre-translated address, and using the pre-translated MPA stored in the address CSR when a request to access the static memory structure is received.

Abstract: A system and method can use continuation-passing to transform a queue from non-blocking to blocking. The non-blocking queue can maintain one or more idle workers in a thread pool that is not accessible from outside of the non-blocking queue. The continuation-passing can eliminate one or more serialization points in the non-blocking queue, and allows a caller to manage the one or more idle workers in the thread pool from outside of the non-blocking queue.

Abstract: A system and method can support a concurrent priority queue. The concurrent priority queue allows a plurality of threads to interact with the priority queue. The priority queue can use a sequencer to detect and order a plurality of threads that contend for one or more requests in the priority queue. Furthermore, the priority queue operates to reduce the contention among the plurality of threads.

Abstract: A system for the management of rack-mounted field replaceable units (FRUs) that affords the enhanced availability and serviceability of FRUs provided by blade-based systems but in a manner that accommodates different types of FRUs (e.g., in relation to form factors, functionality, power and cooling requirements, and/or the like) installed within a rack or cabinet.

Abstract: A system for the management of rack-mounted field replaceable units (FRUs) that affords the enhanced availability and serviceability of FRUs provided by blade-based systems but in a manner that accommodates different types of FRUs (e.g., in relation to form factors, functionality, power and cooling requirements, and/or the like) installed within a rack or cabinet.

Abstract: A system and method can support design pattern automation. A design environment, such as a design pattern automation platform, enables the definition of design patterns including the model entities and their relationships. The design pattern automation platform leverages the definitions and user input, and uses an intelligent method to automate the implementation of arbitrarily complex software design artifacts that realize the design patterns. The design pattern automation platform allows a user to specify a design pattern model that describes a design pattern. A user interface (UI) framework can consume the design pattern model and can render a set of UI pages that allow for user interaction with the design pattern. Furthermore, a pattern processor can combine the meta-model with user inputs from the UI framework and produce a set of entities or resources for the design pattern.

Abstract: A method for remapping VNICs associated with an aggregation layer. The method includes making a first determination that a first network interface card (NIC) has failed, where the first NIC and a second NIC are part of the aggregation group, the aggregation layer manages the aggregation group, where a first virtual NIC (VNIC) is mapped to the first NIC and a second VNIC is mapped to the second NIC, and the first NIC is connected to a first switch and the second NIC is connected to a second switch. The method further includes, based on the first determination, remapping the first VNIC to the second NIC, and after the remapping, receiving packets by the first VNIC from the second NIC.

Abstract: Techniques for validating hierarchically structured data according to a collected hierarchical object rule set. The validation techniques account for any open content in the hierarchical object and any downscoped rules in the hierarchical object rule set. In addition, the validation techniques can be applied to efficiently identify rules in the hierarchical object rule set that fail during validation and the nodes of the hierarchical object that cause those rules to fail.

Abstract: A clustered database environment includes multiple database instances that appear as one server. An application server can use a data source and connection pools to connect with the clustered database. A notification service broadcasts notifications describing state changes in the database instances, which are then used by the data source and connection pools to control access to the database instances. A data source configuration allows for specification of a preferred affinity policy. A session affinity policy is used to provide database instance affinity for database access made under the context of a web session, whereby database operations are directed to a particular instance for a period of time when the application may be performing multiple, related updates to a specific data set. Directing such operations to a single database instance can be used to improve application performance due to increased local cache utilization.

Abstract: Systems, methods, and other embodiments associated with feature generation and model selection for generalized linear models are described. In one embodiment, a method includes ordering candidate features in a dataset being considered by a streamwise feature selection process according to an inclusion score that reflects a likelihood that a given candidate feature will be included in the GLM. The ordered candidate features are provided to the streamwise feature selection process for acceptance testing. In one embodiment, the method also includes selecting penalty criterion for use in the acceptance testing that is based on characteristics of the dataset.

Abstract: A patch installation procedure may be generated and executed that is specific both to the patch and the configuration of the target computing system. Configuration data may be received that indicates the configuration of the target computing system. Installation metadata for the patch, describing the operations to be performed for installing the patch may also be received. A patch installation procedure may be generated that is based on both the configuration data and the installation metadata. This patch installation procedure may then be executed to automatically install the patch on the target computing system. In at least some embodiments, the target computing system may a distributed computing system including multiple nodes.

Abstract: Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

Abstract: Processes, machines, and stored machine instructions are provided for approximating value densities in data. While generating a resulting density model to approximate value densities in a set of data, density modeling logic selects a functional component of a first model to vary based at least in part on how much the functional component contributes to how well the first model approximates the value densities. The density modeling logic then uses at least the functional component and a variation of the functional component as seed components to determine adjusted functional components of a second model by iteratively determining, in an expectation step, how much the seed components contribute to how well the second model explains the values, and, in a maximization step, new seed components, optionally to be used in further iterations, based at least in part on how much of the values are attributable to the seed components.

Abstract: A method for detecting defects in a computer program.