Patent application number | Description | Published |
20140190191 | MODULAR DATA CENTER - Described are methods, systems, and apparatus, including computer program products, relating to an air module and control thereof. An air module can include a controller, an air intake module configured to receive first air from a first air source and to receive second air from a second air source, an evaporative cooling module in fluid communication with the air intake module, and a mechanical cooling module in fluid communication with the evaporative cooling module. The controller can be configured to cause the intake module to mix the first air and the second air to form intake air, and selectively cool the intake air to form supply air by at least one of causing the evaporative cooling module to selectively cool the intake air, and causing the mechanical cooling module to selectively cool the intake. | 07-10-2014 |
20140190198 | MODULAR DATA CENTER - Described are methods, systems, and apparatus, including computer program products, relating to an air module and control thereof. An air module can include a controller, an air intake module configured to receive first air from a first air source and to receive second air from a second air source, an evaporative cooling module in fluid communication with the air intake module, and a mechanical cooling module in fluid communication with the evaporative cooling module. The controller can be configured to cause the intake module to mix the first air and the second air to form intake air, and selectively cool the intake air to form supply air by at least one of causing the evaporative cooling module to selectively cool the intake air, and causing the mechanical cooling module to selectively cool the intake. | 07-10-2014 |
Patent application number | Description | Published |
20090034537 | TEMPORAL AFFINITY-BASED ROUTING OF WORKLOADS - Techniques for routing client requests among a group of nodes offering a service are described. A coordinator determines that performance could be improved by using affinity-based routing. In one embodiment, the coordinator calculates a Time-to-Live (TTL) metric whereby clients benefit by returning to the same cache and posts this hint to subscribers. Client's start preserving locality data in an affinity context, such that later requests for a connection can be routed to the location last visited. The coordinator measures the system over subsequent intervals. If the gradient of the goodness (viz service quality and capacity) is stable or improving, then the coordinator continues to advise subscribers to use the affinity-based technique. Alternatively, if the gradient of the goodness is deteriorating, then the coordinator posts advice to the subscribers to stop using the affinity-based technique for any instance during the next intervals. | 02-05-2009 |
20090157701 | PARTIAL KEY INDEXES - A partial reverse key index is described, which allows distributed contention as resources vie to insert data into an index as well as allows range scans to be performed on the index. To do so, before an index entry for a key value is inserted into an index, the key value is transformed using a transformation operation that affects a subset of the order of the key value. The index entry is then inserted based on the transformed key value. Because the transformation operation affects the order of the key value, the transformed values associated with two consecutive key values will not necessarily be consecutive. Therefore, the index entries associated with the consecutive key values may be inserted into unrelated portions of the index. | 06-18-2009 |
20090271794 | Global avoidance of hang states in multi-node computing system - Systems, methods, and other embodiments associated with avoiding resource blockages and hang states are described. One example computer-implemented method for a clustered computing system includes determining that a first process is waiting for a resource and is in a blocked state. The resource that the first process is waiting for is identified. A blocking process that is holding the resource is then identified. A priority of the blocking process is compared with a priority the first process. If the priority of the blocking process is lower than the priority of the first process, the priority of the blocking process is increase. In this manner the blocking process can be scheduled for execution sooner and thus release the resource. | 10-29-2009 |
20100161573 | Time Limited Lock Ownership - Described herein are techniques for time limited lock ownership. In one embodiment, in response to receiving a request for a lock on a shared resource, the lock is granted and a lock lease period associated with the lock is established. Then, in response to determining that the lock lease period has expired, one or more lock lease expiration procedures are performed. In many cases, the time limited lock ownership may prevent system hanging, timely detect system deadlocks, and/or improve overall performance of the database. | 06-24-2010 |
20100174802 | SUPER MASTER - Described herein are techniques for using super masters to coordinate accesses by nodes in a database server cluster to data stored in a database. In many cases, the number of inter-nodal messages is reduced, thereby saving the overheads attendant to coordinating accesses in such a system. | 07-08-2010 |
20130111089 | Time Limited Lock Ownership | 05-02-2013 |
20130144842 | FAILOVER AND RESUME WHEN USING ORDERED SEQUENCES IN A MULTI-INSTANCE DATABASE ENVIRONMENT - An approach is disclosed for implementing failover and resume when using ordered sequences in a multi-instance database environment. The approach commences by instantiating a first database instance initially to serve as an active instance, then instantiating a second database instance to serve as an instance of one or more passive instances. The active database establishes mastership over a sequence and then processes requests for the ‘next’ symbol by accessing a shared sequence cache only after accessing a first instance semaphore. The active instance and the passive instance perform a protocol such that upon passive database detection of a failure of the active database, one of the passive database instances takes over mastership of the sequence cache, and then proceeds to satisfy sequence value requests. The particular order is observed in spite of the failure. | 06-06-2013 |
20130145096 | GENERATING AN ORDERED SEQUENCE IN A DATABASE SYSTEM USING MULTIPLE INTERLEAVED CACHES - A method, system, and computer program product is disclosed for generating an ordered sequence from a predetermined sequence of symbols using protected interleaved caches, such as semaphore protected interleaved caches. The approach commences by dividing the predetermined sequence of symbols into two or more interleaved caches, then mapping each of the two or more interleaved caches to a particular semaphore of a group of semaphores. The group of semaphores is organized into bytes or machine words for storing the group of semaphores into a shared memory, the shared memory accessible by a plurality of session processes. Protected (serialized) access by the session processes is provided by granting access to one of the two or more interleaved caches only after one of the plurality of session processes performs a semaphore altering read-modify-write operation (e.g., a CAS) on the particular semaphore. The interleaved caches are assigned values successively from the predetermined sequence using a round-robin assignment technique. | 06-06-2013 |
20130232496 | GLOBAL AVOIDANCE OF HANG STATES IN MULTI-NODE COMPUTING SYSTEM - Systems, methods, and other embodiments associated with avoiding resource blockages and hang states are described. One example computer-implemented method for a computing system includes determining that a first process is waiting for a resource and is in a blocked state. The resource that the first process is waiting for is identified. A blocking process that is holding the resource is then identified. A priority of the blocking process is compared with a priority the first process. If the priority of the blocking process is lower than the priority of the first process, the priority of the blocking process is increased. In this manner the blocking process can be scheduled for execution sooner and thus release the resource. | 09-05-2013 |
20140258187 | GENERATING DATABASE CLUSTER HEALTH ALERTS USING MACHINE LEARNING - A method, system, and computer program product for generating database cluster health alerts using machine learning. A first database cluster known to be operating normally is measured and modeled using machine learning techniques. A second database cluster is measured and compared to the learned model. More specifically, the method collects a first set of empirically-measured variables of a first database cluster, and using the first set of empirically-measured variables a mathematical behavior predictor model is generated. Then, after collecting a second set of empirically-measured variables of a second database cluster over a plurality of second time periods, the mathematical behavior predictor model classifies the observed behavior. The classified behavior might be deemed to be normal behavior, or some form of abnormal behavior. The method forms and report alerts when the classification deemed to be anomalous behavior, or fault behavior. A Bayesian belief network predicts the likelihood of continued anomalous behavior. | 09-11-2014 |
20140258254 | ANALYZING DATABASE CLUSTER BEHAVIOR BY TRANSFORMING DISCRETE TIME SERIES MEASUREMENTS - A method, system, and computer program product for analyzing performance of a database cluster. Disclosed are techniques for analyzing performance of components of a database cluster by transforming many discrete event measurements into a time series to identify dominant signals. The method embodiment commences by sampling the database cluster to produce a set of timestamped events, then pre-processing the timestamped events by tagging at least some of the timestamped events with a semantic tag drawn from a semantic dictionary and formatting the set of timestamped events into a time series where a time series entry comprises a time indication and a plurality of values corresponding to signal state values. Further techniques are disclosed for identifying certain signals from the time series to which is applied various statistical measurement criteria in order to isolate a set of candidate signals which are then used to identify indicative causes of database cluster behavior. | 09-11-2014 |
Patent application number | Description | Published |
20080210455 | Hermetically-Sealed Feed-Through Device and Method of Assembly - A method of making a hermetically-sealed feed-through device includes inserting an elongate conductor or conductors within a hollow portion or portions of a plastic insulator body and inserting the plastic insulator body within a hollow outer jacket to form an assembly. At least one of the conductor or conductors, insulator body, or jacket of the assembly has a plurality of circumferential grooves. Thereafter, the assembly is crimped and/or is swage-crimped at ambient temperature to cause the materials of the conductor or conductors, insulator body, and outer jacket to be displaced or extrude into the grooves thereby creating mechanical interlocks between the conductor or conductors, insulator body, and outer jacket. Additional methods and feed-through devices made by the methods are also disclosed. | 09-04-2008 |
20120151759 | Hermetically-Sealed Feed-Through Device and Method of Assembly - A method of making a hermetically-sealed feed-through device includes inserting an elongate conductor or conductors within a hollow portion or portions of a plastic insulator body and inserting the plastic insulator body within a hollow outer jacket to form an assembly. At least one of the conductor or conductors, insulator body, or jacket of the assembly has a plurality of circumferential grooves. Thereafter, the assembly is crimped and/or is swage-crimped at ambient temperature to cause the materials of the conductor or conductors, insulator body, and outer jacket to be displaced or extrude into the grooves thereby creating mechanical interlocks between the conductor or conductors, insulator body, and outer jacket. Additional methods and feed-through devices made by the methods are also disclosed. | 06-21-2012 |
20120160541 | Hermetically-Sealed Feed-Through Device and Method of Assembly - A method of making a hermetically-sealed feed-through device includes inserting an elongate conductor or conductors within a hollow portion or portions of a plastic insulator body and inserting the plastic insulator body within a hollow outer jacket to form an assembly. At least one of the conductor or conductors, insulator body, or jacket of the assembly has a plurality of circumferential grooves. Thereafter, the assembly is crimped and/or is swage-crimped at ambient temperature to cause the materials of the conductor or conductors, insulator body, and outer jacket to be displaced or extrude into the grooves thereby creating mechanical interlocks between the conductor or conductors, insulator body, and outer jacket. Additional methods and feed-through devices made by the methods are also disclosed. | 06-28-2012 |