Shashidhar Bomma

8214609, Jul 3, 2012

Jul 16, 2008

12/174476

Shashidhar Bomma - Austin TX, US
Andrew Dunshea - Austin TX, US
Douglas J. Griffith - Georgetown TX, US
Jean-Philippe Sugarbroad - Seattle WA, US

International Business Machines Corporation - Armonk NY

G06F 12/12

711159, 711160, 711152

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.

8612381, Dec 17, 2013

Sep 12, 2008

12/209375

Shashidhar Bomma - Austin TX, US
Brian W. Hart - Austin TX, US

International Business Machines Corporation - Armonk NY

G06F 17/30
G06F 7/00

707609, 707610

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.

8615642, Dec 24, 2013

Oct 14, 2009

12/578623

Shashidhar Bomma - Austin TX, US
Andrew Dunshea - Austin TX, US

International Business Machines Corporation - Armonk NY

G06F 12/00
G06F 13/00
G06F 13/28

711171, 711173, 711206, 711209

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.

20090119376, May 7, 2009

Nov 6, 2007

11/935758

Shashidhar Bomma - Austin TX, US

INTERNATIONAL BUSNESS MACHINES CORPORATION - ARMONK NY

G06F 15/16

709206

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.

20090182792, Jul 16, 2009

Jan 14, 2008

12/013504

Shashidhar Bomma - Austin TX, US
Joon Chang - Austin TX, US
Ramesh Veeramalla - Austin TX, US
Sreenivas Makineedi - Austin TX, US

G06F 17/00

707206, 707E17005

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.

20200364086, Nov 19, 2020

May 16, 2019

16/413852

- Armonk NY, US
Neeraj Kumar Kashyap - Bangalura, IN
Shashidhar Bomma - Austin TX, US

G06F 9/50
G06F 11/07
G06F 11/20

Workload redistribution is provided. Upper and lower thresholds of resource utilization by worker nodes in a worker node group are defined. Hot and cold regions are determined in the worker node group to provide policy-based rescheduling of the worker nodes and redistribution of workload on the worker nodes based on the upper and lower thresholds of resource utilization. Resource utilization data corresponding to the worker nodes in the worker node group are collected at defined time intervals. It is determined whether an average resource utilization of any worker node in the worker node group is greater than the upper threshold of resource utilization based on the collected resource utilization data. In response to determining that the average resource utilization of any worker node in the worker node group is greater than the upper threshold, redistribution of the workload on the worker nodes is triggered.

20120005450, Jan 5, 2012

Jul 2, 2010

12/829419

Shashidhar Bomma - Cotton Wood Heights UT, US
Robert Wright Thompson - Austin TX, US

International Business Machines Corporation - Armonk NY

G06F 12/00

711171, 711E12001

A method enables a user to control the allocation in a file system of file data and metadata blocks by determining ranges of unallocated contiguous blocks in the file system. The method allocates to the user a metadata storage range of contiguous blocks within one of ranges of unallocated contiguous blocks. The method further allocates to the user a data storage range of contiguous blocks within the range of unallocated contiguous blocks. The method may then allocate to the user ranges of contiguous blocks within the allocated data storage range for storage of respective files.

20100229188, Sep 9, 2010

Mar 3, 2009

12/396696

Kavitha Vittal Murthy Baratakke - Austin TX, US
Shashidhar Bomma - Cotton Wood Heights UT, US
Brian W. Hart - Austin TX, US
Nikhil Hegde - Round Rock TX, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 9/46

719328

In accordance with the invention, it has been recognized that for an application that is of a particular type and has certain characteristics, a benefit can be achieved by presenting multiple files to the application in a particular pre-planned or pre-specified order. Accordingly, an embodiment of the invention is directed to a method in a data processing system, wherein information pertaining to multiple data files is located in a container, and a plurality of applications of different types are each disposed to request a presentation of the files. Responsive to a request from a given application for presentation of the files, it is determined that the given application is of a particular type. The method further includes specifying an order for the presentation of the files, wherein the specified order is pre-selected to achieve an objective associated with applications of the given type. The files are then presented to the given application in the specified order.