23rd week of 2016 patent applcation highlights part 50 |
Patent application number | Title | Published |
20160162322 | Remote Debugging As a Service - Debugging capabilities for software running in a cloud-computing environment are disclosed. A controller identifies which machines in the cloud are running instances of software to be debugged. An agent is deployed onto the machines in the cloud to facilitate communication with the developer's machine. When the developer wants to debug software on the agent's machine, the agent downloads and installs a monitor onto the machine. The agent configures the machine for remote debugging via the monitor. A security mechanism ensures that only authenticated developers can access the monitor and the remote machine for debugging. A controller automatically determines which machines can be debugged, updates a list of processes available for debugging on the machines, and identifies how to connect a developer's debugging client to the machines. The controller permits remote debugging only upon request from an authenticated developer and only for those processes that the developer is permitted to debug. | 2016-06-09 |
20160162323 | MONITORING AND MODIFYING ALLOCATED COMPUTING RESOURCES - Data is collected for at least one metric relating to utilization of a computing resource allocated to a virtual machine. The data is compared to decision criteria. A confidence level that the virtual machine is not utilized based, at least in part, on the comparing is determined. A policy is identified that defines an action to be taken for the confidence level. A severity of the action is greater as the confidence level increases. The action is initiated the action in accordance with the policy and confidence level. | 2016-06-09 |
20160162324 | MANAGEABLE EXTERNAL WAKE OF VIRTUAL MACHINES - A processor of a computing system receives a message while a virtual machine that is hosted by the computer system is asleep. The processor determines whether to wake the virtual machine in view of a parameter of the message. | 2016-06-09 |
20160162325 | VIRTUAL MACHINE SUSPENSION IN CHECKPOINT SYSTEM - Performing a checkpoint includes determining a checkpoint boundary of the checkpoint for a virtual machine, wherein the virtual machine has a first virtual processor, determining a scheduled hypervisor interrupt for the first virtual processor, and adjusting, by operation of one or more computer processors, the scheduled hypervisor interrupt to before or substantially at the checkpoint boundary. | 2016-06-09 |
20160162326 | Compression Within A Set Of Images - The present disclosure relates generally to a system and method for file compression. More specifically, the disclosure introduces to a method for file compression wherein a group of files is identified by comparing a plurality of similarity characteristics. The group of files may then be compressed relative to at least one base file to improve compression efficiency. | 2016-06-09 |
20160162327 | IMAGE DISPLAY CONTROL DEVICE - A PC includes: a desktop display management section causing a display device to display, among desktops, a main or sub desktop by switching between these desktops, the sub desktop being associated with the main desktop; and an application program execution process section executing application programs and displaying images on the main and sub desktops, the images being generated by execution of the application programs, respectively. The desktop display management section switches the main desktop to the sub desktop by a start instruction to start the application program of the image on the sub desktop. | 2016-06-09 |
20160162328 | SYNCHRONOUS BUSINESS PROCESS EXECUTION ENGINE FOR ACTION ORCHESTRATION IN A SINGLE EXECUTION TRANSACTION CONTEXT - An asynchronous business process specification declared in a procedural markup language comprising an activity flow model and a plurality of activities is received. An indication is received that a subset of the plurality of activities is to be synchronously executed without reduced latency. All process execution related objects are fetched once into a memory. The synchronous subset is executed in a single execution transaction context. | 2016-06-09 |
20160162329 | SOFTWARE ENABLED AND DISABLED COALESCING OF MEMORY TRANSACTIONS - A program controls coalescing of outermost memory transactions, the coalescing causing committing of memory store data to memory for a first transaction to be done at transaction execution (TX) end of a second transaction. Optimized machine instructions are generated based on an intermediate representation of a program, wherein either two atomic tasks are merged into a single coalesced transaction or are executed as separate transactions. | 2016-06-09 |
20160162330 | EPOLL OPTIMISATIONS - A method for managing I/O event notifications in a data processing system comprising a plurality of applications and an operating system having a kernel and an I/O event notification mechanism operable to maintain a plurality of I/O event notification objects each handling a set of file descriptors associated with one or more I/O resources. For each of a plurality of application-level configuration calls: intercepting at a user-level interface a configuration call from an application to the I/O event notification mechanism for configuring an I/O event notification object; and storing a set of parameters of the configuration call at a data structure, each set of parameters representing an operation on the set of file descriptors handled by the I/O event notification object; and subsequently, upon meeting a predetermined criterion: the user-level interface causing the plurality of configuration calls to be effected by means of a first system call to the kernel. | 2016-06-09 |
20160162331 | Prioritizing Cloud-based Computing Tasks - Systems and methods for prioritizing cloud-based computing tasks are provided. An example method includes, identifying a first plurality of service requests submitted by a plurality of users including a first user; selecting a first service request, in the plurality of service requests, in accordance with a first priority, where the first service request is submitted by the first user; selecting a second service request submitted by the first user, in a second plurality of service requests submitted by the first user, in accordance with a second priority, where the second service request is associated with a first job type; and selecting a third service request submitted by the first user, in a third plurality of service requests submitted the first user, in accordance with a third priority, where the third plurality of service requests submitted the first user are associate with a same job type. | 2016-06-09 |
20160162332 | PROACTIVE PRESENTATION OF MULTITASK WORKFLOW COMPONENTS TO INCREASE USER EFFICIENCY AND INTERACTION PERFORMANCE - A multitask workflow is proactively identified based upon user context information. For discrete tasks of the multitask workflow, modules directed to such tasks are identified from among other modules also directed to the same task, and are proactively presented to the user. Modules are selected based upon predetermined values associated with such modules, which can be indicative of capabilities, relationships, incentives associated with presentation of the modules to the user, and other like valuations. The modules offer visually enticing experiences to aid the user in performing a task, of the multitask workflow, and thereby increasing the user's interaction performance. Additionally, the modules exchange information to increase user efficiency in performing the multitask workflow. Multiple computing devices associated with a user can execute different modules of the multitask workflow, enabling two or more users to collaborate on the multitask workflow or otherwise research and perform tasks associated with the multitask workflow. | 2016-06-09 |
20160162333 | AUTOMATED CREATION OF EXECUTABLE WORKFLOW - A computing device receives information describing one or more workflow components. The computing device determines whether at least one executable step can be determined for each of the one or more workflow components. The computing device provides an indication of whether at least one executable step can be determined for each of the one or more workflow components. | 2016-06-09 |
20160162334 | CONCURRENT WORKLOAD DEPLOYMENT TO SYNCHRONIZE ACTIVITY IN A DESIGN PALETTE - A system and method for iteratively deploying a workload pattern are provided. The system and method determines a current set of requirements for at least one piece of the workload pattern that is initiated in a designer and generates a stability metric for at least one of the current set of requirements. The system and method further compares the stability metric to an acceptance threshold and calculates an estimated time to deploy the at least one piece of the workload pattern based on the comparing of the stability metric to the acceptance threshold. | 2016-06-09 |
20160162335 | Dynamic Computing Resource Management - Systems and methods provide an extensible, multi-stage, realtime application program processing load adaptive, manycore data processing architecture shared dynamically among instances of parallelized and pipelined application software programs, according to processing load variations of said programs and their tasks and instances, as well as contractual policies. The invented techniques provide, at the same time, both application software development productivity, through presenting for software a simple, virtual static view of the actually dynamically allocated and assigned processing hardware resources, together with high program runtime performance, through scalable pipelined and parallelized program execution with minimized overhead, as well as high resource efficiency, through adaptively optimized processing resource allocation. | 2016-06-09 |
20160162336 | CPU SCHEDULER CONFIGURED TO SUPPORT LATENCY SENSITIVE VIRTUAL MACHINES - A host computer has one or more physical central processing units (CPUs) that support the execution of a plurality of containers, where the containers each include one or more processes. Each process of a container is assigned to execute exclusively on a corresponding physical CPU when the corresponding container is determined to be latency sensitive. The assignment of a process to execute exclusively on a corresponding physical CPU includes the migration of tasks from the corresponding physical CPU to one or more other physical CPUs of the host system, and the directing of task and interrupt processing to the one or more other physical CPUs. Tasks of the process corresponding to the container are then executed on the corresponding physical CPU. | 2016-06-09 |
20160162337 | MULTIPLE CORE REAL-TIME TASK EXECUTION - A real-time task may initially be performed by a first thread that is executing on a first core of a multi-core processor. A second thread may be initiated to take over the performance of the real-time task on a second core of the multi-core processor while the first thread is performing the real-time task. The performance of the real-time tasks is then transferred from the first thread to the second thread with the execution of the second thread on the second core to perform the real-time task. | 2016-06-09 |
20160162338 | METHODS AND SYSTEMS THAT ALLOCATE COST OF CLUSTER RESOURCES IN VIRTUAL DATA CENTERS - This disclosure presents computational systems and methods that allocate cost of resources of a cluster of server computers used by virtual machines in a virtual data center. In one aspect, a fair unit rate is computed based on the larger of a measured average utilization or an expected utilization of a cluster resource of server computers within a physical data center by virtual machines. The fair unit rate is a cost per unit of resource used over a period of time and is used to compute an allocated cost of the virtual machine usage of the cluster resource. | 2016-06-09 |
20160162339 | CONCURRENT WORKLOAD DEPLOYMENT TO SYNCHRONIZE ACTIVITY IN A DESIGN PALETTE - A system and method for iteratively deploying a workload pattern are provided. The system and method determines a current set of requirements for at least one piece of the workload pattern that is initiated in a designer and generates a stability metric for at least one of the current set of requirements. The system and method further compares the stability metric to an acceptance threshold and calculates an estimated time to deploy the at least one piece of the workload pattern based on the comparing of the stability metric to the acceptance threshold. | 2016-06-09 |
20160162340 | POWER EFFICIENT HYBRID SCOREBOARD METHOD - Described herein are technologies related to a method of enforcing thread dependencies using a hybrid scoreboard-based approach. | 2016-06-09 |
20160162341 | READER-WRITER LOCK - A method and system for implementing a reader-writer lock having a write lock requested by a thread is disclosed. The reader-writer lock is structured to have counters and a flag. The counters use an atomic process to count read locks held or outstanding read lock requests. The flag identifies a counter and is configured to distinguish between counters. A read lock is prepared, acquired, and released. The atomic process is used and the flag or flagged counter is polled. A write lock is prepared, acquired, and released. | 2016-06-09 |
20160162342 | MEMORY MANAGEMENT OF A DEVICE ACCESSING APPLICATIONS - Various embodiments of systems and methods to provide memory management of a device accessing applications are described herein. In one aspect, a request is received to access an application on a device. Further, a check is performed to determine whether the application is enterprise application or personal use application. When the application is personal use application, access to the application is provided by installing the personal use application on the device. The personal use application utilizes at least a portion of an available general memory and a portion of an available corporate memory in the device. | 2016-06-09 |
20160162343 | Maintaining state information in a multi-component, event-driven state machine - A method, apparatus and computer program product that allows for maintaining correct states of all sub-components in a state machine, even as sub-components leave the state machine and later rejoin in some previous state. Preferably, this is achieved without requiring the system to remember the states of all sub-components or a log of every event that was fed into the state machine. Thus, the technique does not require any knowledge of the previous state of the sub-components nor the need to preserve a complete log of events that were fed into the state machine. The state machine may be used to enhance the operation of a technological process, such as a workload management environment. | 2016-06-09 |
20160162344 | GENERATION OF REPRESENTATIONAL STATE TRANSFER INTERFACE FROM APPLICATION PROGRAMMING INTERFACES - In one embodiment, a method includes extracting, by one or more processors, a class name from a uniform resource identifier (URI) of an application header of a standardized interface request that includes a command formatted in an application protocol. The application header includes meta-data that allows class declarations to function, at least in part, as a portion of interface description language. In another embodiment, a computer system for generating a RESTful interface includes a computer-readable memory and one or more processors in electrical communication with the memory. The one or more processors are configured to perform the method recited above. In yet another embodiment, a computer program product includes a computer-readable storage medium and program instructions stored on the computer-readable storage medium readable/executable by one or more processors to perform the method recited above. | 2016-06-09 |
20160162345 | ENABLING VIRTUAL CALLS IN A SIMD ENVIRONMENT - Systems and methods of enabling virtual calls in a single instruction multiple data (SIMD) environment may involve detecting a virtual call of a function and using a single dispatch of the function to invoke the virtual call for two or more channels of the virtual call. In one example, it is determined that the two or more channels share a common target address and a single dispatch of the function is conducted with respect to the common target address. The process may be iterated for additional channels of the virtual call that share a common target address. | 2016-06-09 |
20160162346 | ROOT CAUSE ANALYSIS FOR SERVICE DEGRADATION IN COMPUTER NETWORKS - Various exemplary embodiments relate to a method of determining the root cause of service degradation in a network, the method including determining a window of time; determining one or more abnormal Key Quality Indicators (KQIs) in the window; determining one or more abnormal Key Performance Indicators (KPIs) in the window; calculating a conditional probability that each of one or more KPIs is abnormal when a Key Quality Indicator (KQI) is normal; calculating a conditional probability that the each of one or more KPIs is abnormal when the KQI is abnormal; calculating a score for each KPI based upon a divergence of a Beta distribution for the conditional probability that each of one or more KPIs is abnormal when a KQI is normal and a Beta distribution for the conditional probability that the each of one or more KPIs is abnormal when the KQI is abnormal; and generating a representative root-cause list based upon the score for each KPI. | 2016-06-09 |
20160162347 | INFORMATION PROCESSING APPARATUS AND METHOD OF DIAGNOSIS - A building block includes an XSCF that controls the building block and an XBU that performs communication with another building block. The XSCF includes a hardware controller that instructs crossbar diagnosis to the XBU. The XBU includes a port information storage unit that stores therein diagnosis information related to the crossbar diagnosis and a test module that performs the crossbar diagnosis on the basis of the diagnosis information stored in the port information storage unit. | 2016-06-09 |
20160162348 | AUTOMATED DETECTION OF A SYSTEM ANOMALY - A method for automated detection of a real IT system problem may include obtaining monitor measurements of metrics associated with activities of a plurality of configuration items of the IT system. The method may also include detecting anomalies in the monitor measurements. The method may further include grouping concurrent anomalies of the detected anomalies corresponding to configuration items of the plurality of configuration items which are topologically linked to be regarded as a system anomaly. The method may further include calculating a significance score for the system anomaly, and determining that the system anomaly relates to a real system problem based on the calculated significance score. | 2016-06-09 |
20160162349 | Protection Status Determinations for Computing Devices - Systems, methods, and media that provide backup protection statuses for computing devices are provided herein. Some methods may include determining a backup status for a first computing device, assigning a protection status for the first computing device based upon a comparison of the backup status and a compliance schema for the first computing device, and transmitting the protection status to a monitoring device utilized by an end user. | 2016-06-09 |
20160162350 | Evaluating and Servicing Problematic Cash-Handling Machines - A method of tracking repeated performance problems in a machine is disclosed. The method comprises storing the faults in a computer memory, and assigning a classification value to the machine based on the frequency and number of the faults. Based on the classification value of the cash handing device it is determined whether the cash handing device needs to be serviced. The faults can be related to one of the hardware, the cash reject rate, image handling, crash rate, user claim rate, and check handling accuracy of the machine. | 2016-06-09 |
20160162351 | PARITY CHECK CIRCUIT AND MEMORY DEVICE INCLUDING THE SAME - A parity check circuit may include a first signal combination unit for generating first to N | 2016-06-09 |
20160162352 | SYSTEMS AND METHODS FOR ADAPTIVE ERROR CORRECTIVE CODE MECHANISMS - Systems and methods for managing the endurance of a solid state drive by assigning error corrective codes (ECC) to a plurality of solid state drive blocks are provided. The disclosed systems and methods can provide a plurality of error corrective codes, each code having a corresponding correction capability and assign to each solid state drive block an error corrective code, according to a reliability of the solid state drive block. Moreover, the disclosed systems and methods can group the solid state drive blocks into groups according to their assigned error corrective codes and apply, for each group of solid state drive block, a level of ECC correction according to the assigned error corrective code of each group. | 2016-06-09 |
20160162353 | STORAGE PARAMETERS FOR A DATA STORAGE DEVICE - A method of operating a data storage device having a memory includes reading error location data associated with a first region of the memory. The memory includes the first region and a second region. The method also includes generating one or more parameters based on the error location data. The method includes receiving data to be written to the memory and encoding the data to produce a codeword. The method also includes partitioning the codeword based on the one or more parameters to generate a first portion and a second portion. The method further includes performing a write operation to store the first portion at the first region and to store the second portion at the second region. | 2016-06-09 |
20160162354 | SYSTEMS AND METHODS FOR MULTI-ZONE DATA TIERING FOR ENDURANCE EXTENSION IN SOLID STATE DRIVES - Systems and methods for increasing the endurance of a solid state drive are disclosed. The disclosed systems and methods can assign different levels of error protection to a plurality of blocks of the solid state drive. The disclosed methods can provide a plurality of error correction mechanisms, each having a plurality of corresponding error correction levels and associate a first plurality of blocks of the solid state drive with a first zone and a second plurality of blocks of the solid state drive with a second zone. The disclosed methods can assign a first error correction mechanism and a first corresponding error correction level to the first zone and can assign a second error correction mechanism and a second corresponding error correction level to the second zone. | 2016-06-09 |
20160162355 | METHODS, CIRCUITS, DEVICES, SYSTEMS AND MACHINE EXECUTABLE CODE FOR READING FROM A NON-VOLATILE MEMORY ARRAY - Disclosed is a method for reading from a non-volatile memory (NVM) device including: retrieving a set of data from an NVM array according to a read sequence for a requested set of logical memory locations received from a host device, detecting errors in the set of data, preparing an error indicator to be output to a host device substantially upon detection of the errors and outputting the error indication in response to a command being received from the host device. | 2016-06-09 |
20160162356 | METHODS AND SYSTEMS FOR IMPLEMENTING REDUNDANCY IN MEMORY CONTROLLERS - The present disclosure relates to methods and systems for implementing redundancy in memory controllers. The disclosed systems and methods utilize a row of memory blocks, such that each memory block in the row is associated with an independent media unit. Failures of the media units are not correlated, and therefore, a failure in one unit does not affect the data stored in the other units. Parity information associated with the data stored in the memory blocks is stored in a separate memory block. If the data in a single memory block has been corrupted, the data stored in the remaining memory blocks and the parity information is used to retrieve the corrupted data. | 2016-06-09 |
20160162357 | APPROACH TO CORRECT ECC ERRORS USING DUPLICATE COPIES OF DATA - Devices and methods implemented therein in are disclosed for correcting errors in data. The method comprises determining that a first copy of data and a second copy of data include errors uncorrectable by an error correction code (ECC) engine. The ECC engine is modified based on determining that the first copy of data and the second copy of data include errors uncorrectable by the ECC engine and using the modified ECC engine, the first copy of data and the second copy of data are processed to correct the errors in the first and second copy of the data. | 2016-06-09 |
20160162358 | MICROCONTROLLER - A microcontroller includes a nonvolatile memory. The microcontroller executes an ECC error detection to detect an ECC error during a main process, which accesses the nonvolatile memory, and an interrupt process when the ECC error occurs. The interrupt process executes a change process that specifies an instruction causing the ECC error, which is detected by the ECC error detection, and changes a program counter to skip the specified instruction and to execute a next instruction. The microcontroller executes an abnormality value storage process that stores an abnormality value in a storage destination of a read value, and the read value is read in the main process after the change process. | 2016-06-09 |
20160162359 | SYSTEM AND METHOD FOR PERFORMING SIMULTANEOUS READ AND WRITE OPERATIONS IN A MEMORY - A memory comprises a set of content memory banks, a parity memory bank, and a register corresponding to the parity memory bank. A first memory interface device is configured to, in response to receiving a write request to write to the set of content memory banks, perform a write operation over multiple clock cycles including temporarily storing parity information corresponding to the write request in the register before the parity information is written to the parity memory bank. A second memory interface device is configured to: in response to i) receiving a read request to read data from a memory bank in the set of content memory banks, and ii) determining that information responsive to the read request is to be reconstructed using parity information, and selectively use information from either i) the register or ii) the parity memory bank, to reconstruct information responsive to the read request. | 2016-06-09 |
20160162360 | DISK ARRAY HAVING MIRROR CONFIGURATION AND REBUILDING METHOD THEREFOR - A disk array includes a buffer to temporarily store data (data X) from a host, a redundant first and second disk having a mirror configuration, and an auxiliary disk. A controller controls reading and writing of data X in response to a request. The controller is configured to: (a) copy to the auxiliary disk, data X stored in the buffer for rebuilding, in parallel with reading and writing data X, when the second disk fails; (b) log copied disk locations of data X copied in (a); (c) return a response to the host after completion; (d) reference a redundancy management table before copying in (a) to determine whether data X stored in the buffer has been copied; and (e) bypass copying in (a) and return to the host a response when current data X has been copied in (d). | 2016-06-09 |
20160162361 | Reliability Enhancement in a Distributed Storage System - Machines, systems and methods for enhancing data recovery in a data storage system, the method comprising determining whether one or more data storage mediums in a data storage system are unavailable; determining data that are at a risk of loss, due to said one or more data storage mediums being unavailable; from among the data that is determined to be at the risk of loss, identifying data that is highly vulnerable to loss; and creating one or more temporary replicas of the data that is highly vulnerable to loss. | 2016-06-09 |
20160162362 | COMPUTER SYSTEM BACKUP PERFORMANCE OPTIMIZATION THROUGH PERFORMANCE ANALYTICS - Embodiments in accordance with the present invention disclose a method, computer program product, and system for optimizing performance of a computer backup solution that includes at least two data movers. The automated method includes measuring data mover performance during operation of a backup cycle, and optimizing the performance of data movers by increasing or decreasing the number of threads operating concurrently in the data movers. The method further includes computation of performance rankings of the data movers and shifting workload among the data movers in accordance with their respective performance rankings, such that the computer backup solution converges toward an optimized configuration. | 2016-06-09 |
20160162363 | PERFORMING A CLOSURE MERGE OPERATION - In a method for data management, one or more processors identifying a source closure, a target file set, and a previously merged closure, wherein the source closure is a closure of files that includes changed files to merge into the target file set, and wherein the previously merged closure is a closure of files previously merged into the target file set. The method further includes one or more processors loading the identified source closure, the previously merged closure, and a closure of ancestor files shared by the identified source closure and the previously merged closure into a merge session. The method further includes one or more processors determining one or more file merge conflicts in the merge session based on differences between a comparison of the identified source closure to the closure of ancestor files and a comparison of the previously merged closure to the closure of ancestor files. | 2016-06-09 |
20160162364 | SECONDARY STORAGE PRUNING - Systems and methods for storage pruning can enable users to delete, edit, or copy backed up data that matches a pattern. Storage pruning can enable fine-grain deletion or copying of these files from backups stored in secondary storage devices. Systems and methods can also enable editing of metadata associated with backups so that when the backups are restored or browsed, the logical edits to the metadata can then be performed physically on the data to create a custom restore or a custom view. A user may perform operations such as renaming, deleting, modifying flags, and modifying retention policies on backed up items. Although the underlying data in the backup may not change, the view of the backup data when the user browses the backup data can appear to include the user's changes. A restore of the data can cause those changes to be performed on the backup data. | 2016-06-09 |
20160162365 | STORING DIFFERENCE INFORMATION IN A BACKUP SYSTEM - Examples disclosed herein relate to storing difference information in a backup system. Examples include storing, in remote backup storage of the backup system, difference information representing differences between data stored locally at a computing device and a version of the data stored in the version control storage of a version control system. | 2016-06-09 |
20160162366 | A METHOD FOR A LOGGING PROCESS IN A DATA STORAGE SYSTEM - A logging process in a data storage system having a set of storage tiers, each storage tier of the set of storage tiers having different performance characteristics, wherein the set of storage tiers is divided into a plurality of subsets of storage tiers using the performance characteristics, may include initiating the logging process for creating a separate log file for each of the plurality of subsets of storage tiers for maintaining a history of data changes in the subset of storage tiers, thereby creating a plurality of log files. In response to a change in data stored in at least one storage tier of a subset of storage tiers of the plurality of subsets of storage tiers, one or more log records including information about the change may be generated and written into respective log files. | 2016-06-09 |
20160162367 | PLURAL ARCHITECTURE MASTER DATA MANAGEMENT - According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures comprises at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within one or more data sources, while the second data management architecture manages persisted entities with data from the one or more data sources within a common repository. A modification to data of the persisted entity is detected within the one or more data sources, and the modified data is synchronized with the persisted entity in the repository of the second data management architecture. Embodiments of the present invention further include a method and computer program product for managing data within a plurality of data management architectures in substantially the same manner described above. | 2016-06-09 |
20160162368 | REMOTE STORAGE - Remote storage of consumer data is achieved by processing consumer data for deduplication at a client computing system that includes creating metadata comprising information relating to a consumer directory tree structure of the consumer data, and transferring the deduplicated data and metadata for remote storage | 2016-06-09 |
20160162369 | OPPORTUNISTIC EXECUTION OF SECONDARY COPY OPERATIONS - Rather than relying on pre-defined scheduling of secondary copy operations such as backup jobs, the illustrative opportunistic approach initiates secondary copy operations based on changing operational conditions in a storage management system. An adaptive backup readiness score is based on a number of backup-readiness operational factors. An illustrative enhanced data agent which is associated with the target database application (or other executable component) may monitor the operational factors and determine the backup readiness score based on weights assigned to the respective operational factors. The enhanced data agent may evaluate recent backup jobs to determine which of the operational factors that contributed to the backup readiness score may have been most relevant. Based on the most-relevant analysis, the enhanced data agent may adapt the weights assigned to the monitored operational factors, so that the backup readiness score may be more suitable and responsive to ongoing operational conditions in the system. | 2016-06-09 |
20160162370 | SYNCHRONIZATION BASED ON FILTERED BROWSING - According to certain aspects, a method can include electronically accessing, by a storage manager, a stored synchronization policy specifying at least a first folder associated with a first computing device and a second folder associated with a second computing device; identifying a first file stored in the first folder as a candidate for synchronization; receiving an indication as to a location of the first computing device and the second computing device; in response to a determination that the first computing device is not located within a geographic region, electronically generating and transmitting instructions to the first computing device to remove the first file from the first folder; and in response to a determination that the second computing device is located within the geographic region, electronically generating and transmitting instructions to cause transmission of the first file to the second computing device for storage in the second folder. | 2016-06-09 |
20160162371 | SUPPORTING MULTI-TENANCY THROUGH SERVICE CATALOG - The techniques introduced here provide for efficient creation and management of secure storage and backup in a cloud storage network. The techniques include a system and method for provisioning storage for a user in a cloud storage network. Using the techniques introduced here, a management module, upon receiving a request from a user for storage in a cloud storage system, determines a primary storage system and a secondary storage system for primary storage and backup storage, respectively, that meets the requirements of a service level selected by the user. The management module then creates and configures a primary virtual server and a secondary virtual server, for the primary storage and the backup storage, respectively, and provisions storage for the user. The techniques also include non-disruptive migration of data between virtual servers in response to a service level change. | 2016-06-09 |
20160162372 | SYSTEMS AND METHODS FOR ON-LINE BACKUP AND DISASTER RECOVERY - A data recovery system includes a plurality of customer computers to be backed-up, each customer computer running a client software to communicate back-up data files; a system management platform coupled to the client software over the Internet, the system management platform receiving inputs from a web user portal to control operations of the client software and the system management platform to back up the customer computer; and two or more data storage silos, each including: a plurality of storage directors communicating with the client software; and a clustered data storage array. | 2016-06-09 |
20160162373 | COMPUTER SYSTEM BACKUP PERFORMANCE OPTIMIZATION THROUGH PERFORMANCE ANALYTICS - Embodiments in accordance with the present invention disclose a method, computer program product, and system for optimizing performance of a computer backup solution that includes at least two data movers. The automated method includes measuring data mover performance during operation of a backup cycle, and optimizing the performance of data movers by increasing or decreasing the number of threads operating concurrently in the data movers. The method further includes computation of performance rankings of the data movers and shifting workload among the data movers in accordance with their respective performance rankings, such that the computer backup solution converges toward an optimized configuration. | 2016-06-09 |
20160162374 | SECONDARY STORAGE EDITOR - Systems and methods for storage pruning can enable users to delete, edit, or copy backed up data that matches a pattern. Storage pruning can enable fine-grain deletion or copying of these files from backups stored in secondary storage devices. Systems and methods can also enable editing of metadata associated with backups so that when the backups are restored or browsed, the logical edits to the metadata can then be performed physically on the data to create a custom restore or a custom view. A user may perform operations such as renaming, deleting, modifying flags, and modifying retention policies on backed up items. Although the underlying data in the backup may not change, the view of the backup data when the user browses the backup data can appear to include the user's changes. A restore of the data can cause those changes to be performed on the backup data. | 2016-06-09 |
20160162375 | DATA STORAGE DEVICE FOR SELF-DETECTING ERROR AND LOGGING OPERATION AND METHOD OF OPERATING THE SAME - A method of operating a data storage device which is provided with an operating voltage from a host and communicates with the host is provided. The method includes converting an operation mode of the data storage device into a debugging mode in response to a log start command transmitted from the host, receiving a first operation command from the host and executing the first operation command, generating first log information corresponding to a result of executing the first operation command, storing the first log information in a first storage area of memory of the data storage device, and copying at least part of the first log information from the first storage area to a second storage area of the memory of the data storage device when an event occurs according to the result of executing the first operation command. | 2016-06-09 |
20160162376 | EVENT LOGGING AND ERROR RECOVERY - A method, computer program product, and system to control event logging and error recovery in a system including adapters, ports, and channels are described. The method includes storing a recovery threshold for each event type among a plurality of event types and storing a level-specific logging threshold for each event type, implementing event handlers for each of the channels, the ports, and the adapters of the system, and implementing a threshold manager for the events identified by the event handlers based on the level-specific logging threshold and the recovery threshold for each of the respective event types of each of the events. For any identified event corresponding with a given event type, the implementing the threshold manager includes considering the recovery threshold and the level-specific logging threshold at every level regardless of a level at which the identified event is identified. | 2016-06-09 |
20160162377 | Access Control Method and System, and Access Point - An access control method and system and an access point. When a fault occurs in an access controller (AC), an access point (AP) configures a network-layer interface of the AP according to an Internet Protocol (IP) address and a media access control (MAC) address of the AC that are obtained by means of pre-learning, and then the AP routes a received packet to a Web server on a wireless local area network (WLAN) using the configured network-layer interface, where the packet is used by a first station (STA) to request to access an external server. Therefore, interconnection and interworking among wireless local area networks are implemented, and a breakdown of a wireless local area network caused in a centralized network architecture due to occurrence of a fault in an AC is avoided. | 2016-06-09 |
20160162378 | DISASTER RECOVERY SERVICE - A customer may use a disaster recovery service to generate a disaster recovery scenario in order to make certain resources available to the customer in the event of a data region failure. The customer may specify a recovery point objective, a recovery time objective and a recovery data region for the scenario. Accordingly, the disaster recovery service may coordinate with one or more other services provided by the computing resource service provider to reproduce the customer resources and other resources necessary to support the customer resources. These reproduced resources may be transferred to the recovery data region based at least in part on the parameters specified by the customer. In the event of a data region failure, the disaster recovery service may update the domain name system to resolve any customer requests for the customer resources to the recovery data region. | 2016-06-09 |
20160162379 | SATA RECEIVER EQUALIZATION MARGIN DETERMINATION/SETTING METHOD AND APPARATUS - Apparatuses, methods and storage medium associated with automatic SATA receiver equalization margin determination and setting, are disclosed. In embodiments, an apparatus may comprise a BIOS configured to determine, during POST, whether a device is attached to one of the SATA ports, and on determination that a device is attached to one of the SATA ports, further determine whether a receiver equalization margin has been set for the device. Additionally, the BIOS may be configured to perform a DTLE training to dynamically determine and set the receiver equalization margin for the device, on determination that a receiver equalization margin has not been set for the device. Other embodiments may be described and/or claimed. | 2016-06-09 |
20160162380 | IMPLEMENTING PROCESSOR FUNCTIONAL VERIFICATION BY GENERATING AND RUNNING CONSTRAINED RANDOM IRRITATOR TESTS FOR MULTIPLE PROCESSOR SYSTEM AND PROCESSOR CORE WITH MULTIPLE THREADS - A method and system are provided for implementing functional verification including generating and running constrained random irritator tests for a multiple processor system and for a processor core with multiple threads. Separate tests are generated, a main test for one thread, and an irritator test for each other thread in the configuration. The main test and each irritator test are saved and randomly mixed then combined together again, where the main thread is not forced to be generated with any particular irritator. | 2016-06-09 |
20160162381 | IMPLEMENTING PROCESSOR FUNCTIONAL VERIFICATION BY GENERATING AND RUNNING CONSTRAINED RANDOM IRRITATOR TESTS FOR MULTIPLE PROCESSOR SYSTEM AND PROCESSOR CORE WITH MULTIPLE THREADS - A method and system are provided for implementing functional verification including generating and running constrained random irritator tests for a multiple processor system and for a processor core with multiple threads. Separate tests are generated, a main test for one thread, and an irritator test for each other thread in the configuration. The main test and each irritator test are saved and randomly mixed then combined together again, where the main thread is not forced to be generated with any particular irritator. | 2016-06-09 |
20160162382 | SYSTEM THAT COMPARES DATA CENTER EQUIPMENT ABNORMALITIES TO SLAS AND AUTOMATICALLY COMMUNICATES CRITICAL INFORMATION TO INTERESTED PARTIES FOR RESPONSE - A system that compares data center equipment abnormalities to SLAS (Service Level Agreements) that automatically communicates critical information to interested parties for response. | 2016-06-09 |
20160162383 | Monitoring Redundant Components - A device for monitoring a component has at least one processor core and a further processor core. The device further includes a determining unit configured to determine a profile of the processor core, the profile being influenced by an input signal applied to the processor core, and to determine a further profile of the further processor core, the further profile being influenced by a further input signal applied to the further processor core. The device further includes a comparison unit configured to compare the profile and the further profile and to generate a fault signal, if a comparison result of a comparison carried out by the comparison unit indicates defective similarity of the profile to the further profile. | 2016-06-09 |
20160162384 | APPARATUS AND PROGRAM - This apparatus is provided with a storage means and a comparison means. The storage means has two or more modules stored therein. The comparison means acquires, from the storage means, a first module and a second module from among the modules stored in the storage means. Furthermore, the comparison means creates a message that indicates whether a hierarchical structure of the first module matches a hierarchical structure of the second module. | 2016-06-09 |
20160162385 | CORRELATION OF VIOLATING CHANGE SETS IN REGRESSION TESTING OF COMPUTER SOFTWARE - Embodiments of the invention provide for the correlation of violating change sets during regression testing of a computer program. A method of the invention includes annotating a test case with a reference to logical operations of different programmatic objects of a computer program. Thereafter, change sets are applied to the program and the test case is executed by a development environment such as a debugger to a point of failure. It is then determined from the annotations change sets related to the logical operations and different ones of the determined change sets are sequentially replaced and the test case repeatedly re-executed. As such, the ones of the replaced change sets resulting in failure from re-execution of the test case are determined to be violating change sets. | 2016-06-09 |
20160162386 | CODE CHANGE ANALYSIS TO OPTIMIZE TESTING LIFECYCLE - The present disclosure relates to system(s) and method(s) for detecting change in software code of elements in a current version associated with a software application as compared to a reference version of the software application. The system and method further determines whether the change in the software code of the elements is a functional change or a non-functional change. The system and method also provides an optimized test suite for testing the current version of the software application, in order to test the elements with functional change, in the current version. | 2016-06-09 |
20160162387 | PROMOTION DETERMINATION BASED ON AGGREGATED CODE COVERAGE METRICS - Techniques are described for aggregating code coverage data generated from various types of testing of software modules, and automatically determining whether to promote software upwards in a multi-level software deployment hierarchy based on the aggregated code coverage data. In embodiments, a code coverage metric is determined for a software module, and the metric is compared to a set of promotion criteria, including whether the metric meets a predetermined threshold for quality. In some cases, the threshold may be a general threshold, a threshold based on the level of possible promotion, and/or a threshold that is based on an identified category for the software module such as whether the module is a front-end module, a shared module, a legacy module, or a critical module. | 2016-06-09 |
20160162388 | TRANSITIVE SOURCE CODE VIOLATION MATCHING AND ATTRIBUTION - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for matching and attributing code violations. One of the methods includes receiving a plurality of snapshots of a code base, including data representing a revision graph of the snapshots of the code base and data representing respective violations in each of the plurality of snapshots. A plurality of transitively matched violations in the code base are generated, wherein each transitively matched violation represents a respective sequence of matching violations from a first violation of a first snapshot to a second violation of a second snapshot, wherein each transitively matched violation identifies a respective first violation representing an initial occurrence of a coding defect in the code base and a respective second violation representing a last occurrence of the coding defect in the code base. | 2016-06-09 |
20160162389 | Device Cloud Monitoring and Stability - An example system may include a first device connected over respective communications interfaces to a plurality of second devices. The first device may establish respective remote terminals between the first device and one or more second devices. Establishing the respective remote terminals may indicate that the devices are in an online state. The first device may periodically update respective heartbeat files on the second devices. A respective second device may detect that a pre-determined time period has elapsed since the heartbeat file was updated. The respective second device may determine that a respective remote terminal between the first device and the respective second device has been terminated. Determining that the remote terminal has been terminated may indicate that the device is in an offline state. The respective second device may reset itself so as to transition the respective second device from the offline state to the online state. | 2016-06-09 |
20160162390 | ORTHOGONAL EXPERIMENTATION IN A COMPUTING ENVIRONMENT - Various embodiments include at least one of systems, methods, and software to receive input configuring tests within a computing environment to expose users to standard application or website experiences or test experiences. In some embodiments, multiple tests may be configured to run orthogonally within user experiences without affecting the results of one another. Some such embodiments preserve the ability to execute certain tests in anon-orthogonal manner while other tests are allowed to execute orthogonally. | 2016-06-09 |
20160162391 | APPLICATION DEVELOPMENT VIA A MULTI-UNIT DEVICE - Disclosed are various embodiments for systems and methods to provide to a processor unit over a network. The processor unit may be used for testing applications, debugging code, and/or any other job that may need processing. The processor unit does not include a particular peripheral device needed by an application being executed by the processor unit. Peripheral device data associated with the absent peripheral device may be sent to the processor unit by a computing device over a network. The processor unit may be monitored and any data generated may be reported. | 2016-06-09 |
20160162392 | Adaptive Framework Automatically Prioritizing Software Test Cases - An automated, self-adaptive framework prioritizes software testing in a consistent and effective manner. A metric evaluates past test execution information for assigning regression testing priority. The metric may be calculated with reference to one or more of the following factors taken in combination: requirement, coverage, history, and cost. The requirement factor considers customer-assigned priority of testing the code, complexity of implementing the code, and proneness of the code to faults. The coverage factor considers code coverage, feature coverage, and common usage rate. The history factor considers previous bug found rate, case stable rate, and priority to calculate. The cost factor considers test case execution time, and step length. A value of each factor for one test case is measured according to that test case and is not related to other test cases. The calculation result representing the metric for each test case determines a priority of the test case. | 2016-06-09 |
20160162393 | Testing Coordinator - A system for testing two or more applications associated with a computerized process may include a central repository, a user interface and a testing coordinator. The central repository may be used to store at least one test case each including a test data set and two or more sets of test scripts. The user interface may facilitate a selection of one or more test cases for use by the testing coordinator. The testing coordinator may be configured to test the operation of the computerized process by initiating testing of a first application by a first test tool using the test data set and a first set of scripts and initiating testing of the second application by the second test tool using the test data set and the second set of scripts from the selected test case. In some cases, the first test tool is incompatible with the second test tool. | 2016-06-09 |
20160162394 | SOFTWARE TESTING OPTIMIZER - In an approach for testing software, a computer receives a series of two or more revisions to a set of software code. The computer identifies modifications between the series of two or more revisions. The computer categorizes the series of two or more revisions into one or more categories of revisions based on the identified modifications. The computer tests at least one of the series of two or more revisions from at least one of the one or more categories of revisions. | 2016-06-09 |
20160162395 | SOFTWARE TESTING OPTIMIZER - In an approach for testing software, a computer receives a series of two or more revisions to a set of software code. The computer identifies modifications between the series of two or more revisions. The computer categorizes the series of two or more revisions into one or more categories of revisions based on the identified modifications. The computer tests at least one of the series of two or more revisions from at least one of the one or more categories of revisions. | 2016-06-09 |
20160162396 | UPDATING SOFTWARE - This invention relates to a method and apparatus for updating software. In particular this invention relates to a method, system and computer program for updating an operating system in a hypervisor comprising: determining a new version of a component of the operating system; installing the new component version; measuring an identifying characteristic of the component and making it available to an attestation system; notifying the attestation system that a component has been updated to a new version whereby, when the attestation system finds that the identifying characteristic of the new component does not match a pre-stored attestation value it is aware that a legitimate mis-match could have occurred. The installing of the new version of the component comprises: identifying an updater associated with new version of the component; measuring an identifying characteristic of the identified updater; loading and installing the new version of the component; and making both the identifying measurement of the updater and the new version of the component available to the attestation system. | 2016-06-09 |
20160162397 | Testing Coordinator - A system for testing two or more applications associated with a computerized process may include a central repository, a user interface and a testing coordinator. The central repository may be used to store at least one test case each including a test data set and two or more sets of test scripts. The user interface may facilitate a selection of one or more test cases for use by the testing coordinator. The testing coordinator may be configured to test the operation of the computerized process by initiating testing of a first application by a first test tool using the test data set and a first set of scripts and initiating testing of the second application by the second test tool using the test data set and the second set of scripts from the selected test case. In some cases, the first test tool is incompatible with the second test tool. | 2016-06-09 |
20160162398 | AUTOMATED TEST GENERATION AND EXECUTION FOR TESTING A PROCESS TO CONTROL A COMPUTER SYSTEM - User interactions with a computing system are sensed and recorded. The recording represents a process for controlling a computer system. The computer system actions that are taken based upon the sensed user interactions are also recorded. The recording is parsed and a test for testing the recorded process is generated and automatically executed from the recording. | 2016-06-09 |
20160162399 | SYSTEMS AND METHODS FOR PROVIDING IMPROVED LATENCY IN A NON-UNIFORM MEMORY ARCHITECTURE - Systems, methods, and computer programs are disclosed for allocating memory in a portable computing device having a non-uniform memory architecture. One embodiment of a method comprises: receiving from a process executing on a first system on chip (SoC) a request for a virtual memory page, the first SoC electrically coupled to a second SoC via an interchip interface, the first SoC electrically coupled to a first local volatile memory device via a first high-performance bus and the second SoC electrically coupled to a second local volatile memory device via a second high-performance bus; determining a free physical page pair comprising a same physical address available on the first and second local volatile memory devices; and mapping the free physical page pair to a single virtual page address. | 2016-06-09 |
20160162400 | ALIGNMENT BASED BLOCK CONCURRENCY FOR ACCESSING MEMORY - Embodiments relate to accessing data in a memory. A method for accessing data in a memory coupled to a processor is provided. The method receives a memory reference instruction for accessing data of a first size at an address in the memory. The method determines an alignment size of the address in the memory. The method accesses the data of the first size in one or more groups of data by accessing each group of data block concurrently. The groups of data have sizes that are multiples of the alignment size. | 2016-06-09 |
20160162401 | ALIGNMENT BASED BLOCK CONCURRENCY FOR ACCESSING MEMORY - Embodiments relate to accessing data in a memory. A method for accessing data in a memory coupled to a processor is provided. The method receives a memory reference instruction for accessing data of a first size at an address in the memory. The method determines an alignment size of the address in the memory. The method accesses the data of the first size in one or more groups of data by accessing each group of data block concurrently. The groups of data have sizes that are multiples of the alignment size. | 2016-06-09 |
20160162402 | INDIRECTLY ACCESSING SAMPLE DATA TO PERFORM MULTI-CONVOLUTION OPERATIONS IN A PARALLEL PROCESSING SYSTEM - In one embodiment of the present invention, a convolution engine configures a parallel processing pipeline to perform multi-convolution operations. More specifically, the convolution engine configures the parallel processing pipeline to independently generate and process individual image tiles. In operation, for each image tile, the pipeline calculates source locations included in an input image batch based on one or more start addresses and one or more offsets. Subsequently, the pipeline copies data from the source locations to the image tile. The pipeline then performs matrix multiplication operations between the image tile and a filter tile to generate a contribution of the image tile to an output matrix. To optimize the amount of memory used, the pipeline creates each image tile in shared memory as needed. Further, to optimize the throughput of the matrix multiplication operations, the values of the offsets are precomputed by a convolution preprocessor. | 2016-06-09 |
20160162403 | PROGRAMMING NON-VOLATILE MEMORY USING A RELAXED DWELL TIME - In at least one embodiment, a data storage system includes a non-volatile memory array including a plurality of blocks of physical memory, each including multiple pages. The data storage system further includes a controller that maintains a data structure identifying blocks of physical memory in the memory array that currently do not store valid data. The controller, responsive to receipt of a write input/output operation (IOP) specifying an address and write data, selects a particular block from among the blocks identified in the data structure prior to a dwell time threshold for the particular block being satisfied, programs a page within the selected block with the write data, and associates the address with the selected block. | 2016-06-09 |
20160162404 | MEMORY MODULE WITH LOCAL SYNCHRONIZATION - A memory module is operatable in a memory system with a memory controller. The memory module comprises a module control device to receive command signals from the memory controller and to output module C/A signals and data buffer control signals. The module C/A signals are provided to memory devices organized in groups, each group including at least one memory device, while the data buffer control signals are provided to a plurality of buffer circuits to control data paths in the buffer circuits, a respective buffer circuit corresponding to a respective group of memory devices. The plurality of buffer circuits are distributed across a surface of the memory module such that each data buffer control signal arrives at the plurality of buffer circuits at different points in time. The plurality of buffer circuits include clock regeneration circuits to regenerate a clock signal received from the module control device and to provide regenerated clock signals to respective groups of memory devices. | 2016-06-09 |
20160162405 | CACHING OF DATA IN DATA STORAGE SYSTEMS BY MANAGING THE SIZE OF READ AND WRITE CACHE BASED ON A MEASUREMENT OF CACHE RELIABILITY - A disk drive is disclosed that varies its caching policy for caching data in non-volatile solid-state memory as the memory degrades. As the non-volatile memory degrades, the caching policy can be varied such that the non-volatile memory is used more as a read cache and less as a write cache. Performance improvements and slower degradation of the non-volatile memory can thereby be attained. | 2016-06-09 |
20160162406 | Systems, Methods, and Apparatuses to Decompose a Sequential Program Into Multiple Threads, Execute Said Threads, and Reconstruct the Sequential Execution - Systems, methods, and apparatuses for decomposing a sequential program into multiple threads, executing these threads, and reconstructing the sequential execution of the threads are described. A plurality of data cache units (DCUs) store locally retired instructions of speculatively executed threads. A merging level cache (MLC) merges data from the lines of the DCUs. An inter-core memory coherency module (ICMC) globally retire instructions of the speculatively executed threads in the MLC. | 2016-06-09 |
20160162407 | MULTICORE, MULTIBANK, FULLY CONCURRENT COHERENCE CONTROLLER - This invention optimizes non-shared accesses and avoids dependencies across coherent endpoints to ensure bandwidth across the system even when sharing. The coherence controller is distributed across all coherent endpoints. The coherence controller for each memory endpoint keeps a state around for each coherent access to ensure the proper ordering of events. The coherence controller of this invention uses First-In-First-Out allocation to ensure full utilization of the resources before stalling and simplicity of implementation. The coherence controller provides Snoop Command/Response ID Allocation per memory endpoint. | 2016-06-09 |
20160162408 | PARALLEL DESTAGING WITH REPLICATED CACHE PINNING - Methods, apparatus and computer program products implement embodiments of the present invention that include identifying non-destaged first data in a write cache. Upon detecting second data in a master read cache, the second data is pinned to the master and one or more backup read caches. Using the first data stored in the write cache and the second data stored in the master read cache, one or more parity values are calculated, and the first data and the one or more parity values are destaged. | 2016-06-09 |
20160162409 | VIRTUAL MACHINE HOST SERVER APPARATUS AND METHOD FOR OPERATING THE SAME - A virtual machine host server includes a virtual machine in which a guest operating system is installed and operated, a cache manager for processing at least one of an open request, a close request, and an input/output request for a disk image file of the virtual machine, which is stored in a storage system, and managing a boot workload map and a boot segment, a cache device for caching the boot segment, and a prefetch manager for prefetching the boot segment from the cache device. | 2016-06-09 |
20160162410 | DEMOTE INSTRUCTION FOR RELINQUISHING CACHE LINE OWNERSHIP - A computer system processor of a multi-processor computer system having a cache subsystem, the computer system having exclusive ownership of a cache line, executes a demote instruction to cause its own exclusively owned cache line to become shared or read-only in the computer processor cache. | 2016-06-09 |
20160162411 | Invalidating a Range of Two or More Translation Table Entries and Instruction Therefore - An instruction is provided to perform invalidation of an instruction specified range of segment table entries or region table entries. The instruction can be implemented by software emulation, hardware, firmware or some combination thereof. | 2016-06-09 |
20160162412 | COMPLETION PACKET RETURN - A completion packet may be returned before a data packet is written to a memory, if a field of the data packet indicates the data packet was sent due to a cache capacity eviction. The completion packet is returned after the data packet is written to the memory, if the field indicates the data packet was sent due to a flush operation. | 2016-06-09 |
20160162413 | Application Startup Page Fault Management in a Hardware Multithreading Environment - A method, system and computer-usable medium are disclosed for startup page fault management improves application startup performance by assigning startup tasks to a hardware thread 0 across plural processing cores in a simultaneous multithreading environment to provide more rapid processing of processor bound page faults. I/O bound page faults are flagged to associated with predetermined cache locations to improve data and text first reference page-in I/O response. | 2016-06-09 |
20160162414 | CACHING AND DEDUPLICATION OF DATA BLOCKS IN CACHE MEMORY - Techniques for deduplicating data in cache memory include determining that a first data block stored in the cache memory matches a second data block stored in the cache memory. It is further determined that a number of accesses associated with at least one of the first data block or the second data block is equal to or greater than a threshold number of accesses. In response to determining that the number of accesses is equal to or greater than the threshold number of accesses, the first data block is deduplicated in the cache memory. | 2016-06-09 |
20160162415 | SYSTEMS AND METHODS FOR PROVIDING IMPROVED LATENCY IN A NON-UNIFORM MEMORY ARCHITECTURE - Systems, methods, and computer programs are disclosed for allocating memory in a portable computing device having a non-uniform memory architecture. One embodiment of a method comprises: receiving from a process executing on a first system on chip (SoC) a request for a virtual memory page, the first SoC electrically coupled to a second SoC via an interchip interface, the first SoC electrically coupled to a first local volatile memory device via a first high-performance bus and the second SoC electrically coupled to a second local volatile memory device via a second high-performance bus; determining whether a number of available physical pages on the first and second local volatile memory devices exceeds a minimum threshold for initiating replication of memory data between the first and second local volatile memory devices; and if the minimum threshold is exceeded, allocating a first physical address on the first local volatile memory device and a second physical address on the second local volatile memory device to a single virtual page address. | 2016-06-09 |
20160162416 | Apparatus and Method for Reducing Latency Between Host and a Storage Device - Described is a system comprising: a storage device; a bus; and a host apparatus including a host memory and a driver module, wherein the host apparatus is coupled to the storage device via the bus, wherein the driver module is operable to: retrieve a logical to physical address mapping from the host memory; and provide the logical to physical address mapping to the storage device via the bus along with a read or write operation request. Described is a method comprising: retrieving a logical to physical address mapping from a host memory; and providing the logical to physical address mapping to a storage device via a bus along with a read or write operation request. Described is a machine readable storage medium having instructions stored thereon that, when executed, cause a machine to perform the method described above. | 2016-06-09 |
20160162417 | STORING DATA IN A SERVER COMPUTER WITH DEPLOYABLE ENCRYPTION/DECRYPTION INFRASTRUCTURE - For storing data in a data-storage structure of a server computer, an infrastructure is deployed to a server computer. The infrastructure has a forwarder module to receive data from an application and to identify a data portion, a crypto module to encrypt the data portion with a key and key control module adapted to generate and to store the key. The infrastructure is also able to process data in the opposite direction. The key is provided into the key control module upon receiving a key trigger from the client computer. | 2016-06-09 |
20160162418 | INFORMATION PROCESSING APPARATUS CAPABLE OF BACKING UP AND RESTORING KEY FOR DATA ENCRYPTION AND METHOD FOR CONTROLLING THE SAME - An information processing apparatus includes a storage device configured to store data, an encryption chip configured to store an encryption key therein, a nonvolatile memory configured to store a backup encryption key, and a control unit configured to confirm whether the data stored in the storage device has been correctly decrypted by using the encryption key, and when the data has not been correctly decrypted, restore the backup encryption key to the encryption chip, and when the data has been correctly decrypted, back up the backup encryption key, which is a backup of the encryption key, stored in the encryption chip into the nonvolatile memory. | 2016-06-09 |
20160162419 | Methods and Systems for Protecting Data in USB Systems - The various embodiments described below are directed to providing authenticated and confidential messaging from software executing on a host (e.g. a secure software application or security kernel) to and from I/O devices operating on a USB bus. The embodiments can protect against attacks that are levied by software executing on a host computer. In some embodiments, a secure functional component or module is provided and can use encryption techniques to provide protection against observation and manipulation of USB data. In other embodiments, USB data can be protected through techniques that do not utilized (or are not required to utilize) encryption techniques. In accordance with these embodiments, USB devices can be designated as “secure” and, hence, data sent over the USB to and from such designated devices can be provided into protected memory. Memory indirection techniques can be utilized to ensure that data to and from secure devices is protected. | 2016-06-09 |
20160162420 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND RECORDING MEDIUM - A deletion instruction of data stored in a nonvolatile memory is input, a determination is made whether the nonvolatile memory has reached an end of its rewrite operating life in accordance with the input deletion instruction, an instruction for setting a password to the nonvolatile memory is accepted when it is determined that the nonvolatile memory has reached the end of its rewrite operating life, and the password is set to the nonvolatile memory in accordance with the accepted instruction. | 2016-06-09 |
20160162421 | LTR/OBFF DESIGN SCHEME FOR ETHERNET ADAPTER APPLICATION - A method of reducing power consumption in a computing platform is disclosed. An endpoint-device that is coupled to the computing platform includes a first data buffer and a second data buffer. The first data buffer buffers outgoing data to be transmitted to an external device via a first communications medium. The second data buffer buffers incoming data received from the external device via the first communications medium. At least one of the first or second data buffers may selectively communicate with the computing platform, via a second communications medium, during an active window of the other data buffer. The active window may be requested by the first and/or second data buffers based, at least in part, on a system idle signal. For some embodiments, the first communications medium is an Ethernet link. Further, for some embodiments, the second communications medium is a Peripheral Component Interconnect Express (PCIe) link. | 2016-06-09 |