Abstract: A request to write new data to a file is received. The file occupies a pre-determined size of storage space in a file-system. A determination is made whether an end location amount of space from an ending location value in an attribute up to the pre-determined size is insufficient to write the new data to the file. A second amount of space is computed. The first and the second amounts of space together are sufficient to write the new data. The second amount of space begins at a starting location value in a starting location attribute. The new data is written using the first and the second amounts of space. The ending location value is changed to indicate a location at the end of new data in the second amount of space. The starting location value is changed to indicate a location where existing data begins after new data.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A request to write new data to a file is received. The file occupies a pre-determined size of storage space in a file-system. A determination is made whether an end location amount of space from an ending location value in an attribute up to the pre-determined size is insufficient to write the new data to the file. A second amount of space is computed. The first and the second amounts of space together are sufficient to write the new data. The second amount of space begins at a starting location value in a starting location attribute. The new data is written using the first and the second amounts of space. The ending location value is changed to indicate a location at the end of new data in the second amount of space. The starting location value is changed to indicate a location where existing data begins after new data.

Abstract: Some embodiments of the inventive subject matter are directed to performing sub-transactions from a long-lived transaction using an identifier, wherein the sub-transactions are required to be completed in a sequence for the long-lived transaction. In some embodiments, the method is further directed to determining that the sub-transactions require a write of a data value to a database, writing in a log, using the identifier, an entry that indicates the data value, detecting an interruption in performing of the write of the data value to the database, and initiating re-performance of the sub-transactions in order of the sequence. Some embodiments are further directed to, during re-performance of the sub-transactions, detecting the data value in the entry of the log using the identifier, and using the data value indicated in the entry of the log to write the data value to the database.

Abstract: An approach for improving input/output control and efficiency in an encrypted file system (EFS) is provided. In this approach, a software application writes data to a first buffer and then requests that an encrypted file system save the data onto a nonvolatile storage device. The encrypted file system encrypts the data and stores the encrypted data in a second buffer and then writes the encrypted data from the second buffer to the nonvolatile storage area. Meanwhile, the software application is able to resume writing additional data to the buffer after the data has been copied to the second buffer even if the data has not yet been written to the nonvolatile storage area.

Abstract: Some embodiments of the inventive subject matter are directed to performing sub-transactions of a long-lived transaction (LLT) in a sequence (e.g., according to an LLT flow) and writing a log entry at the performance of each of the sub-transactions that specifies results of the sub-transaction. Some embodiments do not require generating any compensating transactions during performance of the sub-transactions. Some embodiments are further directed to detecting that an interruption occurs to the LLT and repeating, or initiating re-performance of the LLT from the beginning of the sequence following the flow of the LLT from its beginning. During the re-performance of the LLT, some embodiments are further directed to checking the log entry at each sub-transaction to determine whether the sub-transaction was performed successfully before the interruption.

Abstract: Illustrative embodiments disclose shrinking a file system in a data processing system by designating an amount by which the file system stored in a memory and comprised of a plurality of contiguous logical blocks is to be shrunk. At least one contiguous intermediate logical block of the plurality of contiguous logical blocks from the file system is removed to shrink the file system by the designated amount. A record is maintained indicating a first intermediate logical block of the at least one contiguous intermediate logical block at which the removing starts, and a last intermediate logical block of the at least one contiguous intermediate logical block at which the removing ends.

Abstract: Some embodiments of the inventive subject matter are directed to performing sub-transactions of a long-lived transaction (LLT) in a sequence (e.g., according to an LLT flow) and writing a log entry at the performance of each of the sub-transactions that specifies results of the sub-transaction. Some embodiments do not require generating any compensating transactions during performance of the sub-transactions. Some embodiments are further directed to detecting that an interruption occurs to the LLT and repeating, or initiating re-performance of the LLT from the beginning of the sequence following the flow of the LLT from its beginning. During the re-performance of the LLT, some embodiments are further directed to checking the log entry at each sub-transaction to determine whether the sub-transaction was performed successfully before the interruption.

Abstract: An approach for improving input/output control and efficiency in an encrypted file system (EFS) is provided. In this approach, a software application writes data to a first buffer and then requests that an encrypted file system save the data onto a nonvolatile storage device. The encrypted file system encrypts the data and stores the encrypted data in a second buffer and then writes the encrypted data from the second buffer to the nonvolatile storage area.

Abstract: Computer implemented method, system and computer program product for shrinking a file system in a data processing system. A computer implemented method for shrinking a file system in a data processing system includes designating an amount by which a file system comprised of a plurality of contiguous blocks is to be shrunk, and removing at least one contiguous intermediate block of the plurality of contiguous blocks from the file system to shrink the file system by the designated amount.

Abstract: Computer implemented method, system and computer program product for shrinking a file system in a data processing system. A computer implemented method for shrinking a file system in a data processing system includes designating an amount by which a file system comprised of a plurality of contiguous blocks is to be shrunk, and removing at least one contiguous intermediate block of the plurality of contiguous blocks from the file system to shrink the file system by the designated amount.

Abstract: A method for capturing the state of a running computer system for the purpose of performing debugging or some other analysis involves registering a user-customized filter function with the computer system's kernel, passing internal objects in the computer system through the filter-function, and capturing only internal objects satisfying the filter function. The filter function filters one or more categories of internal objects in a single serialized pass and is installed into a kernel extension, the kernel extension comprises a module capable of being loaded onto and unloaded from a running computer system, and the kernel is programmed to capture internal objects in the computer system.

Abstract: Computer implemented method, system and computer program product for shrinking a file system in a data processing system. A computer implemented method for shrinking a file system in a data processing system includes designating an amount by which a file system comprised of a plurality of contiguous blocks is to be shrunk, and removing at least one contiguous intermediate block of the plurality of contiguous blocks from the file system to shrink the file system by the designated amount.