Patents by Inventor Keriley K. Romanufa
Keriley K. Romanufa has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9646044Abstract: Technology for applying locks to memory pages. More specifically, a sticky lock is chosen by matching observed usage patterns with predetermined patterns associated with various sticky locks and/or types of stick locks increase database performance by reducing required communications and information transfers.Type: GrantFiled: November 26, 2014Date of Patent: May 9, 2017Assignee: International Business Machines CorporationInventors: Ronen Grosman, Matthew A. Huras, Bret R. Olszewski, Keriley K. Romanufa, Aamer U. Sachedina, Xun Xue
-
Patent number: 9633070Abstract: According to embodiments of the present invention, one or more computer processors determine that a predetermined workload threshold associated with an invalidated object is not exceeded and transmits an invalidation command associated with the invalidated object to the owner of the invalidated object. The one or more computer processors instruct the modifier of the invalidated object to retain possession of a first lock on the object beyond the transaction. The one or more computer processors determine that a usage pattern associated with the invalidated object matches a predetermined usage pattern for selecting a lock that can be retained beyond an associated transaction and transmits a second lock a requestor. The one or more computer processors instruct the modifier to release possession of the first lock to the owner and transmit a first image of the current version of the invalidated object to the owner for subsequent transmission to the requestor.Type: GrantFiled: March 31, 2014Date of Patent: April 25, 2017Assignee: International Business Machines CorporationInventors: Ronen Grosman, Matthew A. Huras, Bret R. Olszewski, Keriley K. Romanufa, Aamer U. Sachedina, Xun Xue
-
Patent number: 9372880Abstract: Provided are techniques for reclamation of empty pages in database tables. In response to receiving a plurality of records for insertion into a database table, the plurality of records are inserted into one or more contiguous pages. In response to at least some of the plurality of records being deleted from the database table, the one or more contiguous pages are reclaimed by: relocating any records from the plurality of records remaining in the one or more contiguous pages and releasing the one or more contiguous pages.Type: GrantFiled: April 29, 2013Date of Patent: June 21, 2016Assignee: International Business Machines CorporationInventors: Frank-Martin Haas, Nelson Hop Hing, Matthew A. Huras, Catherine S. McArthur, Sean W. McKeough, Keriley K. Romanufa, Torsten W. E. Ziegler
-
Patent number: 9229970Abstract: An ordering of operations in log records includes: performing update operations on a database object by a node; writing log records for the update operations into a local buffer by the node, the log records each including a local virtual timestamp; determining that a log flush to write the log records in the local buffer to a persistent storage is to be performed; in response, sending a request from the node to a log flush sequence server for a log flush sequence number; receiving the log flush sequence number by the node; inserting the log flush sequence number into the log records in the local buffer; and performing the log flush to write the log records in the local buffer to the persistent storage, where the log records written to the persistent storage comprises the local virtual timestamps and the log flush sequence number.Type: GrantFiled: December 7, 2009Date of Patent: January 5, 2016Assignee: International Business Machines CorporationInventors: Ronen Grosman, Matthew A. Huras, Timothy R. Malkemus, Keriley K. Romanufa, Aamer Sachedina, Kelly W. Schlamb, Nickolay V. Tchervenski, Xun Xue
-
Publication number: 20150278242Abstract: According to embodiments of the present invention, one or more computer processors determine that a predetermined workload threshold associated with an invalidated object is not exceeded and transmits an invalidation command associated with the invalidated object to the owner of the invalidated object. The one or more computer processors instruct the modifier of the invalidated object to retain possession of a first lock on the object beyond the transaction. The one or more computer processors determine that a usage pattern associated with the invalidated object matches a predetermined usage pattern for selecting a lock that can be retained beyond an associated transaction and transmits a second lock a requestor. The one or more computer processors instruct the modifier to release possession of the first lock to the owner and transmit a first image of the current version of the invalidated object to the owner for subsequent transmission to the requestor.Type: ApplicationFiled: November 26, 2014Publication date: October 1, 2015Inventors: Ronen Grosman, Matthew A. Huras, Bret R. Olszewski, Keriley K. Romanufa, Aamer U. Sachedina, Xun Xue
-
Publication number: 20150278291Abstract: According to embodiments of the present invention, one or more computer processors determine that a predetermined workload threshold associated with an invalidated object is not exceeded and transmits an invalidation command associated with the invalidated object to the owner of the invalidated object. The one or more computer processors instruct the modifier of the invalidated object to retain possession of a first lock on the object beyond the transaction. The one or more computer processors determine that a usage pattern associated with the invalidated object matches a predetermined usage pattern for selecting a lock that can be retained beyond an associated transaction and transmits a second lock a requestor. The one or more computer processors instruct the modifier to release possession of the first lock to the owner and transmit a first image of the current version of the invalidated object to the owner for subsequent transmission to the requestor.Type: ApplicationFiled: March 31, 2014Publication date: October 1, 2015Applicant: International Business Machines CorporationInventors: Ronen Grosman, Matthew A. Huras, Bret R. Olszewski, Keriley K. Romanufa, Aamer U. Sachedina, Xun Xue
-
Publication number: 20140324917Abstract: Provided are techniques for reclamation of empty pages in database tables. In response to receiving a plurality of records for insertion into a database table, the plurality of records are inserted into one or more contiguous pages. In response to at least some of the plurality of records being deleted from the database table, the one or more contiguous pages are reclaimed by: relocating any records from the plurality of records remaining in the one or more contiguous pages and releasing the one or more contiguous pages.Type: ApplicationFiled: April 29, 2013Publication date: October 30, 2014Applicants: SAP AG, International Business Machines CorporationInventors: Frank-Martin Haas, Nelson Hop Hing, Matthew A. Huras, Catherine S. McArthur, Sean W. McKeough, Keriley K. Romanufa, Torsten W.E. Ziegler
-
Patent number: 8666958Abstract: Lock communications in a shared disk database system is reduced by several approaches: sending a single message to a lock manager for locks required for an operation and locks that will be required in the future, the operations may include row update, row delete, large scan, and row insert; performing an operation in two executions, where in a first execution locks required for the operation is determined without performing the operation, and in a second execution a single message is sent to a lock manager for the required locks and the operation is performed; in free space searching, sending a single message to a lock manager for row and page locks before a row insert is actually performed; and granting locks in an unfair manner.Type: GrantFiled: November 27, 2009Date of Patent: March 4, 2014Assignee: International Business Machines CorporationInventors: James L. Finnie, Ronen Grosman, Matthew A. Huras, Keriley K. Romanufa, Aamer Sachedina, Garret F. Swart, Xun Xue, Roger L. Q. Zheng
-
Patent number: 8140721Abstract: For an information retrieval system coupled to a buffer pool maintaining a plurality of pages of recently accessed information for subsequent re-access, a technique for starting the buffer pool is provided. The technique facilitates a quicker start to the buffer pool by deferring allocation of page storing portions, for example, until they are needed. The technique makes the buffer pool available for storing pages while deferring allocation of a page storing portion of the buffer pool and allocates the page storing portion of the buffer pool in response to a demand to store pages to the buffer pool. The technique may be used to re-start a buffer pool with pages stored to a memory coupled to the information retrieval system where the pages where stored upon a buffer pool shutdown. Further, buffer pool readers or prefetchers may be configured to read pages for storing to the buffer pool and allocate the page storing portions of the buffer pool in response to instructions to read particular pages.Type: GrantFiled: August 19, 2004Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Aamer Sachedina, Matthew A. Huras, Keriley K. Romanufa
-
Patent number: 8046633Abstract: A system and method for managing shared resources is disclosed. The system includes a primary coherency processing unit which processes lock requests from a plurality of data processing hosts, the primary coherency processing unit also storing a first current lock state information for the plurality of data processing hosts, the first current lock state information including a plurality of locks held by the plurality of data processing hosts. The system further includes a standby coherency processing unit storing fewer locks than the primary coherency processing unit, the locks stored by the standby coherency processing unit being a subset of locks included in the first current lock state information, the standby coherency unit configured to perform a plurality of activities of the primary coherency processing unit using the subset of locks in response to a failure of the primary coherency processing unit.Type: GrantFiled: December 10, 2009Date of Patent: October 25, 2011Assignee: International Business Machines CorporationInventors: Matthew A. Huras, Roger L. Zheng, Aamer Sachedina, James L. Finnie, Keriley K. Romanufa, Xun Xue, Andrew D. Buckler, Stewart L. Palmer
-
Patent number: 8024741Abstract: A computer system dynamically scales back latch requests for system resources. Tasks seeking access to system resources each dynamically determine the probability that the task will gain access to the latch relating to a given system resource. Where the task estimates that its probability is below a defined threshold, the task will suspend itself for a defined sleep time. The task dynamically adjusts the length of the sleep time based on the number of times the task enters the suspended state and on the relative changes in the estimated probability that the task will gain access to the resource.Type: GrantFiled: July 14, 2006Date of Patent: September 20, 2011Assignee: International Business Machines CorporationInventors: Aamer Sachedina, Matthew A. Huras, Keriley K. Romanufa
-
Publication number: 20110145627Abstract: A system and method for managing shared resources is disclosed. The system includes a primary coherency processing unit which processes lock requests from a plurality of data processing hosts, the primary coherency processing unit also storing a first current lock state information for the plurality of data processing hosts, the first current lock state information including a plurality of locks held by the plurality of data processing hosts. The system further includes a standby coherency processing unit storing fewer locks than the primary coherency processing unit, the locks stored by the standby coherency processing unit being a subset of locks included in the first current lock state information, the standby coherency unit configured to perform a plurality of activities of the primary coherency processing unit using the subset of locks in response to a failure of the primary coherency processing unit.Type: ApplicationFiled: December 10, 2009Publication date: June 16, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Matthew A. HURAS, Roger L. Zheng, Aamer Sachedina, James L. Finnie, Keriley K. Romanufa, Xun Xue, Andrew D. Buckler, Stewart L. Palmer
-
Publication number: 20110137861Abstract: A coherency manager provides coherent access to shared data by receiving a copy of updated database data from a host computer through RDMA, the copy including updates to a given database data; storing the copy of the updated database data as a valid copy of the given database data in local memory; invalidating local copies of the given database data on other host computers through RDMA; receiving acknowledgements from the other host computers through RDMA that the local copies of the given database data have been invalidated; and sending an acknowledgement of receipt of the copy of the updated database data to the host computer through RDMA. When the coherency manager receives a request for the valid copy of the given database data from a host computer through RDMA, it retrieves the valid copy of the given database data from the local memory and returns the valid copy through RDMA.Type: ApplicationFiled: December 9, 2009Publication date: June 9, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rodney C. Burnett, David A. Elko, Ronen Grosman, Jimmy R. Hill, Matthew A. Huras, Mark A. Kowalski, Daniel H. Lepore, Keriley K. Romanufa, Aamer Sachedina, Xun Xue
-
Publication number: 20110137874Abstract: An ordering of operations in log records includes: performing update operations on a shared database object by a node; writing log records for the update operations into a local buffer by the node, the log records each including a local virtual timestamp; determining that a log flush to write the log records in the local buffer to a persistent storage is to be performed; in response, sending a request from the node to a log flush sequence server for a log flush sequence number; receiving the log flush sequence number by the node; inserting the log flush sequence number into the log records in the local buffer; and performing the log flush to write the log records in the local buffer to the persistent storage, where the log records written to the persistent storage comprises the local virtual timestamps and the log flush sequence number.Type: ApplicationFiled: December 7, 2009Publication date: June 9, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Ronen Grosman, Matthew A. Huras, Timothy R. Malkemus, Keriley K. Romanufa, Aamer Sachedina, Kelly W. Schlamb, Nickolay V. Tchervenski, Xun Xue
-
Publication number: 20110131192Abstract: Lock communications in a shared disk database system is reduced by several approaches: sending a single message to a lock manager for locks required for an operation and locks that will be required in the future, the operations may include row update, row delete, large scan, and row insert; performing an operation in two executions, where in a first execution locks required for the operation is determined without performing the operation, and in a second execution a single message is sent to a lock manager for the required locks and the operation is performed; in free space searching, sending a single message to a lock manager for row and page locks before a row insert is actually performed; and granting locks in an unfair manner.Type: ApplicationFiled: November 27, 2009Publication date: June 2, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James L. Finnie, Ronen Grosman, Matthew A. Huras, Keriley K. Romanufa, Aamer Sachedina, Xun Xue, Roger L.Q. Zheng
-
Patent number: 7111295Abstract: A computer system dynamically scales back latch requests for system resources. Tasks seeking access to system resources each dynamically determine the probability that the task will gain access to the latch relating to a given system resource. Where the task estimates that its probability is below a defined threshold, the task will suspend itself for a defined sleep time. The task dynamically adjusts the length of the sleep time based on the number of times the task enters the suspended state and on the relative changes in the estimated probability that the task will gain access to the resource.Type: GrantFiled: April 27, 2001Date of Patent: September 19, 2006Assignee: International Business Machines CorporationInventors: Aamer Sachedina, Matthew A Huras, Keriley K Romanufa
-
Patent number: 7107294Abstract: A method and system for suspending log-based updates to a database in a manner that permits resumption of log-based updating without reinitializing the database. The method and system thereby permit efficient alternation between a log-based update mode and a database access mode. Unplayed log records are protected as revisions of database pages at the time that the log-based update was suspended. This approach permits log-based updating to resume at the same point at which log-based updating was suspended. In order to ensure consistent data for access while in database access mode, a roll-back procedure creates consistent data pages that are used for access and discarded when log-based update resumes.Type: GrantFiled: January 7, 2004Date of Patent: September 12, 2006Assignee: International Business Machines CorporationInventors: Keriley K. Romanufa, Jeffrey J. Goss, Matthew A. Huras, Catherine S. McArthur, Dale M. McInnis, Michael J. Winer, Roger L. Q. Zheng
-
Patent number: 7099889Abstract: The use of a centralized version table allows for efficient object switching. Rather than synchronizing all database agents to recognize a newly created file as containing the most recent version of a given object, database agents requiring access to the given object need only consult the centralized version table to learn file identity information. That is, the database agents consult the centralized version table to determine which of the files associated with a given object contain the most recent version of the given object. Mechanisms associated with the use of the centralized version table also provide for efficient recovery from a failure that has occurred during an object switching transaction.Type: GrantFiled: April 29, 2003Date of Patent: August 29, 2006Assignee: International Business Machines CorporationInventors: Robert T. Berks, Miroslaw Adam Flasza, Matthew Albert Huras, Leo Tat Man Lau, Keriley K. Romanufa, Aamer Sachedina, Michael Jeffrey Winer
-
Patent number: 7085911Abstract: A hash table for a collection of data items includes a set of hash buckets, each hash bucket being associated with a subset of the collection of data items, and a set of properties entries in each of the hash buckets. Each properties entry includes a pointer to an associated data item in the subset associated with the bucket and a set of representative values identifying the associated data item. A hash table can also include bucket groups defining a second level hash table to permit resizing of the hash table.Type: GrantFiled: April 23, 2003Date of Patent: August 1, 2006Assignee: International Business Machines CorporationInventors: Aamer Sachedina, Matthew A. Huras, Keriley K. Romanufa
-
Patent number: 7007146Abstract: A system and associated method are provided for directing a database management system, to relocate buffer pages that are pinned in a buffer pool of a data processing system. Each of the buffer pages has a respective page descriptor for indicating the location of the buffer page in the buffer pool. Once the pages are relocated, the now free system memory of the buffer pool is resized. Prior to resizing, a selected pinned page is latched by an agent of the system, wherein the selected page of the buffer pages is in a resize region of the buffer pool. The pinned and latched page becomes a fixed page. The agent for the database management system determines a suitable relocation region of the buffer pool for the fixed page. A resizer module copies the contents of the fixed page to the relocation region and changes the respective page descriptor to indicate the relocation region.Type: GrantFiled: April 22, 2003Date of Patent: February 28, 2006Assignee: International Business Machines CorporationInventors: Keriley K. Romanufa, Aamer Sachedina