Patent application number | Description | Published |
20090063406 | Method, Service and Search System for Network Resource Address Repair - A method, service and search system for network resource address repair are provided. The method which may be provided as a service over a network, includes: receiving a network resource address that is incorrect; dividing the network resource address into a host address and a path within the host address; searching for the host address, and repairing the host address if an error is found; and, if the host address if found or repaired, searching for the path. A search system is provided which includes a means for activating a network resource address repair if a network resource address is incorrect; and a means for repairing a network resource address. The means for repairing a network resource address includes inputting the host address or the path separately into the query processing means of the search engine. | 03-05-2009 |
20090140854 | METHOD FOR INTRUSION DETECTION VIA CHANGES IN THE PRESENCE OF SHORT RANGE RF DEVICES - A method for monitoring for radio frequency (RF) signals to determine an unexpected presence, activity, or security threat, the method includes: scanning for RF signals; detecting an RF signal; determining at least one of the following: whether the RF signal is jammed, whether the RF signal is assigned to a device that is forbidden, and whether the RF signal is assigned to a device breaking one or more pre-defined rules; sending a potential threat alert in response to the determining; and wherein the one or more pre-defined rules are held in a database. | 06-04-2009 |
20090295534 | Using an RFID Device to Enhance Security by Determining Whether a Person in a Secure Area is Accompanied by an Authorized Person - Embodiments of the invention are generally directed to controlling access to an area or enclosed location, wherein any person in possession of a specified RFID badge or other RFID device is defined to be a person who is authorized to be in the area or location. One embodiment, directed to a method, includes the step of detecting the presence of a particular person in the area, who is not in possession of a specified RFID device. In response to detecting the presence of the particular person, a search is initiated to determine whether any authorized person is present in the area. Upon sensing the presence of one or more authorized persons in the area, the method further determines whether any of the sensed authorized persons is accompanying the particular person. In response to determining that no authorized person is accompanying the particular person, prespecified corrective action is initiated with respect to the particular person. | 12-03-2009 |
20100013678 | METHOD AND APPARATUS FOR DATA DECOMPRESSION IN THE PRESENCE OF MEMORY HIERARCHIES - A method for decompressing a stream of a compressed data packet includes determining whether first data of a data-dictionary for a first decompression copy operation is located in a history buffer on a remote memory or a local memory, and when it is determined that the first data is located in the remote memory, stalling the first decompression copy operation, performing a second decompression operation using second data that is located in the history buffer on the local memory and fetching the first data from the remote memory to the history buffer on the local memory. The method further includes performing the first decompression operation using the first data in the history buffer on the local memory. | 01-21-2010 |
20100253556 | METHOD OF CONSTRUCTING AN APPROXIMATED DYNAMIC HUFFMAN TABLE FOR USE IN DATA COMPRESSION - A novel and useful method of constructing a fast approximation of a dynamic Huffman table from a data sample comprising a subset of data to be compressed. The frequency of incidence of each symbol in the sample is calculated, and the symbols are then allocated to predefined bins based on their frequency of incidence. The bins are then transformed into binary sub-trees, where the leaf nodes of the binary sub-trees comprise the symbols of the bin associated with the binary sub-trees. The binary sub-trees are then combined via nesting, thereby creating a coarse grained binary tree, where all leaves are mapped to a specified number of depths. The coarse grained binary tree is then traversed, thereby yielding a canonical code for each symbol, thereby defining the entries for a dynamic Huffman table. | 10-07-2010 |
20110071990 | Fast History Based Compression in a Pipelined Architecture - A novel and useful system and method of fast history compression in a pipelined architecture with both speculation and low-penalty misprediction recovery. The method of the present invention speculates that a current input byte does not continue an earlier string, but either starts a new string or represents a literal (no match). As previous bytes are checked if they start a string, the method of the present invention detects if speculation for the current byte is correct. If speculation is not correct, then various methods of recovery are employed, depending on the repeating string length. | 03-24-2011 |
20110307890 | UTILIZATION OF SPECIAL PURPOSE ACCELERATORS USING GENERAL PURPOSE PROCESSORS - A novel and useful system and method of improving the utilization of a special purpose accelerator in a system incorporating a general purpose processor. In some embodiments, the current queue status of the special purpose accelerator is periodically monitored using a background monitoring process/thread and the current queue status is stored in a shared memory. A shim redirection layer added a priori to a library function task determines at runtime and in user space whether to execute the library function task on the special purpose accelerator or the general purpose processor. At runtime, using the shim redirection layer and based on the current queue status, it is determined whether to execute the library function task on the special purpose accelerator or on the general purpose processor. | 12-15-2011 |
20120203946 | LIVELOCK PREVENTION MECHANISM IN A RING SHAPED INTERCONNECT UTILIZING ROUND ROBIN SAMPLING - A novel and useful cost effective mechanism for detecting the livelock/starvation of transactions in a ring shaped interconnect that utilizes minimal logic resources. Rather than monitor all transactions concurrently in the ring, the mechanism monitors only a single transaction in the ring. A sampling point is located at a point in the ring which contains a set of N latches. If the monitored transaction is not being starved, it is released and the detection logic moves on the next candidate transaction in round robin fashion. If the monitored transaction passes the sampling point a threshold number of times, it is deemed to be starved and a starvation prevention handling procedure is activated. By traversing the entire ring a single transaction at a time, all starving transactions will eventually be detected with an upper limit on the detection time of O(N | 08-09-2012 |
20130135121 | COMPRESSION ALGORITHM INCORPORATING DYNAMIC SELECTIONOF A PREDEFINED HUFFMAN DICTIONARY - A system and method of selecting a predefined Huffman dictionary from a bank of dictionaries. The dictionary selection mechanism of the present invention effectively breaks the built-in tradeoff between compression ratio and compression rate for both hardware and software compression implementations. A mechanism is provided for automatically creating a predefined Huffman dictionary for a set of input files. The dictionary selection mechanism achieves high compression rate and ratio leveraging predefined Huffman dictionaries and provides a mechanism for dynamically speculating which predefined dictionary to select per input data block, thereby achieving close to a dynamic Huffman ratio at a static Huffman rate. In addition, a feedback loop is used to monitor the ongoing performance of the preset currently selected for use by the hardware accelerator. If the current preset is not optimal it is replaced with an optimal preset. | 05-30-2013 |
20130135122 | COMPRESSION ALGORITHM INCORPORATING A FEEDBACK LOOP FORDYNAMIC SELECTION OF A PREDEFINED HUFFMAN DICTIONARY - A system and method of selecting a predefined Huffman dictionary from a bank of dictionaries. The dictionary selection mechanism of the present invention effectively breaks the built-in tradeoff between compression ratio and compression rate for both hardware and software compression implementations. A mechanism is provided for automatically creating a predefined Huffman dictionary for a set of input files. The dictionary selection mechanism achieves high compression rate and ratio leveraging predefined Huffman dictionaries and provides a mechanism for dynamically speculating which predefined dictionary to select per input data block, thereby achieving close to a dynamic Huffman ratio at a static Huffman rate. In addition, a feedback loop is used to monitor the ongoing performance of the preset currently selected for use by the hardware accelerator. If the current preset is not optimal it is replaced with an optimal preset. | 05-30-2013 |
20130135123 | COMPRESSION ALGORITHM INCORPORATING AUTOMATIC GENERATION OF A BANK OF PREDEFINED HUFFMAN DICTIONARIES - A system and method of selecting a predefined Huffman dictionary from a bank of dictionaries. The dictionary selection mechanism of the present invention effectively breaks the built-in tradeoff between compression ratio and compression rate for both hardware and software compression implementations. A mechanism is provided for automatically creating a predefined Huffman dictionary for a set of input files. The dictionary selection mechanism achieves high compression rate and ratio leveraging predefined Huffman dictionaries and provides a mechanism for dynamically speculating which predefined dictionary to select per input data block, thereby achieving close to a dynamic Huffman ratio at a static Huffman rate. In addition, a feedback loop is used to monitor the ongoing performance of the preset currently selected for use by the hardware accelerator. If the current preset is not optimal it is replaced with an optimal preset. | 05-30-2013 |
20130138922 | REGISTER MANAGEMENT IN AN EXTENDED PROCESSOR ARCHITECTURE - Systems and methods are disclosed for enhancing the throughput of a processor by minimizing the number of transfers of data associated with data transfer between a register file and a memory stack. The register file used by a processor running an application is partitioned into a number of blocks. A subset of the blocks of the register file is defined in an application binary interface enabling the subset to be pre-allocated and exposed to the application binary interface. Optionally, blocks other than the subset are not exposed to the application binary interface so that the data relating to application function switch or a context switch is not transferred between the unexposed blocks and a memory stack. | 05-30-2013 |
20130151818 | MICRO ARCHITECTURE FOR INDIRECT ACCESS TO A REGISTER FILE IN A PROCESSOR - A method and system for improving performance and latency of instruction execution within an execution pipeline in a processor. The method includes finding, while decoding an instruction, a pointer register used by the instruction; reading the pointer register; validating a pointer register entry; reading, if the pointer register entry is valid, a register file entry; validating a register file entry; validating, if the register file entry is invalid, a valid register file entry wherein the valid register file entry is in the register file's future file; bypassing, if the valid register file entry is valid, a valid register file value from the register file's future file to the execution pipeline wherein the valid register file value is in the valid register file entry; and executing the instruction using the valid register file value; wherein at least one of the steps is carried out using a computer device. | 06-13-2013 |
20130159811 | Method of Hybrid Compression Acceleration Utilizing Special and General Purpose Processors - A novel and useful hybrid mechanism whereby hardware acceleration is combined with software such that the compression rate achieved is significantly increased while maintaining the original compression ratio (e.g., using full DHT and not SHT or an approximation). The compression acceleration mechanism is applicable to a hardware accelerator tightly coupled with the general purpose processor. The compression task is divided and parallelized between hardware and software wherein each compression task is split into two acceleration requests: a first request that performs SHT encoding using hardware acceleration and provides post-LZ frequency statistics; and a second request that performs SHT decoding and DHT encoding using the DHT generated in software. | 06-20-2013 |
20130246761 | REGISTER SHARING IN AN EXTENDED PROCESSOR ARCHITECTURE - Systems and methods are disclosed for sharing one or more registers in an extended processor architecture. The method comprises executing a first thread and a second thread on a processor core supported by an extended register file, wherein one or more registers in the extended register file are accessible by said first and second threads; loading first data for use by the first thread into a first set of physical registers mapped to a first set of logical registers associated with the first thread; and providing the first data for use by the second thread by maintaining the first data in the first set of physical registers and mapping set first set of physical registers to a second set of logical registers associated with the second thread. | 09-19-2013 |
20130321180 | METHOD OF ACCELERATING DYNAMIC HUFFMAN DECOMPACTION WITHIN THE INFLATE ALGORITHM - A system and method of accelerating dynamic Huffman decompaction within the inflate algorithm. To improve the performance of a decompression engine during the inflate/decompression process, Huffman trees decompacted a priori are used thus eliminating the requirement of decompacting the DHT for each input stream. The Huffman tree in the input stream is matched prior to decompaction. If a match is found, the stored decompacted Huffman tree is used which reduces the required decompression time. | 12-05-2013 |
20130325800 | FILE MIGRATION IN A NETWORK FILE SYSTEM - A computerized method for managing file migration in one or more storage devices. The method comprises separately categorizing a plurality of segments of a file stored in a pNFS storage according to at least one control data request received from at least one client in real time, receiving a request to migrate the file from at least one source storage location of the pNFS storage to at least one destination storage location of the pNFS storage, separately copying a plurality of different subsets of the file to the at least one destination storage location in a plurality of separate instances where in each the instance a respective the subset selected according to a respective the categorization, and deleting the file from the at least one source storage location. | 12-05-2013 |
20140074899 | METHODS AND SYSTEM FOR EFFICIENT LIFECYCLE MANAGEMENT OF STORAGE CONTROLLER - A computerized method for efficient retirement process of an old controller in a computer network storage system. The method provides for combining legacy non-pNFS data storage with a new temporary parallel NFS data storage. In an embodiment, the method comprises a series of relatively short time consuming operations wherein a storage system efficiently migrates the stored data from the old controller storing legacy data stored solely under pNFS storage, wherein the efficient data migration implements the ability to reclaim layouts (pNFS, stand alone pNFS MDS) and redirect the old data to new controllers. In another embodiment the method comprises a sequence of operations under which a storage system efficiently migrates data from a storage controller that has non-pNFS data storage. In this embodiment the storage utilization during the retirement period combines both legacy non-pNFS storage, as well as new temporary pNFS storage space management. | 03-13-2014 |
20140149663 | STORAGE POOLS MANAGEMENT AND/OR PRESENTATION - A method for presenting a plurality of storage resource pools, comprising: grouping a plurality of quotas of a plurality of storage volumes into at least one of a plurality of storage resource pools according to a plurality of storage volume characteristics technically describing said a plurality of quotas; associating between said plurality of storage volume characteristics and said plurality of storage resource pools; and generating a presentation indicative of said association; and wherein said presentation is presented to a user on a display of an electronic device. | 05-29-2014 |
20140379767 | OUT OF BAND METHODS AND SYSTEM OF ACQUIRING ACCESS DATA IN A PARALLEL ACCESS NETWORK FILE SYSTEM AND METHODS OF USING SUCH ACCESS DATA - A method for gathering access data of a file stored in one or more storage devices of a parallel access network file system. The method comprises monitoring layout requests received from a plurality of clients of the parallel access network file system, each the layout request is for a layout of data segments of one of a plurality of data objects which are stored in a plurality of storage devices of a parallel access network file system, sending to the plurality of clients a plurality of recall requests to recall a plurality of layouts requested by the plurality of layout requests, monitoring a plurality of recurring layout requests for mapping data segments of at least some of the plurality of data objects from at least some of the plurality of clients, and updating access data of the plurality of data objects according to the plurality of recurring layout requests. | 12-25-2014 |