Class / Patent application number | Description | Number of patent applications / Date published |
711221000 | Using table | 11 |
20090037690 | Dynamic Pointer Disambiguation - Dynamic pointer analysis techniques are able to produce faster pointer dependency test code and analyze more complex code in high-level languages such as in the programming languages C and C++ (not excluding other languages), as compared to known techniques. | 02-05-2009 |
20090083514 | APPARATUS AND METHOD FOR BLOCK INTERLEAVING IN MOBILE COMMUNICATION SYSTEM - A method and apparatus for block interleaving that eliminates the step of intermediary buffering. The method includes: (a) calculating a memory address at which first output data, of which number is equal to the number of rows of a first encoder is stored, (b) storing the first output data at the calculated memory address of a circular buffer, (c) storing second output data at an address which is incremented by a specific constant value from the calculated memory address of the circular buffer, and (d) storing (n+1) | 03-26-2009 |
20100037034 | Systems and Methods for Selectively Closing Pages in a Memory - Systems, methods and media for selectively closing pages in a memory in anticipation of a context switch are disclosed. In one embodiment, a table is provided to keep track of open pages for different processes. The table comprises rows corresponding to banks of memory and columns corresponding to cores of a multi-core processing system. When a context switch signal is received, the system unsets a bit in a column corresponding to the core from which the process is to be context-switched out. If no other process is using a page opened by the process the page is closed. | 02-11-2010 |
20100042805 | Method to Perform LUM Masking/Mapping in a SR-IOV Enabled SAS Adapter - A “LUN Table” enables Logical Unit Number (LUN) mapping/masking within an IOV adapter included in a Serial Attached Small Computer System Interface (“SAS” or “Serial Attached SCSI”). A plurality of System Images (“SI”) share block storage through the SAS. The IOV adapter includes one or more Virtual Functions (VF), a Physical Function (PF), and a LUN Table within the PF. The VF allows each SI to communicate I/0 requests with a storage device through the PF. The LUN Table maps the I/0 requests to unique locations within the storage device. Each SI is isolated from all other SIs. Interference between each SI is avoided. A VIOS or a LUN mapping/masking SAN are not required. I/0 latency, processor overhead and storage cost are improved over prior LUN mapping/masking solutions. | 02-18-2010 |
20100115231 | PSEUDO-RANDOM NUMBER GENERATION DEVICE, PSEUDO-RANDOM NUMBER GENERATION PROGRAM, AND MEDIUM CONTAINING PSEUDO-RANDOM NUMBER GENERATION PROGRAM - [Problems] To provide a highly efficient pseudo-random number generation device which can be used in a small-scale computer and a mobile terminal. | 05-06-2010 |
20100228948 | Electronic Device, Time Difference Data Acquisition Method, and Data Structure for Time Difference Data - An electronic device has a reception unit that can receive satellite signals transmitted from positioning information satellites and acquire positioning information and time information, a time difference data storage means in which a data table and a memory address table are stored, and a time difference data acquisition means that acquires time difference data corresponding to positioning information acquired by the reception unit from the time difference data storage means. The data table is compiled by dividing geographical information to which time difference data is assigned into segments of a constant size, setting only one time difference in each segment, grouping the segments into blocks each containing a specific number of segments, and storing the time difference data of each segment as block data by block unit while storing the block data only once for blocks containing the same time difference data array and storing the block data for mutually different time difference data arrays once each. The memory address table stores the memory address where the block data for each block is stored in the data table. The time difference data acquisition means identifies the block corresponding to the positioning information acquired by the reception unit, reads the memory address corresponding to said block from the memory address table, acquires the block data indicated by the memory address in the data table, and acquires the time difference data for the segment corresponding to the positioning information from said block data. | 09-09-2010 |
20100312987 | SYSTEM AND METHOD FOR IMPROVED MEDIA IDENTIFICATION IN A STORAGE DEVICE - Systems and methods are provided for improved identification of removable storage media. A scanner may be used to read an identifier, such as a barcode, on a removable storage media. In the event that the scanner reads the identifier incorrectly due to a defect in the barcode, such as a damaged label, misaligned identifier, or because the scanner is incapable of reading the identifier type or the scanner's field of view is incorrect, a media management component receives the scanned identifier data and matches it to a known set of media identifiers to create a subset of matching identifier data. A closest matching media identifier may be identified from the subset of matching identifier data. An index may be updated with information indicating the closest matching media identifier and a location of the removable storage media. | 12-09-2010 |
20110320764 | LOAD INSTRUCTION FOR COMMUNICATING WITH ADAPTERS - Communication with adapters of a computing environment is facilitated. Instructions are provided that explicitly target the adapters. Information provided in an instruction is used to steer the instruction to an appropriate location within the adapter. | 12-29-2011 |
20130151811 | Optimized Deletion And Insertion For High-Performance Resizable RCU-Protected Hash Tables - Concurrent resizing and modification of a first RCU-protected hash table includes allocating a second RCU-protected hash table, populating it by linking each hash bucket of the second hash table to all hash buckets of the first hash table containing elements that hash to the second hash table bucket, and publishing the second hash table. If the modifying comprises insertion, a new element is inserted at the head of a corresponding bucket in the second hash table. If the modifying comprises deletion, then within an RCU read-side critical section: (1) all pointers in hash buckets of the first and second hash tables that reference the element being deleted are removed or redirected, and (2) the element is freed following a grace period that protects reader references to the deleted element. The first table is freed from memory after awaiting a grace period that protects reader references to the first hash table. | 06-13-2013 |
20150106588 | Computer Processor Employing Hardware-Based Pointer Processing - A computer processor is provided with execution logic that performs operations that utilize pointers stored in memory. In one aspect, each pointer is associated with a predefined number of event bits. The execution logic processes the event bits of a given pointer in conjunction with processing a predefined pointer-related operation involving the given pointer in order to selectively output an event-of-interest signal. | 04-16-2015 |
20150347313 | METHOD AND APPARATUS FOR TABLE AGING IN A NETWORK SWITCH - Embodiments of the present invention relate to a centralized table aging module that efficiently and flexibly utilizes an embedded memory resource, and that enables and facilitates separate network controllers. The centralized table aging module performs aging of tables in parallel using the embedded memory resource. The table aging module performs an age marking process and an age refreshing process. The memory resource includes age mark memory and age mask memory. Age marking is applied to the age mark memory. The age mask memory provides per-entry control granularity regarding the aging of table entries. | 12-03-2015 |