| Patent application number | Description | Published |
|---|
| 20090119376 | Hint-Based Email Address Construction - Methods, apparatus, and products are disclosed for hint-based email address construction that include: receiving, in an email address constructor, an email address hint specified by a user, the email address hint representing an email address for an email recipient; parsing, by the email address constructor, the email address hint for a plurality of hint tokens, each of the hint tokens specifying a user attribute for the email recipient, and at least one of the hint tokens specifying an attribute other than the email recipient's name; and determining, by the email address constructor, the email address for the email recipient in dependence upon the plurality of hint tokens. | 05-07-2009 |
| 20090182792 | METHOD AND APPARATUS TO PERFORM INCREMENTAL TRUNCATES IN A FILE SYSTEM - The present invention provides a computer implemented method for truncating a file in a file system. The file system receives a request to truncate a file to a target size, the file having a first inode. The file system creates a second inode to a transient directory, wherein the second inode holds a plurality of in-progress entries. The file system sets a target size in the first inode. The file system writes a truncate entry to a journal, the truncate entry comprising a predetermined size. The file system truncates the file by up to the predetermined size. The file system determines that the file is above the target size. Responsive to a determination that the file is above the target size, the file system repeats the truncating step and the determining step. Responsive to a determination that the file is not above the target size, the file system applies the in-progress entries from the transient directory. | 07-16-2009 |
| 20100017576 | Data Transference to Virtual Memory - Some embodiments comprise a method for selecting data to be transferred to a storage space of virtual memory and include identifying a set of data and determining subsets. Determining subsets may allow for delays before transferring the subsets and allow access to memory of the subsets during the delays. Accesses during the delays may enable embodiments to select other data to be transferred to the storage space and prevent transference of the accessed data. Other embodiments comprise apparatuses that have a paging space, a page identifier, and a page transferrer to transfer pages to the paging space after a delay. The delay may prevent a number of pages from being transferred to the paging space, such as for pages that were accessed during the delay. | 01-21-2010 |
| 20100070469 | ENHANCED SYNCHRONIZATION FRAMEWORK PROVIDING IMPROVED SYNC GRANULARITY - A sync manager invokes a scheduled sync task that includes filter attributes for filtering a plurality of memory pages into a subset of memory pages. The sync manager selects file pointers that correspond to a plurality of files and traverses through the files using the selected file pointers. While traversing, the sync manager extracts file attributes for each of the files and, in turn, filters the files by comparing the filter attributes with the extracted file attributes. The sync manager then extracts memory page identifiers that correspond to the filtered files and synchronizes a subset of memory pages using the extracted memory page identifiers. | 03-18-2010 |
| 20110087857 | AUTOMATIC PAGE PROMOTION AND DEMOTION IN MULTIPLE PAGE SIZE ENVIRONMENTS - Functionality can be implemented in a virtual memory manager (VMM) to allow small pages (e.g., 4 KB) to be coalesced into large pages (e.g., 64 KB), so that a single free list can be maintained for the large pages (“maintained pages”). When a process requests a small page, the VMM can associate a maintained page with a memory segment accessible by the process. Then, the maintained page can be divided to form a set of small pages (“fragments”). The fragments can become available pages in a broken page list. The VMM can satisfy the request by allocating one of the fragments in the broken page list. If the process requests additional small pages, the additional requests can be satisfied from the broken page list. When the process terminates, the fragments in the broken page list become a maintained page and can be returned to the free list. | 04-14-2011 |
