Patent application number | Description | Published |
20080250698 | Three container candle assembly - A dispensing formulation for a candle container assembly. The assembly includes an outer container, a medial container situated within and attached to the outer container, and a gel between the outer container and the medial container. The assembly further includes an inner container which contains a candle. The inner container may be removed and replaced when the candle is completely consumed. | 10-16-2008 |
20080254398 | Three container candle assembly - A candle container assembly. The assembly includes an outer container, a medial container situated within and attached to the outer container, and a gel between the outer container and the medial container. The assembly further includes an inner container which contains a candle. The inner container may be removed and replaced when the candle is completely consumed. | 10-16-2008 |
20090027871 | Display device for creating a backlit effect on a display article - A display device for creating a backlit effect on a display article—such as a photograph—with a candle. The display device includes a candle container and a display panel attached to the wall of the candle container by a spacer. The wall of the candle, display panel, and spacer together form a pocket for receiving the display article. Both the display panel and inner wall are clear to allow the light of the candle to transmit through the display device and create a backlit effect on the display article that is viewable through the display panel | 01-29-2009 |
20090129066 | Display device for creating a backlit effect on a display article - A display device for creating a backlit effect on a display article—such as a photograph—with a candle. The display device includes a candle container and a display panel attached to the wall of the candle container by a stand-off. The wall of the candle, display panel, and stand-off together form a pocket for receiving a sleeve which receives a display article. Both the display panel, inside wall and sleeve allow the light of the candle to transmit through the display device and create a backlit effect on the display article that is viewable through the display panel. | 05-21-2009 |
20110212195 | DISPENSING FORMULATION - A dispensing formulation for use in combination with an indirect heating source. In the preferred embodiment the dispensing formulation includes an additive such as a fragrance or a therapeutic compound, a hydrocarbon oil, having a flash point below 400° F. (generally between 330-400° F., most preferably between 330-355° F.) and a mixture of commercially available triblock polymers, such as Kraton® and Septon®. | 09-01-2011 |
Patent application number | Description | Published |
20140040301 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 02-06-2014 |
20160085803 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085804 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085805 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085806 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085818 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085819 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085820 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085821 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085822 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085823 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085824 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085825 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085826 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085827 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
Patent application number | Description | Published |
20110299389 | Real Time Monitoring, Onset Detection And Control Of Congestive Phase-Transitions in Communication Networks - Systems and methods for managing network congestion through detecting the closeness to network congestion. The network includes a plurality of network nodes, where each node has at least one neighboring node and each node has a buffer for a queue of packets from other nodes. The system measures queue length at a node and the node's neighboring nodes, processes the measured queue lengths to obtain patterns of fluctuations for the measured queue length. The system determines if one or more of the measured nodes are in a transition-onset status toward a phase transition point based on the obtained patterns of fluctuation and generates congestion control signals based on the determination to route network traffic away. The phase transition point corresponds to a change from a non-congestive phase of the measured nodes to a congestive phase of the measured nodes. | 12-08-2011 |
20120020216 | COGNITIVE NETWORK LOAD PREDICTION METHOD AND APPARATUS - Loads for a wireless network having a plurality of end nodes are predicted by constructing a computer data set of end-to-end pairs of the end nodes included in the network using a computer model of the network; constructing a computerized set of observables from social information about users of the network; developing a computerized learned model of predicted traffic using at least the data set and the observables; and using the computerized learned model to predict future end-to-end network traffic. | 01-26-2012 |
20120250575 | Automated Policy Generation for Mobile Communication Networks - A solution to the problem of automated policy generation for mobile ad hoc networks includes an optimization-based, utility-driven approach aimed at generating optimal policies with respect to the given network objectives. The combination of optimization heuristics and network simulation is used to solve the problem. Specifically, the problem of automated generation of network management policies based on available network plans and related information is solved by converting the policy generation into the following optimization problem: given network information and objectives as input, generate optimal policies as output. The optimization process is guided by a utility function based on performance evaluation criteria reflecting the network objectives. | 10-04-2012 |
20120257498 | METHOD AND SYSTEM FOR PROVIDING END-TO-END QoS IN CONVERGED NETWORKS USING PROBABILISTIC PREFERENTIAL ADMISSION CONTROL - Network management for providing and managing Quality of Service (QoS) in converged networks, and particularly management of bursty, short-lived data loads, in an opaque network where knowledge of or control over network elements is not required. Preferential treatment is provided to some subset of the network users that require better QoS assurances from the underlying network by applying probabilistic admission control decisions in conjunction with estimated network state provides improved performance for high priority data with bursty data loads. | 10-11-2012 |
20130218549 | DYNAMIC TIME VIRTUALIZATION FOR SCALABLE AND HIGH FIDELITY HYBRID NETWORK EMULATION - A system and method for measurement of the performance of a network by simulation, wherein time divergence is addressed by using discrete event simulation time to control and synchronize time advance or time slow down on virtual machines for large-scale hybrid network emulation, particularly where the loss of fidelity could otherwise be substantial. A dynamic time control and synchronization mechanism is implemented in a hypervisor clock control module on each test bed machine, which enables tight control of virtual machine time using time information from the simulation. A simulator state introspection and control module, running alongside the simulator, enables extraction of time information from the simulation and control of simulation time, which is supplied to the virtual machines. This is accomplished with a small footprint and low overhead. | 08-22-2013 |
20130218817 | ACTIVE ACQUISITION OF PRIVILEGED INFORMATION - A method for active learning using privileged information is disclosed. A processing device receives a set of labeled examples and a set of unlabeled examples. For each unlabeled example in the set of unlabeled examples, the processing device determines whether to query at least one of an oracle to obtain a label for the unlabeled example or a teacher to obtain privileged information about the unlabeled example. The processing device outputs a decision rule based on minimizing a number of queries to the oracle for a label and the teacher for privileged information. Minimizing the number of queries to the teacher and the oracle is based on a cost of querying the teacher or the oracle. | 08-22-2013 |
20140082730 | SYSTEM AND METHOD FOR CORRELATING HISTORICAL ATTACKS WITH DIVERSE INDICATORS TO GENERATE INDICATOR PROFILES FOR DETECTING AND PREDICTING FUTURE NETWORK ATTACKS - An apparatus and method predict and detect network attacks by using a diverse set of indicators to measure aspects of the traffic and by encoding traffic characteristics using these indicators of potential attacks or anomalous behavior. The set of indicators is analyzed by supervised learning to automatically learn a decision rule which examines the temporal patterns in the coded values of the set of indicators to accurately detect and predict network attacks. The rules automatically evolve in response to new attacks as the system updates its rules periodically by analyzing new data and feedback signals about attacks associated with that data. To assist human operators, the system also provides human interpretable explanations of detection and prediction rules by pointing to indicators whose values contribute to a decision that there is an existing network attack or an imminent network attack. When such indictors are detected, an operator can take remediation actions. | 03-20-2014 |
20140355454 | Communication Node Operable to Estimate Faults in an Ad Hoc Network and Method of Performing the Same - A communication node operable to estimate faults in a mobile ad hoc network and method of performing the same. In one embodiment, the communication node includes a processor and memory including computer program code configured to, with the processor, cause the communication node to monitor a set of observable parameters at the communication node, produce a fault estimate at the communication node from the set of observable parameters, and provide the fault estimate to a global fault detector at another communication node. | 12-04-2014 |
Patent application number | Description | Published |
20140040301 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 02-06-2014 |
20160085803 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085804 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085805 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085806 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085818 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085819 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085820 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085821 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085822 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085823 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085824 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085825 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085826 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085827 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
Patent application number | Description | Published |
20080288903 | Generating testcases based on numbers of testcases previously generated - An apparatus, computer system, and storage medium that, in an embodiment, receive elements and a goal for each of the elements. In various embodiments, the elements may represent commands or parameter values for a device to be tested. Testcases are generated based on the elements. If the numbers of testcases for the elements are equally distant from their goals, then a new testcase is generated based on an element chosen at random. But, if the numbers of testcases are not equally distant from their goals, then the new testcase is generated based on the element whose number of testcases if furthest from its respective goal. The number of testcases associated with the chosen element is then incremented, and the process is repeated. In this way, the generated testcases are based on the numbers of previously generated testcases, which, in an embodiment, results in more complete coverage of testcases for the device under test. | 11-20-2008 |
20090138629 | Utilizing Programmable Channels for Allocation of Buffer Space and Transaction Control in Data Communications - A control mechanism for data bus communications employs channels to which bus transactions are assigned, each channel having independent flow control. The control mechanism enforces an ordering algorithm among channels, whereby at least some transactions may pass other transactions. Channel attributes are programmable to vary the ordering conditions. Preferably, each channel is allocated its own programmable buffer area. The control mechanism independently determines, for each channel, whether buffer space is available and enforces flow control independently for each channel accordingly. Flow control is preferably credit-based, credits representing buffer space or some other capacity of a receiver to receive data. Preferably, the flow control mechanism comprises a central interconnect module controlling internal communications of an integrated circuit chip. | 05-28-2009 |
20110276778 | EFFICIENT SUPPORT OF MULTIPLE PAGE SIZE SEGMENTS - An apparatus, system, and method are disclosed for improved support of MPS segments in a microprocessor. The virtual address is used to generate possible TLB index values for each of the supported page sizes of the MPS segment associated with the virtual address. The possible TLB index values may be a hash generated using the virtual address and one of the supported page sizes. The TLB is searched for actual TLB index values that match the possible TLB index values calculated using the different supported page sizes. TLB entries associated with those actual TLB index values are checked to determine whether any TLB entry is associated with the virtual address. If no match is found, the real address is retrieved from the PT. The actual page size in the PT is used to generate an actual TLB index value for the virtual address and the TLB entry is inserted into the TLB. | 11-10-2011 |
20110283040 | Multiple Page Size Segment Encoding - An approach identifies an amount of high order bits used to store a memory address in a memory address field that is included in a memory. This approach calculates at least one minimum number of low order bits not used to store the address with the calculation being based on the identified amount of high order bits. The approach retrieves a data element from one of the identified minimum number of low order bits of the address field and also retrieves a second data element from one of the one of the identified minimum number of low order bits of the address field. | 11-17-2011 |
20140122840 | EFFICIENT USAGE OF A MULTI-LEVEL REGISTER FILE UTILIZING A REGISTER FILE BYPASS - A processor includes an execution unit, a first level register file, a second level register file, a plurality of storage locations and a register file bypass controller. The first and second level register files are comprised of physical registers, with the first level register file more efficiently accessed relative to the second level register file. The register file bypass controller is coupled with the execution unit and second level register file. The register file bypass controller determines whether an instruction indicates a logical register is unmapped from a physical register in the first level register file. The register file controller also loads data into one of the storage locations and selects one of the storage locations as input to the execution unit, without mapping the logical register to one of the physical registers in the first level register file. | 05-01-2014 |
20140122842 | EFFICIENT USAGE OF A REGISTER FILE MAPPER MAPPING STRUCTURE - A processor with a register file mapper can use a hasher to improve the distribution of mappings within a mapping structure. The hasher generates a value based, at least in part, on a thread identifier and logical register identifier. The hash value is used as an index value into the mapping structure. The hashing algorithm is chosen to provide a more even distribution of mappings within the mapping structure, reducing the amount of data written from a first level register file to a second level register file. | 05-01-2014 |
20140143523 | SPECULATIVE FINISH OF INSTRUCTION EXECUTION IN A PROCESSOR CORE - In a processor core, high latency operations are tracked in entries of a data structure associated with an execution unit of the processor core. In the execution unit, execution of an instruction dependent on a high latency operation tracked by an entry of the data structure is speculatively finished prior to completion of the high latency operation. Speculatively finishing the instruction includes reporting an identifier of the entry to completion logic of the processor core and removing the instruction from an execution pipeline of the execution unit. The completion logic records dependence of the instruction on the high latency operation and commits execution results of the instruction to an architected state of the processor only after successful completion of the high latency operation. | 05-22-2014 |
20150370573 | SPECULATIVE FINISH OF INSTRUCTION EXECUTION IN A PROCESSOR CORE - In a processor core, high latency operations are tracked in entries of a data structure associated with an execution unit of the processor core. In the execution unit, execution of an instruction dependent on a high latency operation tracked by an entry of the data structure is speculatively finished prior to completion of the high latency operation. Speculatively finishing the instruction includes reporting an identifier of the entry to completion logic of the processor core and removing the instruction from an execution pipeline of the execution unit. The completion logic records dependence of the instruction on the high latency operation and commits execution results of the instruction to an architected state of the processor only after successful completion of the high latency operation. | 12-24-2015 |
20160117173 | PROCESSOR CORE INCLUDING PRE-ISSUE LOAD-HIT-STORE (LHS) HAZARD PREDICTION TO REDUCE REJECTION OF LOAD INSTRUCTIONS - A processor core supporting out-of-order execution (OOE) includes load-hit-store (LHS) hazard prediction at the instruction execution phase, reducing load instruction rejections and queue flushes at the dispatch phase. The instruction dispatch unit (IDU) detects likely LHS hazards by generating entries for pending stores in a LHS detection table. The entries in the table contain an address field (generally the immediate field) of the store instruction and the register number of the store. The ISU compares the address field and register number for each load with entries in the table to determine if a likely LHS hazard exists and if an LHS hazard is detected, the load is dispatched to the issue queue of the load-store unit (LSU) with a tag corresponding to the matching store instruction, causing the LSU to dispatch the load only after the corresponding store has been dispatched for execution. | 04-28-2016 |
20160117174 | PROCESSING METHOD INCLUDING PRE-ISSUE LOAD-HIT-STORE (LHS) HAZARD PREDICTION TO REDUCE REJECTION OF LOAD INSTRUCTIONS - A processing method supporting out-of-order execution (OOE) includes load-hit-store (LHS) hazard prediction at the instruction execution phase, reducing load instruction rejections and queue flushes at the dispatch phase. The instruction dispatch unit (IDU) detects likely LHS hazards by generating entries for pending stores in a LHS detection table. The entries in the table contain an address field (generally the immediate field) of the store instruction and the register number of the store. The ISU compares the address field and register number for each load with entries in the table to determine if a likely LHS hazard exists and if an LHS hazard is detected, the load is dispatched to the issue queue of the load-store unit (LSU) with a tag corresponding to the matching store instruction, causing the LSU to dispatch the load only after the corresponding store has been dispatched for execution. | 04-28-2016 |
Patent application number | Description | Published |
20100250998 | METHODS AND APPARATUSES FOR CONTROLLING THREAD CONTENTION - An apparatus comprises a plurality of cores and a controller coupled to the cores. The controller is to lower an operating point of a first core if a first number based on processor clock cycles per instruction (CPI) associated with a second core is higher than a first threshold. The controller is operable to increase the operating point of the first core if the first number is lower than a second threshold. | 09-30-2010 |
20120221874 | Methods And Apparatuses For Controlling Thread Contention - An apparatus comprises a plurality of cores and a controller coupled to the cores. The controller is to lower an operating point of a first core if a first number based on processor clock cycles per instruction (CPI) associated with a second core is higher than a first threshold. The controller is operable to increase the operating point of the first core if the first number is lower than a second threshold. | 08-30-2012 |
20130132969 | Methods And Apparatuses For Controlling Thread Contention - An apparatus comprises a plurality of cores and a controller coupled to the cores. The controller is to lower an operating point of a first core if a first number based on processor clock cycles per instruction (CPI) associated with a second core is higher than a first threshold. The controller is operable to increase the operating point of the first core if the first number is lower than a second threshold. | 05-23-2013 |
20130191666 | Methods and Apparatuses for Controlling Thread Contention - An apparatus comprises a plurality of cores and a controller coupled to the cores. The controller is to lower an operating point of a first core if a first number based on processor clock cycles per instruction (CPI) associated with a second core is higher than a first threshold. The controller is operable to increase the operating point of the first core if the first number is lower than a second threshold. | 07-25-2013 |
20140007098 | PROCESSOR ACCELERATOR INTERFACE VIRTUALIZATION | 01-02-2014 |
20140115259 | Methods And Apparatuses For Controlling Thread Contention - An apparatus comprises a plurality of cores and a controller coupled to the cores. The controller is to lower an operating point of a first core if a first number based on processor clock cycles per instruction (CPI) associated with a second core is higher than a first threshold. The controller is operable to increase the operating point of the first core if the first number is lower than a second threshold. | 04-24-2014 |
20140215240 | Methods And Apparatuses For Controlling Thread Contention - An apparatus comprises a plurality of cores and a controller coupled to the cores. The controller is to lower an operating point of a first core if a first number based on processor clock cycles per instruction (CPI) associated with a second core is higher than a first threshold. The controller is operable to increase the operating point of the first core if the first number is lower than a second threshold. | 07-31-2014 |
20150095675 | Methods And Apparatuses For Controlling Thread Contention - An apparatus comprises a plurality of cores and a controller coupled to the cores. The controller is to lower an operating point of a first core if a first number based on processor clock cycles per instruction (CPI) associated with a second core is higher than a first threshold. The controller is operable to increase the operating point of the first core if the first number is lower than a second threshold. | 04-02-2015 |
20160077844 | Methods And Apparatuses For Controlling Thread Contention - An apparatus comprises a plurality of cores and a controller coupled to the cores. The controller is to lower an operating point of a first core if a first number based on processor clock cycles per instruction (CPI) associated with a second core is higher than a first threshold. The controller is operable to increase the operating point of the first core if the first number is lower than a second threshold. | 03-17-2016 |
Patent application number | Description | Published |
20150113092 | METHOD AND APPARATUS FOR DISTRIBUTED ENTERPRISE DATA PATTERN RECOGNITION - An apparatus for accessing data in an enterprise data storage system. The apparatus includes memory for storing data, a storage controller, a secure hypervisor, and an interface. The storage controller is coupled to the memory and is configured for managing data stored in the memory. The controller is also configured to receive a command from a client device to access specified data in the memory. The secure virtualized hypervisor within the memory is configured for deploying an operating system of the storage controller for purposes of secure operation by the storage controller. The interface is configured for communicating with the storage controller and initiates the storage controller to perform the command on the specified data that is fetched into the secure virtualized hypervisor, wherein results of the command is transmitted over a network to the client device. | 04-23-2015 |
20150242502 | File Joining on Back End Device - A device comprises a receiver configured to receive a join-lookup remote procedural call (RPC) for a file, wherein the join-lookup RPC requests a join operation of sub-files associated with the file, and a transmitter configured to transmit the file in response to the Join-Lookup RPC. A distributed file system (DFS) client comprises a transmitter configured to transmit a join-lookup RPC for a file, wherein the join-lookup RPC requests a join operation of sub-files associated with the file, and a receiver configured to receive the file in response to the Join-Lookup RPC. A method comprises receiving a join-lookup RPC for a file, wherein the join-lookup RPC requests a join operation of sub-files associated with the file, and transmitting the file in response to the Join-Lookup RPC. | 08-27-2015 |
20160072885 | ARRAY-BASED COMPUTATIONS ON A STORAGE DEVICE - An instruction from an application server to perform a computation is received at a network-attached storage (NAS) device. The computation uses arrays of data that are stored by the NAS device as inputs. The instruction includes remote procedure calls that identify operations that are included in the computation, including a first remote procedure call that will cause the NAS device to perform a read operation on a first file containing an array of data to be used as an input for the computation, and a second remote procedure call that will cause the NAS device to perform an array operation using the array of data. The operations are executed on the NAS device to produce a result that is stored in a second file in a location in a file system managed by the NAS device and accessible to the application server. | 03-10-2016 |