| 32nd week of 2012 patent applcation highlights part 54 |
| Patent application number | Title | Published |
|---|
| 20120203906 | Pre-Access Location-Based Rule Initiation in a Virtual Computing Environment - Methods, systems, and devices are described for updating resource access permissions in a virtual computing environment. In these methods, systems, and devices, a host computer system determines that a user associated with an existing session has moved from a first location to a second location, identifies at least one pre-access rule based on the second location, applies the at least one pre-access rule to the existing session before authenticating the user for access to the existing session in response to the determination that the user has moved to the second location, and authenticates the user at the second location for access to the existing session after the at least one pre-access rule has been applied to the existing session. | 2012-08-09 |
| 20120203907 | CONTENT DISTRIBUTION SYSTEM, CONTENT DISTRIBUTION METHOD, AND CLIENT TERMINAL - The user of any one portable terminal sends a content information request including a user ID to a distribution server. In response, the distribution server distributes a stream data of content that can be used on the user's terminal. If the user of a first portable terminal intends to let a second portable terminal try out a certain content, the user sends to the distribution server the trial permission information including the user's own user ID, a content ID of the content of interest, and a digital signature. The distribution server authenticates the received information before distributing a streaming data of a trial-oriented content with the content ID and user ID attached to it as search keys. This allows the content that can be used on a given user terminal to be tried out on another user terminal without the latter user having recourse to the steps of searching for the content in question. | 2012-08-09 |
| 20120203908 | HYBRID CLOUD INTEGRATOR PLUG-IN COMPONENTS - Integrating data processing resources across a hybrid cloud includes providing a plug-in software component configured to be installed in a software framework. When the plug-in software component is activated, it may generate an interface for a consumer of data processing resources. Using this interface, the consumer of data processing resources may request the use of data processing resources provided as a service on the hybrid cloud. In response, the plug-in software component may acquire the requested data processing resources via interfaces provided by the various data processing resources. A number of different data processing resources may have different interface requirements. However, the first interface generated by the plug-in software component may provide a single vendor neutral interface for accessing data processing resources on the hybrid cloud by the consumer of data processing resources. | 2012-08-09 |
| 20120203909 | Method and System for Forwarding Data Between Netwowrk Devices - A method and system for forwarding data between network devices is provided. A routing device receives, identifies and forwards data to a network device coupled to a private network. The routing device may make a determination of how to forward the data, for example by determining which of several delivery mechanisms to use. The network device may be also associated with a public network via a public network device identifier (PNDI). The PNDI may include a public IP address of the routing device, a public first port number such as a destination port number, and optionally a public second port number such as a source port number, the combination of public IP address and public port number(s) being unique to the network device. | 2012-08-09 |
| 20120203910 | METHOD AND APPARATUS FOR BUFFERING AND OBTAINING RESOURCES, RESOURCE BUFFERING SYSTEM - A method and an apparatus for buffering and obtaining resources as well as a resource buffering system are disclosed. The method includes: obtaining an access popularity value of a resource from a database at intervals of a first preset time, and obtaining load values of cache servers from the database if determining that the access popularity value reaches a preset first threshold; and determining a duplication cache server for duplicating the resource according to the access popularity value and the load values, and notifying the duplication cache server to duplicate the resource from a cache server that stores the resource and buffer the resource. The method overcome the problems in the prior, namely, the same resource is buffered in only one cache server and the relatively idle cache servers are unable to share loads with busy cache servers. The method improves extensibility and working efficiency of the buffering system. | 2012-08-09 |
| 20120203911 | XML-BASED WEB FEED FOR WEB ACCESS OF REMOTE RESOURCES - Techniques for XML (Extensible Markup Language) web feeds for web access of remote resources are described. In one embodiment, a method includes obtaining information regarding one or more available resources from one or more resource hosts, rendering the information regarding one or more available resources into an Extensible Markup Language (XML) document, and providing the XML document to a user device. | 2012-08-09 |
| 20120203912 | Autonomic computing system with model transfer - Methods and systems are provided for autonomic control and optimization of computing systems. A plurality of component models for one or more components in an autonomic computing system are maintained in a system level database. These component models are obtained from a source external to the management server including the components associated with the models. Component models are added or removed from the database or updated as need. A system level management server in communication with the database utilizes the component models maintained in the system level database and generic component models as needed to compute an optimum state of the autonomic computing system. The autonomic computing system is managed in accordance with the computed optimum state. | 2012-08-09 |
| 20120203913 | METHOD AND SYSTEM FOR FEDERATION OF PROXY-BASED AND PROXY-FREE COMMUNICATIONS SYSTEMS - A method and system for federation of proxy-based and proxy-free communications systems is disclosed. In one embodiment, a computer-executable method comprises broadcasting a network address of a federation computer with an identification of the federation computer as a server for domains operating on a proxy-less protocol. The method includes establishing communications with a server on the network according to a proxy-less communications protocol to receive data bound for a destination domain that operates according to a proxy-based communications protocol and to receive data bound for a destination domain that operates according to a proxy-less communications protocol. Further, the method calls for establishing communications with a proxy on the network according to a proxy-based protocol to receive data bound for a destination domain. | 2012-08-09 |
| 20120203914 | NETWORKED MOBILE ROUTER - A mobile router, comprises a communications agent operable such that its initial communication to the network utilizes the main server information to establish a first communication with the main server. The mobile router further comprises a microprocessor operable with the communications agent to interact with the main server to upload configuration information to the main server. The communications agent is operable to receive group server identification information from the main server when communicating with the main server a second time. The microprocessor is operable to store the group server identification information. The group server information comprises information identifying one or more servers corresponding with a predetermined group assigned by the main server. The communications agent utilizes the group server identification information for subsequent communication via the network. | 2012-08-09 |
| 20120203915 | NETWORKED MOBILE ROUTER - A method for operating a wireless mobile router comprises the steps of storing information comprising configuration information and main server information utilizable to identify a main network server; establishing initial communication via a wireless link to a network comprising a main server and a plurality of group servers; directing the initial communication to the main server; uploading the configuration information to the main server via said network; establishing a second communication to the main server; receiving group server identification information from said main server during the second communication; storing the group server identification information comprising information identifying one or more servers corresponding with a predetermined group assigned by the main server; and utilizing the group server identification information for subsequent communication via the network. | 2012-08-09 |
| 20120203916 | APPARATUS AND METHOD OF PEER-TO-PEER COMMUNICATION - An apparatus and method of communication include establishing, by a first communication device, a proximity-based connection with a another communication device, transmitting a first public network address of the first communication device over the proximity-based connection, receiving a second public network address of another communication device over the proximity-based connection, and establishing a communication session over a wide area connection using the first public network address and the second public network address. | 2012-08-09 |
| 20120203917 | METHOD TO LINK DEVICES WITH EACH OTHER VIA A NETWORK - There is provided a method to link a first device ( | 2012-08-09 |
| 20120203918 | LOW POWER WIRELESS NETWORK FOR TRANSPORTATION AND LOGISTICS - Embodiments of methods and devices are disclosed for enabling network devices to join a network. These embodiments generally include a first network device, which is joined to the network, sending authentication information. If the authentication information is determined as valid by a second network device, the second network device sends a join request toward the first network device. During or after the joining process, the first and second network devices can share scheduling information. These embodiments enable a network to have additional security while consuming low amounts of power. | 2012-08-09 |
| 20120203919 | METHOD AND APPARATUS FOR CONTROLLING CONNECTION BETWEEN DEVICES - A method and apparatus for controlling connection between devices includes detecting a first device, determining whether the first device is included in a device list, obtaining information related to the first device from a second device, and establishing a connection with the first device based on the information from the second device. | 2012-08-09 |
| 20120203920 | COMMUNICATION APPARATUS AND METHOD OF CONTROLLING SAME, AND STORAGE MEDIUM - Disclosed are a communication apparatus having a server function for making a storage device, which stores files, accessible over a network, and a method of controlling this apparatus. The apparatus and method set the server function, register an address, which is for transmitting a file to the storage device, in an address book, transfer a file to the storage device in accordance with the address that has been registered in the address book, and changes the address, which has been registered in the address book, in accordance with a change in the setting of the server function. | 2012-08-09 |
| 20120203921 | Hard Disk Drive Integrated Circuit With Integrated Gigabit Ethernet Interface Module - A system including a network interface module, a first processor, a hard disk control module, and a second processor. The network interface module is configured to communicate with a network. The first processor is configured to (i) communicate with the network interface module, and (ii) perform processing related to communication of a hard disk drive with the network via the network interface module. The hard disk control module is configured to (i) communicate with the first processor, and (ii) control operation of the hard disk drive. The second processor is configured to (i) communicate with the hard disk control module, and (ii) perform processing related to storing data on the hard disk drive. The second processor and the hard disk control module are configured processes packets communicated via the network interface module using a hyper-text transfer protocol, a peer-to-peer sharing protocol, and an Internet protocol-based small computer system interface standard. | 2012-08-09 |
| 20120203922 | LINKED-LIST HYBRID PEER-TO-PEER SYSTEM AND METHOD FOR OPTIMIZING THROUGHPUT SPEED AND PREVENTING DATA STARVATION - A system and method is described for formulating a linked-list hybrid peer-to-peer sub-network that analyzes capabilities of plurality of nodes, and creating at least two linked-list hybrid peer-to-peer sub-networks by forming a first group of nodes of the plurality of nodes having similar capabilities and establishing serial connections between nodes of the first group of nodes to form a first linked-list hybrid peer-to-peer sub-network. | 2012-08-09 |
| 20120203923 | ADAPTIVE VARIABLE FIDELITY MEDIA DISTRIBUTION SYSTEM AND METHOD - An adaptive variable fidelity media provision system and method are provided herein. | 2012-08-09 |
| 20120203924 | GENERATING LOW RESOLUTION USER INTERFACES FOR TRANSMISSION TO MOBILE DEVICES - A computer-implemented method includes generating a user interface for displaying one or more images, receiving a request from a remote device to view the user interface, determining whether the remote device is a mobile device communicating over a wireless network, depending on a result of the determination, generating a low resolution version of the user interface that is computationally less intensive to render compared to the previously generated user interface, and transmitting the low resolution version of the user interface to the requesting device. | 2012-08-09 |
| 20120203925 | METHOD AND APPARATUS FOR PROVIDING MEDIA MIXING WITH REDUCED UPLOADING - A method for providing media mixing with reduced uploading may include receiving device situation description data and content analysis data from each of a plurality of devices. The device situation description data and content analysis data received from each of the plurality of devices may be descriptive of media data associated with a common event and recorded separately at respective ones of the plurality of devices. The method may further include determining media segments defining one or more portions of the media data to be requested from selected ones of the plurality of devices based on the device situation description data and content analysis data, causing communication of a request for corresponding ones of the media segments to respective devices among the selected ones of the plurality of devices, and causing generation of mixed content based on receipt of the media segments. A corresponding apparatus and user terminal-side method and apparatus are also provided. | 2012-08-09 |
| 20120203926 | IP Network Service Redirector Device and Method - A method for redirecting specific network traffic intended for a target device on a first data network is described. The method inserts a redirector into a first network in front of a target device and intercepting a transmission from the target device. The method then configures the network characteristics of the redirector to use the network addresses of the target device. Once configured the redirector inspects the network traffic on the first network to identify specific services, and sends the network traffic associated with the specific service to a destination device on a second network. | 2012-08-09 |
| 20120203927 | SYMBOLIC-LINK IDENTIFYING - Methods for identifying symbolic links in network file systems are provided herein. An absolute path may be determined at a network file server. This may include determining a complete client path from an initial client path and combining the complete client path with a server export path. Once the absolute path is determined, it may be traversed using a file descriptor of each file in the absolute path to identify a symbolic link. | 2012-08-09 |
| 20120203928 | LOW LATENCY COMMUNICATION VIA MEMORY WINDOWS - A high performance computer system has compute nodes interconnected by an inter-node communication network. The compute nodes include local packetized interconnects. Shared memory between compute nodes is emulated by tunneling packetized interconnect packets between the compute nodes. A memory region on one of the compute nodes is used as a window into a memory region in another compute node. Special registers may be provided to expedite remote operations on small amounts of data. | 2012-08-09 |
| 20120203929 | VISUAL PREVIEW OF SHORTENED URL - One example embodiment includes a system for previewing a shortened URL. The system includes a preview coordinator. The preview coordinator is configured to resolve a shortened URL, where resolving the shortened URL includes determining a standard URL which is linked to by the shortened URL. The preview coordinator is also configured to generate a preview of the standard URL, where generating a preview of the standard URL includes creating an image of the location referenced by the standard URL. The preview coordinator is further configured to display the preview of the standard URL to a user. | 2012-08-09 |
| 20120203930 | NAME-BASED CUSTOMIZATION OF EXECUTABLES FROM WEB - The customized execution of an executable accessed from a web server. Upon receiving a request for the executable, the web server determines a customization to be applied to the executable. For instance, arguments may be parsed from the Uniform Resource Locator (URL) of the request. The web server then sends a copy of the executable to the client, and provides customization argument(s) in the name of the executable. Thus, the name of the executable may differ, depending on the customization to be applied, although the executable binary itself may be the same. The client receives the executable copy, and interprets its name to determine the customization to be applied. For instance, the client may extract the argument(s) from the name of the executable, and provide those argument(s) to the executable when executed. | 2012-08-09 |
| 20120203931 | Method and system for transmitting compressed rights - The disclosure discloses a method for transmitting compressed rights. The method includes that: a terminal negotiates a compress algorithm with a server; the terminal requests the server through an “Extensions” field in a rights object request message to transmit the rights in compression format; the server generates a rights object response message according to a standard approach, compresses the rights in the rights object response message according to the negotiated compress algorithm, and generates a compressed rights object response message and sends the compressed rights object response message to the terminal; the terminal receives the compressed rights object response message, decompresses the rights in the received rights object response message according to the negotiated compress algorithm, and generates a decompressed rights object response message. The disclosure also discloses a system for transmitting compressed rights through which the volume of data in the Rights Object Acquisition Protocol (ROAP) communication can be reduced and the reliability of digital rights object transmission and user experience are improved. | 2012-08-09 |
| 20120203932 | MULTI-MASTER MEDIA METADATA SYNCHRONIZATION - Various embodiments related to the ability to expose content for synchronization and consumption across all endpoint computing devices in a computing system are disclosed. For example, one disclosed embodiment provides a method for communicating between authenticated clients of a cloud-based computing system, including sending a read request for metadata of each of a plurality of endpoint computing devices and content stored on each of the plurality of endpoint computing devices that is aggregated in a data store, receiving the requested metadata. The method further includes performing a content consumption operation that changes a state of the requested metadata. The method further includes sending updated metadata generated based on the content consumption operation to synchronize aggregated metadata in the data store, and deleting local metadata. | 2012-08-09 |
| 20120203933 | Clock Signal Synchronization Among Computers In A Network - Methods, apparatus, and computer program products are disclosed for clock signal synchronization among computers in a network, including designating, as a primary clock signal for all the computers in a network, a clock signal from one of the computers in the network; providing the primary clock signal, simultaneously and in parallel, from the computer whose clock signal is designated as the primary clock signal to all the other computers in the network; and providing the primary clock signal, simultaneously and in parallel, from each computer in the network to all computers in the network through multiplexers and phase locked loops, with the primary clock signal locked in phase across all the computers by a phase locked loop on each computer. | 2012-08-09 |
| 20120203934 | DETERMINATION OF ONE OR MORE PARTITIONABLE ENDPOINTS AFFECTED BY AN I/O MESSAGE - A data processing system includes a processor core, a system memory including a first data structure including a plurality of entries mapping requester identifiers (IDs) to partitionable endpoint (PE) numbers, and an input/output (I/O) subsystem including a plurality of PEs each having an associated PE number, where each of the plurality of PEs including one or more requesters each having a respective requester ID. An I/O host bridge, responsive to receiving an I/O message including a requester ID and an address, determines a PE number by reference to a first entry from the first data structure, and responsive to determining the PE number, accesses a second entry of the second data structure utilizing the PE number as an index and validates the address by reference to the accessed entry in the second data structure. The I/O host bridge, responsive to successful validation, provides a service indicated by the I/O message. | 2012-08-09 |
| 20120203935 | SELF-ADJUSTING SCSI STORAGE PORT QUEUE - A method for managing storage space in a storage port queue includes establishing a watermark for the storage port queue. The method further receives, at the storage port associated with the storage port queue, a command having an initiator-target-LUN (ITL) nexus associated therewith. Upon receiving the command, the method determines whether the used space in the storage port queue has reached the watermark. In the event the used space has not reached the watermark, the method processes the command. In the event the used space has reached the watermark and a specified number of commands for the ITL nexus are already present in the storage port queue, the method rejects the command. Otherwise, the method may process the command. | 2012-08-09 |
| 20120203936 | DIRECT PERIPHERAL INTERCONNECT - A direct peripheral interconnect (DPI) device and a method for providing a direct interconnect between peripherals are disclosed. The DPI device includes a selector configured to receive producer signals output by peripherals and control signals output by a control unit. The selector is configured to select and output one or more producer signals as an operable signal based on the received control signals. The DPI device also includes an operator having functions stored therein. The operator is configured to receive the operable signal and the control signals, and perform one or more of the functions on the operable signal based on the received control signals. The operator is configured to output a consumer signal corresponding to the operable signal, as well as a status signal providing update information to the main control unit. | 2012-08-09 |
| 20120203937 | Transfer of Uncompressed Multimedia Contents or Data Communications - A system and corresponding method for transferring data via an interface assembly. The data may be transferred between a USB port of a first device and a media port of a second device. Uncompressed high definition media data may be received from the USB port. The received uncompressed high definition media data may be supplied to a media connector in accordance with a first media standard, such that the supplied data can be transmitted in accordance with the first media standard via the media connector to the media port of the second device. The uncompressed high definition media data may include multimedia data and side-band communication data. A single signal may be encoded and decoded in accordance with a protocol that enables the single signal to communicate all side-band communication to and from the source device via a single pin of a USB connector. | 2012-08-09 |
| 20120203938 | INFORMATION PROCESSING APPARATUS, AND METHOD FOR CONTROLLING THE SAME - An information processing apparatus includes an interface unit, a detection unit, an unmount unit, a display unit, and a control unit. The interface unit connects a reader/writer device, which is capable of receiving a memory storage medium. The detection unit detects a connection and a disconnection between the interface unit and the reader/writer device. The unmount unit sets the memory storage medium to an unmounted state. The a display unit display information about a detection result by the detection unit. The control unit controls, in response to the detection unit detecting that the reader/writer device is temporary disconnected from the interface unit, the display unit not to display information about the temporary disconnection of the reader/writer device from the interface unit. | 2012-08-09 |
| 20120203939 | INJECTION OF I/O MESSAGES - A data processing system includes a processor core, a system memory coupled to the processor core, an input/output adapter (IOA), and an input/output (I/O) host bridge coupled to the processor core and to the IOA. The I/O host bridge includes a register coupled to receive I/O messages from the processor core, a buffer coupled to receive I/O messages from the IOA, and logic coupled to the register and to the buffer that services I/O messages received from the register and from the buffer. | 2012-08-09 |
| 20120203940 | INFORMATION PROCESSING APPARATUS AND COMPUTER PROGRAM PRODUCT - An information processing apparatus includes a core unit configured to control an external device that is communicatively connected to the information processing apparatus; and a calling unit that is included in the core unit and is configured to call a plug-in that enables the external device to implement a predetermined function when controlling the external device. The plug-in, when called by the calling unit at a specific timing, interrupts a process related to the control of the external device performed by the core unit with a process related to the predetermined function provided by the plug-in. | 2012-08-09 |
| 20120203941 | SERIAL COMMUNICATION DEVICE AND SERIAL COMMUNICATION METHOD - A serial communication device has: a MAC (Media Access Control), a mask circuit and a buffer. The MAC conforms to Serial Media Independent Interface specification and outputs an identical segment data for plural times within a unit period. The mask circuit is configured to mask a predetermined segment data out of the plurality of identical segment data and to output the other segment data out of the plurality of identical segment data. The buffer is configured to receive the segment data output from the mask circuit and to output the received segment data to a physical layer device in synchronization with a clock signal. | 2012-08-09 |
| 20120203942 | DATA PROCESSING APPARATUS - A data processing apparatus may include a data acquisition unit, a buffer unit that includes a plurality of division buffers, a valid data area determination unit that calculates an area of valid data, a buffer state management unit that manages whether or not the data is stored in the division buffer, a data write control unit that writes data of a unit of the storage capacity of the division buffer, which at least includes data indicated to be valid data by the valid data information within the data, to the division buffer in which no data is stored, the division buffer being selected based on the management information, and a data read control unit that reads data indicated to be valid data by the valid data information from the division buffer in which data is stored, the division buffer being selected based on the management information. | 2012-08-09 |
| 20120203943 | RADIO COMMUNICATION DEVICE AND METHOD FOR CONTROLLING RF-BB STATE IN THE SAME - A radio communication device enabling a serial interface to restart transmission in a short time when interface setting is changed, as well as a method for controlling RF-BB state in the device, are provided. According to the radio communication device in which a radio frequency section (20) and a baseband section (10) are connected through a serial interface, exclusive signals (Act, Act_Ack) for triggering an interface state change and for acknowledging it are provided between the radio frequency section and the baseband section, respectively. Interface state change control is performed by transmitting and receiving the interface state change trigger exclusive signal and its acknowledgement exclusive signal between the radio frequency section and the baseband section. | 2012-08-09 |
| 20120203944 | Systems and Methods for Providing Access to Financial Trading Services - A system and method to allow service consumers to access financial services deployed using various integration technologies with optimal latency through a technique of data-driven bus arbitration and the use of on-demand delivered bus integration plug-in components. | 2012-08-09 |
| 20120203945 | SYSTEM AND METHOD FOR INITIALIZING A MEMORY SYSTEM, AND MEMORY DEVICE AND PROCESSOR-BASED SYSTEM USING SAME - Systems, controllers, and methods are disclosed, such as an initialization system including a controller configured to receive patterns of read data coupled from a memory device through a plurality of read data lanes. The controller is operable to detect lane-to-lane skew in the patterns of read data. The controller then adjusts the manner in which the read data received through the read data lanes during normal operation are divided into frames. The controller can also couple patterns of command/address bits to the memory device through a plurality of command/address lanes. The memory device can send the received command/address bits back to the controller through the read data lanes. The controller is operable to detect any lane-to-lane skew in the patterns of command/address bits received through the read data lanes to adjust the manner in which the command/address bits coupled through the command/address lanes during normal operation are divided into frames. | 2012-08-09 |
| 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 | 2012-08-09 |
| 20120203947 | ON-DEMAND INTERRUPT VECTOR ALLOCATION BASED ON ACTIVITY DETECTION - A method and system for dynamically allocating interrupt vectors on demand. A computer system measures a rate of activities associated with an event. Based on the rate of activities, the computer system determines whether to allocate a dedicated interrupt vector to the event. The rate of activities can be an interrupt request (IRQ) rate. | 2012-08-09 |
| 20120203948 | FLASHCARD READER AND CONVERTER FOR READING SERIAL AND PARALLEL FLASHCARDS - A flash memory card reader and a single converter chip for reading both serial and parallel flash cards. The read has connectors for both serial and parallel data transfer flash memory cards. The reader has a single chip converter. The converter supports both serial I/O and parallel I/O. The serial I/O transfers data in multiple modes. Both single-bit and multi-bit serial data transfers modes are supported. The reader may have multiple slots, one have a connector for serial and one having a connector for parallel flash memory cards. | 2012-08-09 |
| 20120203949 | PORTABLE ELECTRONIC DEVICE DOCKING STATION - A universal docking station for portable electronic devices is disclosed. In some embodiments, the docking station may utilize a universal interface to communicatively couple a portable electronic device to one or more inputs, displays, and/or accessory devices. In some embodiments, the universal interface may be a high-speed and/or super-speed universal data interface. In further embodiments, the universal docking station may be configured to provide electrical power to a portable electronic device. By utilizing a universal data interface, the universal docking station may be utilized with any portable electronic device having the universal data interface regardless of the manufacturer of the portable electronic devices. | 2012-08-09 |
| 20120203950 | ADDRESS TRANSLATION CACHING AND I/O CACHE PERFORMANCE IMPROVEMENT IN VIRTUALIZED ENVIRONMENTS - Methods and apparatus relating to improving address translation caching and/or input/output (I/O) cache performance in virtualized environments are described. In one embodiment, a hint provided by an endpoint device may be utilized to update information stored in an I/O cache. Such information may be utilized for implementation of a more efficient replacement policy in an embodiment. Other embodiments are also disclosed. | 2012-08-09 |
| 20120203951 | APPARATUS, SYSTEM, AND METHOD FOR DETERMINING A CONFIGURATION PARAMETER FOR SOLID-STATE STORAGE MEDIA - An apparatus, system, and method are disclosed to improve the utility of solid-state storage media by determining one or more configuration parameters for the solid-state storage media. A media characteristic module references one or more storage media characteristics for a set of storage cells of solid-state storage media. A configuration parameter module determines a configuration parameter for the set of storage cells based on the one or more storage media characteristics. A storage cell configuration module configures the set of storage cells to use the determined configuration parameter. | 2012-08-09 |
| 20120203952 | PROTECTING GROUPS OF MEMORY CELLS IN A MEMORY DEVICE - Methods for memory block protection and memory devices are disclosed. One such method for memory block protection includes programming protection data to protection bytes diagonally across different word lines of a particular memory block (e.g., Boot ROM). The protection data can be retrieved by an erase verify operation that can be performed at power-up of the memory device. | 2012-08-09 |
| 20120203953 | CONCURRENTLY SEARCHING MULTIPLE DEVICES OF A NON-VOLATILE SEMICONDUCTOR MEMORY - A non-volatile semiconductor memory is disclosed comprising N memory devices each comprising a plurality of blocks, wherein each block comprises a plurality of memory segments accessed through an address. A searched is performed by issuing a read command for each of the N memory devices, wherein an address of each read command is separated by a distance determined in response to the search range of addresses and N, and the search range of addresses is greater than N. Data read from at least one of the memory devices is evaluated to determine whether the search has finished. | 2012-08-09 |
| 20120203954 | DATA STORAGE DEVICE - A data storage device comprises a multichannel flash memory assembly which is constructed by stacking of flash memory members. The data storage device is compact due to the use of stacked flash memory members which provides high speed performance due to its multiple data channel arrangement. A specific example is the use of a flash memory assembly comprising 4 stacked flash memory dies with 4 parallel data channels. This invention is advantageous because it provides a data storage device having a high data storage capability at high data transfer rates while maintaining a compact construction due to the high-rise stacked architecture. | 2012-08-09 |
| 20120203955 | DATA PROCESSING DEVICE AND SYSTEM INCLUDING THE SAME - A data processing system includes a host and a data processing device configured to store data output from the host. The data processing device includes a compressor configured to compress the data and sort compressed data according to a size of the compressed data and a buffer block configured to store the compressed data that has been sorted. | 2012-08-09 |
| 20120203956 | RECORDING DEVICE, CONTROL METHOD FOR RECORDING DEVICE, AND RECORDING MEDIUM - A recording device with nonvolatile memory suppresses the number of times the nonvolatile memory is written, avoiding memory failure and increasing printer | 2012-08-09 |
| 20120203957 | SOLID STATE MEMORY-BASED MASS STORAGE DEVICE USING OPTICAL INPUT/OUTPUT LINKS - A solid state memory-based mass storage device and a method of transferring data between a memory controller and at least one memory device of the mass storage device through optical input/output links that transmit multiplexed optical data signals between the memory device and controller. | 2012-08-09 |
| 20120203958 | STORAGE CONTROL SYSTEM WITH CHANGE LOGGING MECHANISM AND METHOD OF OPERATION THEREOF - A method of operation of a storage control system including: providing a memory controller; accessing a volatile memory table by the memory controller; writing a non-volatile semiconductor memory for persisting changes in the volatile memory table; and restoring a logical-to-physical table in the volatile memory table, after a power cycle, by restoring a random access memory with a logical-to-physical partition from a most recently used list. | 2012-08-09 |
| 20120203959 | NON-VOLATILE MEMORY, SYSTEM INCLUDING THE SAME, AND METHOD OF PROGRAMMING THE SAME - A method of programming a non-volatile memory that includes dumping first page data loaded to a cache latch to a first data latch and backing up the first page data to a second data latch. | 2012-08-09 |
| 20120203960 | APPARATUS AND METHOD FOR MULTI-LEVEL CACHE UTILIZATION - In some embodiments, a non-volatile cache memory may include a multi-level non-volatile cache memory configured to be located between a system memory and a mass storage device of an electronic system and a controller coupled to the multi-level non-volatile cache memory, wherein the controller is configured to control utilization of the multi-level non-volatile cache memory. Other embodiments are disclosed and claimed. | 2012-08-09 |
| 20120203961 | HIGH SPEED INTERFACE FOR DYNAMIC RANDOM ACCESS MEMORY (DRAM) - An interface for a dynamic random access memory (DRAM) includes an interface element coupled to a DRAM chip using a first attachment structure, a first portion of the first attachment structure being used to form a wide bandwidth, low speed, parallel interface, a second portion of the first attachment structure, a routing element and a through silicon via (TSV) associated with the DRAM chip being used to form a narrow bandwidth, high speed, serial interface, the interface element configured to convert parallel information to serial information and configured to convert serial information to parallel information. | 2012-08-09 |
| 20120203962 | MEMORY CONTROLLER AND DATA SAVING CONTROL METHOD OF THE SAME - A memory controller that controls data transfer between a volatile memory and a non-volatile memory, wherein data being held in a plurality of volatile memories each having a refresh operation mode and a self-refresh operation mode is transferred to the non-volatile memory. When readout of data from at least one volatile memory has been finished, the volatile memory is shifted from the refresh operation mode to the self-refresh operation mode. Then, control is performed so as to return the volatile memory from the self-refresh operation mode depending on the progress of writing of data to the non-volatile memory. | 2012-08-09 |
| 20120203963 | COMPUTER SYSTEM HAVING AN EXPANSION DEVICE FOR VIRTUALIZING A MIGRATION SOURCE - A migration destination storage creates an expansion device for virtualizing a migration source logical unit. A host computer accesses an external volume by way of an access path of a migration destination logical unit, a migration destination storage, a migration source storage, and an external volume. After destaging all dirty data accumulated in the disk cache of the migration source storage to the external volume, an expansion device for virtualizing the external volume is mapped to the migration destination logical unit. | 2012-08-09 |
| 20120203964 | SELECTING A VIRTUAL TAPE SERVER IN A STORAGE SYSTEM TO PROVIDE DATA COPY WHILE MINIMIZING SYSTEM JOB LOAD - In a storage system including plural source storage devices, a target storage device selects which source storage device to accept a copy request from the target storage device so as to minimize the load on the entire system. The system calculates first and second load values for job loads being processed. System load values for the system are derived from job load value of a specific data, and respective load values for first and second source storage devices. The system compares the system load values to select a storage device to provide the data copy so as to minimize the load on the entire system. | 2012-08-09 |
| 20120203965 | METHOD AND SYSTEM OF COLLECTION PERFORMANCE DATA FOR STORAGE NETWORK - This invention provides a user or an operator with a management apparatus or method for displaying logical connection information between an interface connected to a computer and a switch and a storage system or a logical unit in the storage system in a virtual storage system, wherein the switch receives a first access request from said computer, converts said first access request to a second access request to one of said plural storage systems, and sends said second access request to one of said plural storage systems or one logical unit. | 2012-08-09 |
| 20120203966 | STORAGE SYSTEM COMPRISING POWER SAVING FUNCTION - A storage system constituted such that power saving to an administrator-desired storage device can be performed from a management device. That is, the storage system comprises a power-saving indication receiving section for receiving from a management console a power-saving indication specifying at least one storage device of a plurality of RAID groups, a plurality of logical units, and a plurality of physical storage devices; and a power-saving controller for saving on power to one or more physical storage devices corresponding to the storage device specified in this power-saving indication. | 2012-08-09 |
| 20120203967 | REDUCING INTERPROCESSOR COMMUNICATIONS PURSUANT TO UPDATING OF A STORAGE KEY - Processing within a multiprocessor computer system is facilitated by: deciding by a processor, pursuant to processing of a request to update a previous storage key to a new storage key, whether to purge the previous storage key from, or update the previous storage key in, local processor cache of the multiprocessor computer system. The deciding includes comparing a bit value(s) of one or more required components of the previous storage key to respective predefined allowed stale value(s) for the required component(s), and leaving the previous storage key in local processor cache if the bit value(s) of the required component(s) in the previous storage key equals the respective predefined allowed stale value(s) for the required component(s). By selectively leaving the previous storage key in local processor cache, interprocessor communication pursuant to processing of the request to update the previous storage key to the new storage key is minimized. | 2012-08-09 |
| 20120203968 | COORDINATED WRITEBACK OF DIRTY CACHELINES - A data processing system includes a processor core and a cache memory hierarchy coupled to the processor core. The cache memory hierarchy includes at least one upper level cache and a lowest level cache. A memory controller is coupled to the lowest level cache and to a system memory and includes a physical write queue from which the memory controller writes data to the system memory. The memory controller initiates accesses to the lowest level cache to place into the physical write queue selected cachelines having spatial locality with data present in the physical write queue. | 2012-08-09 |
| 20120203969 | MEMORY BUS WRITE PRIORITIZATION - A data processing system includes a multi-level cache hierarchy including a lowest level cache, a processor core coupled to the multi-level cache hierarchy, and a memory controller coupled to the lowest level cache and to a memory bus of a system memory. The memory controller includes a physical read queue that buffers data read from the system memory via the memory bus and a physical write queue that buffers data to be written to the system memory via the memory bus. The memory controller grants priority to write operations over read operations on the memory bus based upon a number of dirty cachelines in the lowest level cache memory. | 2012-08-09 |
| 20120203970 | SOFTWARE AND HARDWARE MANAGED DUAL RULE BANK CACHE FOR USE IN A PATTERN MATCHING ACCELERATOR - A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results. | 2012-08-09 |
| 20120203971 | Network On Chip With Caching Restrictions For Pages Of Computer Memory - A network on chip (‘NOC’) that includes integrated processor (‘IP’) blocks, routers, memory communications controllers, and network interface controllers, each IP block adapted to a router through a memory communications controller and a network interface controller, a multiplicity of computer processors, each computer processor implementing a plurality of hardware threads of execution; and computer memory, the computer memory organized in pages and operatively coupled to one or more of the computer processors, the computer memory including a set associative cache, the cache comprising cache ways organized in sets, the cache being shared among the hardware threads of execution, each page of computer memory restricted for caching by one replacement vector of a class of replacement vectors to particular ways of the cache, each page of memory further restricted for caching by one or more bits of a replacement vector classification to particular sets of ways of the cache. | 2012-08-09 |
| 20120203972 | MEMORY MANAGEMENT FOR OBJECT ORIENTED APPLICATIONS DURING RUNTIME - Memory management for object oriented applications during run time includes loading an object oriented application into a computer memory. The object oriented application includes a plurality of nodes in a classification tree, the nodes including key value pairs. The nodes are aggregated in the classification tree by a computer. The aggregating includes eliminating redundant keys and creating a composite node. The composite node is loaded into the computer memory. The plurality of nodes in the classification tree are removed from the computer memory in response to loading the composite node into the computer memory. | 2012-08-09 |
| 20120203973 | SELECTIVE CACHE-TO-CACHE LATERAL CASTOUTS - A data processing system includes first and second processing units and a system memory. The first processing unit has first upper and first lower level caches, and the second processing unit has second upper and lower level caches. In response to a data request, a victim cache line to be castout from the first lower level cache is selected, and the first lower level cache selects between performing a lateral castout (LCO) of the victim cache line to the second lower level cache and a castout of the victim cache line to the system memory based upon a confidence indicator associated with the victim cache line. In response to selecting an LCO, the first processing unit issues an LCO command on the interconnect fabric and removes the victim cache line from the first lower level cache, and the second lower level cache holds the victim cache line. | 2012-08-09 |
| 20120203974 | AUTOMATIC DETERMINATION OF READ-AHEAD AMOUNT - Read-ahead of data blocks in a storage system is performed based on a policy. The policy is stochastically selected from a plurality of policies in respect to probabilities. The probabilities are calculated based on past performances, also referred to as rewards. Policies which induce better performance may be given precedence over other policies. However, the other policies may be also utilized to reevaluate them. A balance between exploration of different policies and exploitation of previously discovered good policies may be achieved. | 2012-08-09 |
| 20120203975 | AUTOMATIC DETERMINATION OF READ-AHEAD AMOUNT - Read-ahead of data blocks in a storage system is performed based on a policy. The policy is stochastically selected from a plurality of policies in respect to probabilities. The probabilities are calculated based on past performances, also referred to as rewards. Policies which induce better performance may be given precedence over other policies. However, the other policies may be also utilized to reevaluate them. A balance between exploration of different policies and exploitation of previously discovered good policies may be achieved. | 2012-08-09 |
| 20120203976 | MEMORY COHERENCE DIRECTORY SUPPORTING REMOTELY SOURCED REQUESTS OF NODAL SCOPE - A data processing system includes at least a first through third processing nodes coupled by an interconnect fabric. The first processing node includes a master, a plurality of snoopers capable of participating in interconnect operations, and a node interface that receives a request of the master and transmits the request of the master to the second processing unit with a nodal scope of transmission limited to the second processing node. The second processing node includes a node interface having a directory. The node interface of the second processing node permits the request to proceed with the nodal scope of transmission if the directory does not indicate that a target memory block of the request is cached other than in the second processing node and prevents the request from succeeding if the directory indicates that the target memory block of the request is cached other than in the second processing node. | 2012-08-09 |
| 20120203977 | Page Mode Access by Non-page Mode Device - A method is provided for accessing a memory device having pages by a memory interface that does not directly support page accesses. A first memory space of the memory interface is configured with a first set of timing parameters and a second memory space of the memory interface is configured with a second set of timing parameters. A page mode access is initiated to a page of the memory device using the first memory space of the memory interface for at least a first data transfer and continued using the second memory space of the memory interface for a plurality of data transfers. | 2012-08-09 |
| 20120203978 | COMPUTER SYSTEM AND ITS CONTROL METHOD - A computer system and its control method capable of allocating resources to a plurality of users in a balanced manner and ensuring information security between the users even when the plurality of users are made to extensively manage a storage system are provided. | 2012-08-09 |
| 20120203979 | Architecture Support for Debugging Multithreaded Code - Mechanisms are provided for debugging application code using a content addressable memory. The mechanisms receive an instruction in a hardware unit of a processor of the data processing system, the instruction having a target memory address that the instruction is attempting to access. A content addressable memory (CAM) associated with the hardware unit is searched for an entry in the CAM corresponding to the target memory address. In response to an entry in the CAM corresponding to the target memory address being found, a determination is made as to whether information in the entry identifies the instruction as an instruction of interest. In response to the entry identifying the instruction as an instruction of interest, an exception is generated and sent to one of an exception handler or a debugger application. In this way, debugging of multithreaded applications may be performed in an efficient manner. | 2012-08-09 |
| 20120203980 | APPARATUS, SYSTEM, AND METHOD FOR VALIDATING THAT A CORRECT DATA SEGMENT IS READ FROM A DATA STORAGE DEVICE - An apparatus, system, and method are disclosed for validating that correct data is read from a storage device. A read request receiver module receives a read storage request to read a data segment of a file or object stored on a data storage device. The storage request includes one or more source parameters for the data segment. The source parameters include one or more virtual addresses that identify the data segment. A hash generation module generates one or more hash values from the virtual addresses. A read data module reads the requested data segment and returns one or more data packets and corresponding stored hash values stored with the data packets. The stored hash values were generated from a data segment written to the data storage device that contains data of the data packets. A hash check module verifies that the generated hash values match the respective stored hash values. | 2012-08-09 |
| 20120203981 | Method and apparatus for executing software applications - Consumer electronic devices, such as e.g. high-definition movie players for removable storage media such as optical discs, may provide possibilities for advanced interactivity for the user, implemented as software applications. A question arising generally with such software applications is what the life cycle of such an application is, and who may control it. The invention provides a method for executing software applications within a playback device for audio-video data, wherein data from a first removable storage medium are read for a software application to be executed within said playback device, and the data comprise an indication defining a termination condition for the application. Based on said termination code and depending on how the medium holding the application is ejected, the application is terminated or may survive. | 2012-08-09 |
| 20120203982 | FIFO BUFFER AND METHOD OF CONTROLLING FIFO BUFFER - A first-in first-out buffer includes: a memory set capable of writing and reading data within one cycle by combining a plurality of memories, each memory performing any one of writing and reading of data within one cycle; an output unit that outputs a first signal indicating a memory included in the memory set, the memory being capable of writing data; a writing control unit that performs writing control of data to be written to the memory indicated by the first signal when the data to be written is inputted; and a first holding unit that, in accordance with an instruction from the writing control unit, holds the first signal that is outputted from the output unit and indicates the memory in which head data of the data to be written is written. | 2012-08-09 |
| 20120203983 | COMPRESSION ON THIN PROVISIONED VOLUMES USING EXTENT BASED MAPPING - A set of logical extents, each having compressed logical tracks of data, is mapped to a head physical extent and, if the head physical extent is determined to have been filled, to at least one overflow extent having spatial proximity to the head physical extent. Pursuant to at least one subsequent write operation and destage operation, the at least one subsequent write operation and destage operation determined to be associated with the head physical extent, the write operation is mapped to one of the head physical extent, the at least one overflow extent, and an additional extent having spatial proximity to the at least one overflow extent. | 2012-08-09 |
| 20120203984 | PAGE INVALIDATION PROCESSING WITH SETTING OF STORAGE KEY TO PREDEFINED VALUE - A method is provided for facilitating processing within a multiprocessor computer system by: setting, in association with invalidate page table entry processing, a storage key at a matching location in central storage of a multiprocessor computer system to a predefined value; and subsequently executing a request to update the storage key to a new storage key, the subsequently executing including determining whether the predefined value is an allowed stale value, and if so, replacing in central storage the storage key of predefined value with the new storage key without requiring purging or updating of the storage key in any local processor cache of the multiprocessor computer system, thus minimizing interprocessor communication pursuant to processing of the request to update the storage key to the new storage key. | 2012-08-09 |
| 20120203985 | Data Structure For Tiling And Packetizing A Sparse Matrix - A computer system retrieves a slice of sparse matrix data, which includes multiple rows that each includes multiple elements. The computer system identifies one or more non-zero values stored in one or more of the rows. Each identified non-zero value corresponds to a different row, and also corresponds to an element location within the corresponding row. In turn, the computer system stores each of the identified non-zero values and corresponding element locations within a packet at predefined fields corresponding to the different rows. | 2012-08-09 |
| 20120203986 | APPARATUS, SYSTEM, AND METHOD FOR MANAGING OPERATIONS FOR DATA STORAGE MEDIA - An apparatus, system, and method are disclosed for managing operations for data storage media. An adjustment module interrupts or otherwise adjusts execution of an executing operation on the data storage media. A schedule module executes a pending operation on the data storage media in response to adjusting execution of the executing operation. The pending operation comprises a higher execution priority than the executing operation. The schedule module finishes execution of the executing operation in response to completing execution of the pending operation. | 2012-08-09 |
| 20120203987 | FACILITATING DATA COMPRESSION DURING REPLICATION USING A COMPRESSIBLE CONFIGURATION BIT - A method is provided for facilitating data replication in a storage system. A logical volume of a first storage array of a replicated pair is preconfigured with one or more logical volume attributes, which include a compressible configuration bit that indicates whether data blocks to be stored to that logical volume are compressible during replication. Subsequently, with receipt of a data block at the first storage array to be stored to the logical volume, a check of the compressible configuration bit is made to determine whether the data block is compressible during replication, and if so, the data block is compressed for replication. The compressible configuration bit is placed into the payload region of the data packet being replicated to the second storage array. At the second storage array, the compressible configuration bit is used to determine whether to uncompress the replicated data block. | 2012-08-09 |
| 20120203988 | STORAGE SYSTEM AND VIRTUALIZATION METHOD - The storage system of the present invention is able to generate one virtual logical device from different logical devices which exist in each of the different storage control units and remote-copy all or part of the virtual logical device to another logical device. The same virtual identifier is set for a volume of the first storage unit and for a volume of the second storage unit. The path control unit of the host identifies a plurality of volumes which have the same virtual identifier as one virtual volume. A remote copy pair can also be set by a virtual volume and a volume of the third storage unit. The setting of the virtual volume and the setting of the remote copy can be performed by means of an instruction from the management server. | 2012-08-09 |
| 20120203989 | Device with Processing Unit and Information Storage - Embodiments related to a processing unit and a first information storage are described and depicted. | 2012-08-09 |
| 20120203990 | METHOD FOR STORING AND RECOVERING DATA, UTILIZATION OF THE METHOD IN A STORAGE CLOUD, STORAGE SERVER AND COMPUTER PROGRAM PRODUCT - A method for storing data in which the data to be stored is divided into a plurality of source blocks, each source block subjected to steps including defining a block key for the source block based on a random function, encrypting the source block by utilizing the defined block key, selecting at least one first storage location and one second storage location from a plurality of different available storage locations, storing control data that includes information on the defined block key at the first selected storage location, and storing encrypted data that includes information on the encrypted source block at the second selected storage location. | 2012-08-09 |
| 20120203991 | COMPACTION PLANNING - An illustrative embodiment of a computer-implemented process for compaction planning selects a source region from a set of regions to form a selected source region, initializes process data using information from the selected source region and responsive to a determination that a current destination is not NULL and not full, determines whether to atomically consume from a destination. Responsive to a determination to atomically consume from a destination, the computer-implemented process plans to evacuate into a consumed extent and updates the process data and responsive to a determination that the source region is empty, determines whether more work remains. Responsive to a determination that more work does not remain, the computer-implemented process generates a relocation table. | 2012-08-09 |
| 20120203992 | PARALLEL, SINGLE-PASS COMPACTION IN A REGION-BASED GARBAGE COLLECTOR - A method to implement parallel, single-pass compaction in a garbage collector is described. In one embodiment, such a method includes conducting a planning phase for multiple regions to be compacted. During the planning phase, the method determines new locations for data entities in the multiple regions. The method then performs a move phase for the multiple regions to move the data entities to their new locations. During the move phase, the method initiates multiple compaction threads to move the data entities to their new locations. While executing, the compaction threads dynamically build a dependency graph of the regions being compacted. The dependency graph guarantees that no data entity is moved to its new location until all data entities that it overwrites have been moved to their new locations. A corresponding computer program product and apparatus are also disclosed and claimed herein. | 2012-08-09 |
| 20120203993 | MEMORY SYSTEM WITH TIERED QUEUING AND METHOD OF OPERATION THEREOF - A method of operation of a memory system includes: providing a memory array having a dynamic queue and a static queue; and grouping user data by a temporal locality of reference having more frequently handled data in the dynamic queue and less frequently handled data in the static queue. | 2012-08-09 |
| 20120203994 | PARALLEL, SINGLE-PASS COMPACTION IN A REGION-BASED GARBAGE COLLECTOR - A method to implement parallel, single-pass compaction in a garbage collector is described. In one embodiment, such a method includes conducting a planning phase for multiple regions to be compacted. During the planning phase, the method determines new locations for data entities in the multiple regions. The method then performs a move phase for the multiple regions to move the data entities to their new locations. During the move phase, the method initiates multiple compaction threads to move the data entities to their new locations. While executing, the compaction threads dynamically build a dependency graph of the regions being compacted. The dependency graph guarantees that no data entity is moved to its new location until all data entities that it overwrites have been moved to their new locations. A corresponding computer program product and apparatus are also disclosed herein. | 2012-08-09 |
| 20120203995 | ON DEMAND STORAGE GROUP MANAGEMENT WITH RECAPTURE - A method to dynamically adjust the amount of free space in a storage group is disclosed herein. In certain embodiments, such a method may include monitoring the amount of free space in an active storage group. The method may further include maintaining an overflow storage group containing unused volumes. When the free space in the active storage group falls below a lower threshold value, the method may automatically move a volume from the overflow storage group to the active storage group. Conversely, when the free space in the active storage group exceeds an upper threshold value, the method may automatically transfer data from a volume in the active storage group to other volumes in the active storage group, and move the volume from the active storage group to the overflow storage group. A corresponding computer program product and apparatus are also disclosed herein. | 2012-08-09 |
| 20120203996 | DATA MIGRATION METHODOLOGY FOR USE WITH ARRAYS OF POWERED-DOWN STORAGE DEVICES - A method for managing extents in a data storage system includes monitoring usage statistics for an extent residing on one or more powered-up storage devices. In the event the extent has not been accessed for specified period of time (as determined from the usage statistics), the method automatically compresses the extent and migrates the extent to an intermediate repository. Once the amount of data in the intermediate repository reaches a specified level, the method migrates the extent from the intermediate repository to one or more normally powered-down storage devices. If I/O is received for the extent while it resides in the normally powered-down storage devices or the intermediate repository, the method automatically migrates the extent from the normally powered-down storage devices or the intermediate repository to the normally powered-up storage devices. A corresponding apparatus and computer program product are also disclosed. | 2012-08-09 |
| 20120203997 | INTEGRITY MONITORING - Systems and methods are described here to provide a degree or level of certification to a resident application such as an operating system, e.g., Linux®. In a Linux® implementation, the operating system provides a robust environment including many seasoned communication stacks, e.g., TCP/IP, USB, and the like. However, Linux® is not certified to the level necessary to be a part of many avionics applications. To eliminate the need to certify all of such an operating system, such certification being highly costly, the avionics application itself may be protected so that the operating system cannot alter the application's operating environment, e.g., application code and data, once the application is loaded and running. In this case, only the application requires certification at the highest level, and not the operating system such as Linux®. | 2012-08-09 |
| 20120203998 | ON DEMAND CONVERSION OF STANDARD LOGICAL VOLUMES TO THIN-PROVISIONED LOGICAL VOLUMES - A method for concurrently converting a standard volume to a thin-provisioned volume includes initially establishing metadata for a thin-provisioned volume. The method then updates the metadata for the thin-provisioned volume to point to extents residing in a standard volume. The method then suspends I/O to metadata for the standard volume. Upon suspending the I/O, the method migrates control of the extents in the standard volume from a standard-volume control algorithm to a thin-provisioned-volume control algorithm. The method then resumes the I/O to the metadata for the thin-provisioned volume. Using this technique, standard volumes may be rapidly converted to thin-provisioned volumes while minimally disrupting I/O to the volumes. A corresponding apparatus and computer program product are also disclosed and claimed herein. | 2012-08-09 |
| 20120203999 | IMPLEMENTING OPTIMAL STORAGE TIER CONFIGURATIONS FOR A WORKLOAD IN A DYNAMIC STORAGE TIERING SYSTEM - A method for Dynamic Storage Tiering (DST) may include identifying a first storage tier with a performance characteristic. The method may include monitoring the utilization of the first storage tier to detect the placement of a hot spot. The method may include logically dividing a continuous range of a plurality of logical addresses into at least a first segment and a second segment so the first segment includes a proportionally larger amount of the hot spot. The method may include moving the first segment into a second storage tier or moving the second segment into the second storage tier. The method may include determining an amount of utilization of the first storage tier by hot spots. The method may include recommending a change in an amount of storage space in the first storage tier based upon the amount of utilization of the first storage tier by the hot spots. | 2012-08-09 |
| 20120204000 | ADDRESS TRANSLATION FOR USE IN A PATTERN MATCHING ACCELERATOR - A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results. | 2012-08-09 |
| 20120204001 | RECONFIGURABLE PROCESSOR AND DRIVING CONTROL METHOD - Provided is a reconfigurable processor capable of reducing the routing processing time of routing nodes by driving the routing nodes at a greater frequency than a driving frequency of the processing elements. The reconfigurable processor includes one or more processing elements configured to be driven at a first driving frequency, and one or more routing nodes configured to be provided on paths that are formed between the processing elements, and to be driven at a second driving frequency that is greater than the first driving frequency. | 2012-08-09 |
| 20120204002 | Providing to a Parser and Processors in a Network Processor Access to an External Coprocessor - A mechanism is provided for sharing a communication used by a parser (parser path) in a network adapter of a network processor for sending requests for a process to be executed by an external coprocessor. The parser path is shared by processors of the network processor (software path) to send requests to the external processor. The mechanism uses for the software path a request mailbox comprising a control address and a data field accessed by MMIO for sending two types of messages, one message type to read or write resources and one message type to trigger an external process in the coprocessor and a response mailbox for receiving response from the external coprocessor comprising a data field and a flag field. The other processors of the network poll the flag until set and get the coprocessor result in the data field. | 2012-08-09 |
| 20120204003 | Invoking Multi-Library Applications on a Multiple Processor System - A mechanism is provided for invoking multi-library application on a multiple processor system, wherein the multiple processor system comprises a Power Processing Element (PPE) and a plurality of Synergistic Processing Element (SPE). Applications including multi-libraries run in the memory of the PPEs. The mechanism comprises maintaining the status of each SPE in the applications running on the PPE, where there are SPE agents for capturing the instructions from the PPE in the SPEs that have been started. In response to a request for invoking a library, the PPE determines whether the number of available SPEs for invoking the library is adequate based on the current status of SPEs. If the number of available SPEs is adequate, the PPE sends a run instruction to selected SPEs. After finishing the invocation of all libraries, the PPE sends termination instructions to all started SPEs. | 2012-08-09 |
| 20120204004 | Processor with a Hybrid Instruction Queue - A queuing apparatus having a hierarchy of queues, in one of a number of aspects, is configured to control backpressure between processors in a multiprocessor system. A fetch queue is coupled to an instruction cache and configured to store first instructions for a first processor and second instructions for a second processor in an order fetched from the instruction cache. An in-order queue is coupled to the fetch queue and configured to store the second instructions accepted from the fetch queue in response to a write indication. An out-of-order queue is coupled to the fetch queue and to the in-order queue and configured to store the second instructions accepted from the fetch queue in response to an indication that space is available in the out-of-order queue, wherein the second instructions may be accessed out-of-order with respect to other second instructions executing on different execution pipelines. | 2012-08-09 |
| 20120204005 | Processor with a Coprocessor having Early Access to Not-Yet Issued Instructions - Apparatus and methods provide early access of instructions. A fetch queue is coupled to an instruction cache and configured to store a mix of processor instructions for a first processor and coprocessor instructions for a second processor. A coprocessor instruction selector is coupled to the fetch queue and configured to copy coprocessor instructions from the fetch queue. A queue is coupled to the coprocessor instruction selector and from which coprocessor instructions are accessed for execution before the coprocessor instruction is issued to the first processor. Execution of the copied coprocessor instruction is started in the coprocessor before the coprocessor instruction is issued to a processor. The execution of the copied coprocessor instruction is completed based on information received from the processor after the coprocessor instruction has been issued to the processor. | 2012-08-09 |
