Patent application number | Description | Published |
20100169166 | DATA QUALITY TESTS FOR USE IN A CAUSAL PRODUCT DEMAND FORECASTING SYSTEM - An improved method for forecasting and modeling product demand for a product. The forecasting methodology employs a causal methodology, based on multiple regression techniques, to model the effects of various factors on product demand, and hence better forecast future patterns and trends, improving the efficiency and reliability of the inventory management systems. The improved method identifies linear dependent causal factors and removes redundant causal factors from the regression analysis. A product demand forecast is generated by blending forecast or expected values of the non-redundant causal factors together with corresponding regression coefficients determined through the analysis of historical product demand and factor information. | 07-01-2010 |
20110040773 | DATA ROW PACKING APPARATUS, SYSTEMS, AND METHODS - Apparatus, systems, and methods may operate to receive a designation of multiple rows to supply data to a single user defined function, which is made available in a structured query language SELECT statement. Further activities may include retrieving the data from at least one storage medium, packing each of the multiple rows having a common key into a single row, and transforming the data from a first state into a second state by applying the single function to the data using a single access module processor. Other apparatus, systems, and methods are disclosed. | 02-17-2011 |
20120150700 | METHOD AND SYSTEM FOR DISTRIBUTING INVENTORY OF A REPLACED OR DISCONTINUED DISTRIBUTION CENTER PRODUCT - A method and system for distributing inventory of a replaced or discontinued product from a warehouse or distribution center to a plurality of stores. The method optimally distributes the inventory of the replaced or discontinued product from the distribution center, keeping in mind the demand for a replacing product at the stores supported by the distribution center. The described system and method calculates replaced (old) and replacing (new) store product order quantities; rounds the replaced and replacing product order quantities if necessary due to product packaging; and ensures that the aggregate of the replaced product order quantity does not exceed distribution center on-hand inventory for the replaced product. | 06-14-2012 |
Patent application number | Description | Published |
20100122036 | METHODS AND APPARATUSES FOR IMPROVING SPECULATION SUCCESS IN PROCESSORS - Methods and apparatuses are disclosed for improving speculation success in processors. In some embodiments, the method may include executing a plurality of threads of program code, the plurality of threads comprising a first speculative load request, setting an indicator bit corresponding to a cache line in response to the first speculative load request, and in the event that a second speculative load request from the plurality of threads refers to a first cache line with the indicator bit set, determining if a second cache line is available. | 05-13-2010 |
20110202725 | SOFTWARE-ACCESSIBLE HARDWARE SUPPORT FOR DETERMINING SET MEMBERSHIP - A method and processor supporting architected instructions for tracking and determining set membership, such as by implementing Bloom filters. The apparatus includes storage arrays (e.g., registers) and an execution core configured to store an indication that a given value is a member of a set, including by executing an architected instruction having an operand specifying the given value, wherein executing comprises hashing applying a hash function to the value to determine an index into one of the storage arrays and setting a bit of the storage array corresponding to the index. An architected query instruction is later executed to determine if a query value is not a member of the set, including by applying the hash function to the query value to determine an index into the storage array and determining whether a bit at the index of the storage array is set. | 08-18-2011 |
20120246437 | METHOD AND APPARATUS FOR USING UNUSED BITS IN A MEMORY POINTER - The disclosed embodiments provide a system that uses unused bits in a memory pointer. During operation, the system determines a set of address bits in a address space that will not be needed for addressing purposes during program operation. Subsequently, the system stores data associated with the memory pointer in this set of address bits. The system masks this set of address bits when using the memory pointer to access the memory address associated with the memory pointer. Storing additional data in unused pointer bits can reduce the number of memory accesses for a program and improve program performance and/or reliability. | 09-27-2012 |
20130013843 | EFFICIENT STORAGE OF MEMORY VERSION DATA - Systems and methods for efficient memory corruption detection in a processor. A processor detects a first data structure is to be allocated in a physical memory. The physical memory may be a DRAM with a spare bank of memory reserved for a hardware failover mechanism. Either the processor or an operating system (OS) determines a first version number corresponding to the first data structure. During initialization of the first data structure, the first version number may be stored in a first location in the spare bank. The processor receives from the OS a pointer holding the first version number. When the processor executes memory access operations targeting the first data structure, the processor compares the first version number with a third version number stored in a location in the physical memory indicated by the memory access address. The processor may set a trap in response to determining a mismatch. | 01-10-2013 |
20130036276 | INSTRUCTIONS TO SET AND READ MEMORY VERSION INFORMATION - Systems and methods for providing additional instructions for supporting efficient memory corruption detection in a processor. A physical memory may be a DRAM with a spare bank of memory reserved for a hardware failover mechanism. Version numbers associated with data structures allocated in the memory may be generated so that version numbers of adjacent data structures are different. A processor determines that a fetched instruction is a memory access instruction corresponding to a first data structure within the memory. For instructions that are not a version update instruction, the processor compares the first version number and second version number stored in a location in the memory indicated by the generated address and flags an error if there is a mismatch. For version update instructions, the processor performs a memory access operation on the second version number with no comparison check. | 02-07-2013 |
20130036332 | MAXIMIZING ENCODINGS OF VERSION CONTROL BITS FOR MEMORY CORRUPTION DETECTION - Systems and methods for maximizing a number of available states for a version number used for memory corruption detection. A physical memory may be a DRAM comprising a plurality of regions. Version numbers associated with data structures allocated in the physical memory may be generated so that version numbers of adjacent data structures in a virtual address space are different. A reserved set and an available set of version numbers are associated with each one of the plurality of regions. A version number in a reserved set of a given region may be in an available set of another region. The processor detects no memory corruption error in response to at least determining a version number stored in a memory location in a first region identified by a memory access operation is also in a reserved set associated with the first region. | 02-07-2013 |