Abstract: One embodiment of the present invention sets forth a technique for dynamically allocating memory using one or more lock-free pop-only FIFOs. One or more lock-free FIFOs are populated with FIFO nodes, where each FIFO node represents a memory allocation of a predetermined size. Each particular lock-free FIFO includes memory allocations of a single size. Different lock-free FIFOs may include memory allocations for different sizes to service allocation requests for different size memory allocations. A lock-free mechanism is used to pop FIFO nodes from the FIFO. The use of the lock-free FIFO allows multiple consumers to simultaneously attempt to pop the head FIFO node without first obtaining a lock to ensure exclusive access of the FIFO.

Abstract: A system, method, and computer program product are provided for saving and restoring a compression-decompression state. In operation, data is processed, the processing including compressing or decompressing the data. Additionally, a state of the processing is saved. Further, the state of the processing is restored.

Abstract: A dynamic DMA window mechanism can resize DMA windows dynamically by increasing one DMA window at the expense of reducing a neighboring DMA window. The dynamic DMA window mechanism can decide to dynamically resize DMA windows based on a request from a system administrator, based on a request by an operating system device driver for an I/O adapter, or based on a performance monitor determining such a resizing would benefit system performance. Once one DMA window has been increased by allocating a portion of a donor DMA window, device drivers for the I/O devices corresponding to the two windows are updated to reflect the new DMA window sizes.

Abstract: Embodiments of the invention provide a method and system for dynamic memory management implemented in hardware. In an embodiment, the method comprises storing objects in a plurality of heaps, and operating a hardware garbage collector to free heap space. The hardware garbage collector traverses the heaps and marks selected objects, uses the marks to identify a plurality of the objects, and frees the identified objects. In an embodiment, the method comprises storing objects in a heap, each of at least some of the objects including a multitude of pointers; and operating a hardware garbage collector to free heap space. The hardware garbage collector traverses the heap, using the pointers of some of the objects to identify others of the objects; processes the objects to mark selected objects; and uses the marks to identify a group of the objects, and frees the identified objects.

Abstract: Systems and methods for thread-based memory management may include activating a processing thread. The memory may include a first region and a second region with the first region having several segments. A segment of memory may be allocated for the processing thread. Data associated with an object may be stored in the segment. At the end of processing by the processing thread, a garbage collection process may be performed by the processing thread on the segment allocated to the processing thread.

Abstract: A plurality of storage apparatuses including a first and second storage apparatus, wherein said first storage apparatus is configured to have a first virtual volume composed of a plurality of virtual segments, at least said second storage apparatus is configured to have a pool composed of a plurality of real pages, each storage apparatus is configured to manage a virtual pool comprising one or more pools including at least said pool, said virtual pool is composed of a plurality of virtual pages, each virtual page corresponding to any real page, and said first storage apparatus is configured to receive a write command that specifies an address belonging to an unallocated virtual segment, allocate a free virtual page to said unallocated virtual segment, and write data to the real page corresponding to the allocated virtual page, even when said first storage apparatus does not have a pool composed of real pages.

Abstract: In a storage system, a real page is allocated from a pool to a write destination virtual page in a virtual volume. The real page includes multiple real regions. The storage system moves all valid data stored in two or more move-source real pages respectively allocated to two or more virtual pages, to move-destination real pages the number of which is less than the number of move-source real pages in units of real regions. Each piece of valid data can be used by any one of the access sources. The storage system writes the predetermined data to all move-source real regions in each of move-source real pages, so that each of the move-source real pages is set as a recovery target real page which is a real page storing only the predetermined data, and performs real capacity recovery for making each recovery target real page into an unallocated state.

Abstract: A method of writing data includes receiving a data page to be stored in a data storage device and initiating an encode operation to encode the data page. The encode operation generates first encoded data and a first portion of the first encoded data is stored to the first physical page of the data storage device. The method includes initiating storage of a second portion of the first encoded data to a second physical page of the data storage device. The method also includes initiating a decode operation to recover the data page. The decode operation uses a representation of the first portion of the first encoded data that is read from the first physical page without using any data from the second physical page.

Abstract: An unused free memory shortage relative to an adjusted heap maximum size associated with a memory heap of application memory is detected. The adjusted heap maximum size is set to a heap size smaller than a maximum heap allocation size. An increase to the adjusted heap maximum size that resolves the unused free memory shortage is calculated. The adjusted heap maximum size is increased by the calculated increase to the adjusted heap maximum size.

Abstract: Described is using flash memory, RAM-based data structures and mechanisms to provide a flash store for caching data items (e.g., key-value pairs) in flash pages. A RAM-based index maps data items to flash pages, and a RAM-based write buffer maintains data items to be written to the flash store, e.g., when a full page can be written. A recycle mechanism makes used pages in the flash store available by destaging a data item to a hard disk or reinserting it into the write buffer, based on its access pattern. The flash store may be used in a data deduplication system, in which the data items comprise chunk-identifier, metadata pairs, in which each chunk-identifier corresponds to a hash of a chunk of data that indicates. The RAM and flash are accessed with the chunk-identifier (e.g., as a key) to determine whether a chunk is a new chunk or a duplicate.

Abstract: Disclosed are various embodiments for making publisher content available to specific users. A directory describing media items that are remotely stored is presented via a user interface. Selection information corresponding to a particular media item is received via the user interface. The media item is requested and received from another computing device. Consumption data is collected during consumption of the media item. The consumption data is sent to another computing device.

Abstract: One embodiment includes a programmable memory controller. The programmable memory controller includes a request processor that comprises a first domain-specific instruction set architecture (ISA) for accelerating common requests. A transaction processor comprises a second domain-specific ISA for accelerating transaction processing tasks. A dedicated command logic module inspects each memory command to a memory device and stalls particular commands for meeting timing constraints for application specific control of the memory device.

Abstract: A system and method for choosing a stream to transfer data is described. In some cases, the system reviews running data storage operations and chooses a data stream based on the review. Additionally, the system pre-allocates disk space for data to be transferred.

Abstract: Techniques for evicting cached files may be realized as a method including: maintaining a file system cache storing selected files from a file storage; for files that are above a threshold size, selectively storing chunks of the files; for each file that is stored, associating an access bit and a size bit with that file; for each file that is stored selectively as file chunks, associating an access bitmap to the file having an access bit associated with each file chunk; when a file is accessed, setting the access bit associated with the file and file chunk to indicate recent access; at set intervals, periodically clearing the access bits to not indicate recent access; and carrying out a cache eviction process comprising evicting at least one file or file chunk associated with an access bit that does not indicate recent access.

Abstract: In the present invention, when configuration data art a LFS (Log-Structured File system) is stored on a virtual volume constructed from a plurality of Storage mediums, a temporal change of the file size on the file system is roughly estimated. Then, in accordance with the change, a capacity that is needed on the virtual volume is provided, a cursor at the end of a log is set, and a write cursor for writing data is set so as to avoid the position behind the cursor at the end of the log. Accordingly, it is possible to, when the LFS occupies only a small area on the virtual volume, avoid early execution of the allocation of an available capacity, and thus avoid a circumstance in which a large number of storage mediums are needed at an early stage of the operation of the virtual volume (see FIG. 1).

Abstract: A method and apparatus for managing a memory in a portable terminal including a main memory, a secondary memory, and a plurality virtual machines allocated by partitioning the main memory are provided. The method includes generating, by the virtual machines, monitoring information by monitoring access to the main memory and the secondary memory and swapping out with respect to the secondary memory; determining memory allocation amounts for each of the virtual machines by using the monitoring information; and allocating the main memory to the virtual machines in a partitioning scheme based on the determined memory allocation amounts.

Abstract: A solid state disk controller apparatus comprises a first port; a second port having a plurality of channels; a central processing unit connected to a CPU bus; a buffer memory configured to store data to be transferred from the second port to the first port and from the first port to the second port; a buffer controller/arbiter block connected to the CPU bus and configured to control read and write operations of the buffer memory based on a control of the central processing unit; a first data transfer block connected between the first port and the buffer controller/arbiter block and configured to transfer data to be stored/read in/from the buffer memory bypassing the CPU bus; and a second data transfer block connected between the second port and the buffer controller/arbiter block and configured to transfer data to be stored/read in/from the buffer memory bypassing the CPU bus.

Abstract: The use history recording unit records a history of use of a memory area of a user as a state of use whenever the user stores data. The use frequency calculation unit calculates a use frequency of the memory area for every user based on the state of use of the memory area of the user. The remained capacity allocation unit allocates the remained memory capacity in proportion to the use frequency.

Abstract: Aspects of the subject matter described herein relate to storage allocation. In aspects, a hierarchical data structure is used to track allocation data for storage managed by a file system. The hierarchical data structure may have multiple levels with each level having data regarding a different granularity of storage. Portions of the hierarchical data structure may be locked independently of other portions of the hierarchical data structure. The hierarchical data structure may indicate that one or more portions of storage are for exclusive use by a directory. Extra space may be reserved in allocated space in anticipation of subsequent operations. Allocation requestors may obtain storage allocation from regions associated with different levels of the hierarchical data structure.

Abstract: The computer system, during the course of executing an operation of dynamically allocating a storage area to a virtual volume in response to an access from a host system, detects where a balance of a storage capacity among a plurality of logical areas is disrupted, and subsequently moves a storage area among a plurality of logical areas to maintain balance of the storage capacity.

Abstract: A system, and computer usable program product for expanding memory size are provided in the illustrative embodiments. A desired size of an expanded memory and a first information about a workload in the data processing system are received. A size of a compressed memory pool to use with the memory to make the desired size of the expanded memory available is computed. A representation of the memory is configured, the representation of the memory appearing to be of a size larger than the size of the memory, the representation of the memory being the expanded memory, and the size of the representation being the size of the expanded memory. The expanded memory is made available such that the memory in the data processing system is usable by addressing the expanded memory.

Abstract: Methods, systems, and computer programs manage memory of a runtime environment executing on a virtual machine. A controller acts as an intermediary layer between the runtime environment and outside clients. The runtime environment coordinates with the controller to “hibernate” during idle periods to more efficiently utilize memory, and to quickly “refresh” state upon receiving an access attempt. A hypervisor may perform memory page compression on one or more guest “physical” memory pages utilized by an idle runtime environment. While hibernating, the runtime environment may use a listener thread to monitor for refresh requests and awaken the runtime environment when needed.

Abstract: Methods of encoding and decoding for video data are described for encoding or decoding multi-level significance maps while enabling pipelining of the BAC engine. In one example, coefficient groups are redefined to remove the significant-coefficient flags of the first and last position of a block and replace them with significant-coefficient flags of the last position in the previous block and the first position in the next block. A modified scan order is applied to each coefficient group. In another example, the coefficient groups remain block-based, but the scan order is modified to interleave the encoding and decoding sequential coefficient groups.

Abstract: A computing apparatus configured to determine account numbers of account holders, determine merchant identifiers used to identify respective merchants in authorization requests for transactions between the respective merchants and the account holders, monitor transactions processed by a transaction handler to detect first transactions between the merchants and the account holders, and transmit information about each of the first transactions to a remote computing device in real time as the transaction handler processes the authorization of the respective detected transaction.

Abstract: A Flash based memory comprising a Flash translation layer which comprises first translation information associating a first logical address of a logical file system emulating a sectored storage medium, the logical address being a logical sector start address with a first physical address of said flash based memory. The logical file system comprises a number of logical stuffing bits expanding a logical size of data of a file stored in said Flash based memory such that the expanded logical size corresponds to an integer number of logical sectors and the Flash translation layer comprises second translation information associating a second logical address with a second physical address and depending on said number of logical stuffing bits, the file being stored in a contiguous physical address sequence starting at the first physical address and ending at the second physical address.

Abstract: Described embodiments process hash operation requests of a network processor. A hash processor determines a job identifier, a corresponding hash table, and a setting of a traversal indicator for a received hash operation request that includes a desired key. The hash processor concurrently generates a read request for a first bucket of the hash table, and provides the job identifier, the key and the traversal indicator to a read return processor. The read return processor stores the key and traversal indicator in a job memory and stores, in a return memory, entries of the first bucket of the hash table. If a stored entry matches the desired key, the read return processor determines, based on the traversal indicator, whether to read a next bucket of the hash table and provides the job identifier, the matching key, and the address of the bucket containing the matching key to the hash processor.

Abstract: Described are techniques for performing data compression. Input data is received. A plurality of stop symbols is inserted at predetermined positions between portions of said input data. A block sorting transform on said input data is performed that generates a first intermediate output. The block sorting transform is performed by executing code on a graphic processing unit that processes portions of said input data in parallel. Subsequent processing of the intermediate output is performed to generate compressed data.

Abstract: A method and arrangement for processing data when training a data model involving multiple iterations of data records in a dataset (400c, 606) stored in a database (400, 600). Memory space (400d, 608) is allocated in the database for maintaining the data model during the training operation. The data records in the dataset are read (4:3) directly from the database for each iteration, and the data model is trained (4:4) inside the database by repeatedly applying the read data records in the training operation and updating (4:5) the data model. It is also checked (4:6) whether the updated data model has converged according to a predefined convergence condition. The data model is eventually saved (4:7) once the data model has converged.

Abstract: Mechanisms are provided for automatically expanding a virtual storage of a virtual machine. The virtual machine monitors a usage of the virtual storage of the virtual machine. The virtual machine determines, based on the monitoring of the usage of the virtual storage, whether to expand the virtual storage of the virtual machine. In response to the virtual machine determining to expand the virtual storage of the virtual machine, a virtual machine manager executes one or more operations to expand the virtual storage. The monitoring and determining may be performed by a virtual storage management agent executing within the virtual machine and which may send an expansion request to an authorization engine to request expansion of the virtual storage.

Abstract: Aspects of the invention are provided to support partial file caching on a file system block boundary. All read requests are converted so that offset and count are aligned on a block boundary. Data associated with read requests is first satisfied from local cache, with cache misses supported with a call to persistent or remote system. Similarly, for a write request, any partial blocks are aligned to the block boundary. Data associated with the write request is performed on local cache and placed in a queue for replay to the persistent or remote system.

Abstract: In a device for managing data buffers in a memory space distributed over a plurality of memory elements, the memory space is allocatable by memory pages, each buffer including one or more memory pages. The buffers are usable by at least one processing unit for the execution of an application, the application being executed by a plurality of processing units executing tasks in parallel. The memory elements are accessible in parallel by the processing units. The device includes means for allocating buffers to the tasks during the execution of the application and means for managing access rights to the buffers. The means for managing the access rights to the buffers include means for managing access rights to the pages in a given buffer, to verify that writing to a given page does not modify data currently being read from the page or that reading from a given page does not access data currently being written to the page, in such a way as to share the buffer between unsynchronized tasks.

Abstract: A bitmask array is implemented as a two dimensional bit array where each bit represents an allocated/free cell of the heap. Groups of bits of the bitmask array are assigned to implement commonly sized memory cell allocation requests. The heap manager keeps track of allocations by keeping separate lists of which groups are being used to implement commonly sized memory cell allocations requests by maintaining linked lists according to the number of cells allocated per request. Each list contains a list of the bit groups that have been used to provide allocations for particularly sized requests. By maintaining lists based on allocation size, the heap manager is able to cause new allocation requests to be matched up with previously retired allocations of the same size. Memory may be dynamically allocated between lists of differently sized memory requests.

Abstract: A device and method are provided for managing flash memory of an intelligent electronic device (IED) to maximize the IED life. The IED includes at least one sensor for sensing at least one electrical parameter distributed to a load. At least one analog-to-digital converter is coupled to the at least one sensor for converting an analog signal output from the at least one sensor to digital data. A processing unit is coupled to the at least one analog-to-digital converter to receive the digital data and store the digital data in a memory. The memory includes sectors configured to store the digital data. The processing unit stores the digital data in each of the sectors and equalizes usage of each sector over time by equalizing a number of erases for each of the sectors over time.

Abstract: In the computer system, a storage system provides a storage level virtual volume based on thin provisioning technology, to a physical server on which a virtual machine is defined. The storage system releases the area of the logical volume corresponding to the storage level virtual volume accessed by a virtual machine which is specified to be deleted, on the basis of storage level virtual volume conversion information which is managed by the storage system.

Abstract: A mechanism is provided in a storage device for performing a write operation. The mechanism configures a write buffer memory with a plurality of write buffer portions. Each write buffer portion is dedicated to a predetermined block size category within a plurality of block size categories. For each write operation from an initiator, the mechanism determines a block size category of the write operation. The mechanism performs each write operation by writing to a write buffer portion within the plurality of write buffer portions corresponding to the block size category of the write operation.

Abstract: A memory heap is allocated to a contiguous range of memory. One end of the heap is designated as a small object area. The other end of the heap is designated as a large object area. When the two object areas grow, the small object area grows inward within the heap toward the large object area, and the large object area grows inward within the heap toward the small object area.

Abstract: Activity level of memory pages is classified in virtual machine environment, so that processes such as live VM migration and checkpointing, among others, can be carried out more efficiently. The method includes the steps of scanning page table entries of hypervisor-managed page tables continuously over repeating scan periods to determine whether memory pages have been accessed or not, and for each memory page, determining an activity level of the memory page based on whether the memory page has been accessed or not since a prior scan and storing the activity level of the memory page. The activity level of the memory page may be represented by one or more bits of its page table entry and may be classified as having at least two states ranging from hot to cold.

Abstract: An electronic apparatus includes a memory control part that carries out allocation and deallocation of a memory area in a memory space; a memory reorganization part that carries out a reorganization process of moving the memory area allocated by the memory control part and creating a contiguous free space in the memory space; and a reorganization control part that causes the reorganization part to carry out the reorganization process in a case where a first predetermined condition is met, and does not cause the reorganization part to carry out the reorganization process in a case where a second predetermined condition different from the first predetermined condition is met.

Abstract: An adaptive guard band for a ramp load/unload device is disclosed to provide extended data storage. In illustrated embodiments, an adaptive guard band algorithm is configured to format one or more discs or media having a lower capacity device with the adaptive guard band and extended data zone utilizing capacity measurements. The algorithm formats the media to provide a track zero at a first cylinder if the capacity is at or above the threshold capacity and a second cylinder if the capacity is below the threshold capacity to provide the extended data storage zone. A size or width of the extended data zone is variable to provide additional capacity to meet the threshold capacity.

Abstract: A storage device includes: a temporary buffer for sequentially storing data configuring a file requested to be written for every reception from outside; a data writing means for immediately separating the data in the temporary buffer into mutually corresponding data portion and marker portion classified by preset criteria and storing into a data storing means in an associated state, and deleting from the temporary buffer; an unseparated data writing means for storing the data that cannot be separated into the data portion and the marker portion among the data in the temporary buffer, into an unseparated data storing means; and a re-separation processing means for separating the data in the unseparated data storing means into the data portion and the marker portion by preset criteria and storing into the data storing means with the data portion and the marker portion associated, and deleting from the unseparated data storing means.

Abstract: Embodiments of the invention relate to optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity. An exemplary embodiment includes reserving a predetermined number of storage allocation regions for each node in a cluster, wherein each storage allocation region comprises a set of contiguous data blocks on a single storage disk of locally attached storage; using a contiguous set of data blocks on a single storage disk of locally attached storage as a file system's block allocation granularity for striping data to be stored in the file system for a compute operation in the cluster; and using a single data block of a shared storage subsystem as the file system's block allocation granularity for striping data to be stored in the file system for a data access operation in the cluster.

Abstract: Methods facilitate data streaming in bulk storage devices by generating linked lists containing entries for both user data and metadata. These linked lists containing mixed data types facilitate receiving and outputting user data, and to insert or ignore, respectively, metadata corresponding to that user data without interrupting flow of the user data.

Abstract: A method used in an access module that uses a file system to manage a nonvolatile memory of an information recording module enables an available storage space to be calculated in a short time before file data is recorded, and shortens the time required from initialization of the file system to recording. An access module (1) manages information about area management of the file system configured in an information recording module in units of fixed-length blocks. A divisional available storage space calculation unit (103) performs an available storage space calculation process in units of the fixed-length blocks, and completes preparations for recording when detecting a minimum required storage space for recording file data and enables recording of the file data. This shortens the time required from initialization of the file system to recording.

Abstract: A high availability system in a cloud computing environment includes a snapshot manager disposed in a mirror environment having at least one computer server and a plurality of virtual machines disposed in a production environment. Each of the plurality of virtual machines includes a snapshot agent configured to perform a method. The method includes periodically taking snapshots of the virtual machine associated with the snapshot agent, determining a delta image based on a change between a current snapshot and a previous snapshot, removing previous snapshots in the virtual machine and transmitting the delta image to the snapshot manager. The snapshot manager is configured to store a recovery image for each of the plurality of virtual machines and to merge the received delta image with the recovery image to update the recovery image.

Abstract: Dynamic allocation of memory in a hybrid system is provided. In particular, a method and system is provided to leverage a hybrid infrastructure for dynamic memory allocation and persistent file storage. The method includes dynamically allocating a file or its part or to cache a file or its part between different storage technologies and respective memory technologies in a hybrid infrastructure.

Abstract: Data records of a data set can be stored in a plurality of main part fragments retained in on-disk storage. A size of the data set can be compared to an available size of main system memory. All of the plurality of main part fragments can be fully loaded into the main system memory when the available size of the main system memory is larger than the size of the data set. Alternatively, one or more of the of main part fragments can be paged into the main system memory on demand in response to a data access request when the available size of the main system memory is smaller than the size of the data set and the data access request can be satisfied by providing access to a subset of the main part fragments, or access can be provided directly to the on-disk main part fragments when the data access request involves random access for projection in the data set and the available size of the main system memory is smaller than the size of the data set.

Abstract: An example method of managing memory for an application includes identifying a plurality of regions of a heap storing one or more objects of a first type and one or more objects of a second type. Each object of the second type stores a memory address of an object of the first type. The method also includes selecting a set of target collection regions of the heap. The method includes in a concurrent marking phase, marking one or more reachable objects of the first type as live data. The method further includes for each region of the plurality maintaining a calculation of live data in the respective region. The method also includes traversing the objects of the first type marked in the concurrent marking phase and evacuating a set of traversed objects from a target collection region to a destination region of the heap.

Abstract: Through an online process, a user in an organization may request a reservation of some of the organization's cloud computing resources. Usage of the allocated resources is monitored. If usage falls below a configurable threshold level, an alert may be generated to provide notification of inefficient resource use. The allocated resources or a portion of the allocated resources may be reclaimed so that the resource can be made available to other users in the organization.

Abstract: An apparatus for storing or reading data in a memory array of a transponder and a corresponding transponder, read/write device and program element is described. Therein, a data file system for storing data within the memory array is defined by a predetermined protocol. The storing additional data includes checking whether a memory size of the application data file is larger than the memory size indicated by the application data length indicator; and storing second application data in a partial memory area of the application data file not occupied by the first application data. Thereby, memory areas which, according to the predetermined protocol, are not used can be used for new applications, data can be hidden in these areas such that they can not be read by protocol compliant reader devices and the data structure read or written is compatible with the former predetermined protocol.

Abstract: In a storage apparatus, in the case where a data block to be written to a storage medium is a zero data block containing only zero data, a zero data information memory stores zero data identification information indicating that the data block is a zero data block. A control apparatus receives a data block from an access requesting apparatus in association with a write request issued by the access requesting apparatus for writing the data block a specified number of times to a predetermined storage area of the storage medium, and when determining that the data block is a zero data block containing only zero data, sets zero data identification information in the zero data information memory, and when completing the setting of the zero data identification information, sends the access requesting apparatus a completion notice of the writing to the storage medium.