Abstract: A technique to enable secure application and data integrity within a computer system. In one embodiment, one or more secure enclaves are established in which an application and data may be stored and executed.

Abstract: A technique to enable secure application and data integrity within a computer system. In one embodiment, one or more secure enclaves are established in which an application and data may be stored and executed.

Abstract: A technique to enable secure application and data integrity within a computer system. In one embodiment, one or more secure enclaves are established in which an application and data may be stored and executed.

Abstract: A technique to enable secure application and data integrity within a computer system. In one embodiment, one or more secure enclaves are established in which an application and data may be stored and executed.

Abstract: A technique to enable secure application and data integrity within a computer system. In one embodiment, one or more secure enclaves are established in which an application and data may be stored and executed.

Abstract: A technique to enable secure application and data integrity within a computer system. In one embodiment, one or more secure enclaves are established in which an application and data may be stored and executed.

Abstract: Methods and apparatus are disclosed to boot a basic input/output system (BIOS) for a partitioned platform. An example method disclosed herein identifies at least one hardware component unique to a partition, determines which hardware components have commonality with the partition, initializes the at least one hardware component having commonality, and initializes the at least one hardware component unique to the partition. Other embodiments are described and claimed.

Abstract: Methods and apparatus are disclosed to boot a basic input/output system (BIOS) for a partitioned platform. An example method disclosed herein identifies at least one hardware component unique to a partition, determines which hardware components have commonality with the partition, initializes the at least one hardware component having commonality, and initializes the at least one hardware component unique to the partition. Other embodiments are described and claimed.

Abstract: A destructive-read memory is one that the process of reading the memory causes the contents of the memory to be destroyed. Such a memory may be used in devices that are intended to acquire data that may have associated usage restrictions, such as an expiration date, usage count limit, or data access fee for the acquired data. Typically, to enforce usage restrictions, and protect against theft, complex and often costly security techniques are applied to acquired data. With destructive-read memory, complex and costly security is not required for stored data. In one embodiment, a write-back mechanism, which may employ security, is responsible for enforcing usage restrictions. If the write-back mechanism determines continued access to acquired data is allowed, then it writes back the data as it is destructively read from the memory.

Abstract: A method and apparatus for preserving the processing order of some requests in a system is disclosed. The method may include blocking requests from executing based on a blocked count data field, blocking list data field, and a last request data field. The apparatus may include a system or a memory device.

Abstract: A method includes establishing two partitions, including a first partition and a second partition, in a computer system. The method further includes designating a first memory page in memory space controlled by the first partition, designating a second memory page in memory space controlled by the second partition, storing an address of the first memory page in an address mapping array that is accessible by the first partition and storing an address of the second memory page in an address mapping array that is accessible by the second partition. In addition, the method includes exchanging the address of the first memory page in the address mapping array that is accessible by the first partition with the address of the second memory page in the address mapping array that is accessible by the second partition.

Abstract: A computing system having expansion modules. One of the expansion modules is identified as a master module. The other modules act as slaves to the master module. The central processing unit routes a task to either the master module for portioning out or to all of the expansion modules. The master module then receives completion signals from all of the active slave modules and then provides only one interrupt to the central processing unit for that task.

Abstract: This invention relates to a method and apparatus for assessing quality of service for communication networks. More particularly, the invention is directed to assessing quality of service in circuit and packet switched networks by way of a computer simulation. Preferably, the information necessary to conduct the assessment activity is available via the internet from a web server that also compiles statistical data on the resultant quality of service assessments.

Abstract: In some embodiments, a method to minimize memory bandwidth usage in optimal disk transfers is presented. In this regard, a transfer agent is introduced to read a plurality of contiguous sections of a mass storage device in a single operation, and to transfer data from fewer than all the sections read. Other embodiments are also disclosed and claimed.

Abstract: Embodiments of abstracted dynamic addressing are generally described herein. Other embodiments may be described and claimed.

Abstract: Memory cells, such as polymer memory cells, that are prone to imprinting, may be refreshed. In addition, if despite periodic refreshing, the cells become imprinted anyway, this may be detected and counter measures taken to prevent adverse consequences.

Abstract: Processor-based systems may include a disk cache to increase system performance in a system that includes a processor and a disk drive. The disk cache may include physical cache lines and virtual cache lines to improve cache insertion and eviction policies. The virtual cache lines may also be useful when recovering from failed requests.

Abstract: A disk cache may include a volatile memory such as a dynamic random access memory and a nonvolatile memory such as a polymer memory. When a cache line needs to be allocated on a write, the polymer memory may be allocated and when a cache line needs to be allocated on a read, the volatile memory may be allocated.

Abstract: In one embodiment, the present invention includes a method for writing data to a disk if inserting the data into a cache, such as a disk cache associated with the disk, would cause a threshold of dirty data in the cache to be met or exceeded. Further, in certain embodiments, the cache may store data according to a first cache policy and a second cache policy. A determination of whether to store data according to the first or second policies may be dependent upon an amount of dirty data in the cache, in certain embodiments. In certain embodiments, the cache may include at least one portion reserved for clean data.

Abstract: In one embodiment of the present invention, a method may include determining whether requested information is part of a streaming access, and directly writing the requested information from a storage device to a memory if the requested information is part of the streaming access. Alternately, if the requested information is not part of the streaming access, it may be written from the storage device to a cache. In various embodiments, the cache may be a non-volatile disk cache.