Patents by Inventor Kenneth Andrew Ross
Kenneth Andrew Ross 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: 9652168Abstract: A method includes the following steps. Runtime statistics related to data transaction processing in a concurrent system are collected. A given request to access shared data in the concurrent system is receive. Based on the collected runtime statistics, the number of reattempts the given request can make to access the shared data prior to access control being switched from a hardware transactional memory to a locking mechanism is adaptively determined.Type: GrantFiled: April 10, 2015Date of Patent: May 16, 2017Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Mustafa Canim, Yuan-Chi Chang, Mohammad Sadoghi Hamedani, Bassem Makni, Kenneth Andrew Ross
-
Patent number: 9652169Abstract: A method includes the following steps. Runtime statistics related to data transaction processing in a concurrent system are collected. A given request to access shared data in the concurrent system is receive. Based on the collected runtime statistics, the number of reattempts the given request can make to access the shared data prior to access control being switched from a hardware transactional memory to a locking mechanism is adaptively determined.Type: GrantFiled: July 9, 2015Date of Patent: May 16, 2017Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Mustafa Canim, Yuan-Chi Chang, Mohammad Sadoghi Hamedani, Bassem Makni, Kenneth Andrew Ross
-
Publication number: 20160299798Abstract: A method includes the following steps. Runtime statistics related to data transaction processing in a concurrent system are collected. A given request to access shared data in the concurrent system is receive. Based on the collected runtime statistics, the number of reattempts the given request can make to access the shared data prior to access control being switched from a hardware transactional memory to a locking mechanism is adaptively determined.Type: ApplicationFiled: July 9, 2015Publication date: October 13, 2016Inventors: Bishwaranjan Bhattacharjee, Mustafa Canim, Yuan-Chi Chang, Mohammad Sadoghi Hamedani, Bassem Makni, Kenneth Andrew Ross
-
Publication number: 20160299718Abstract: A method includes the following steps. Runtime statistics related to data transaction processing in a concurrent system are collected. A given request to access shared data in the concurrent system is receive. Based on the collected runtime statistics, the number of reattempts the given request can make to access the shared data prior to access control being switched from a hardware transactional memory to a locking mechanism is adaptively determined.Type: ApplicationFiled: April 10, 2015Publication date: October 13, 2016Inventors: Bishwaranjan Bhattacharjee, Mustafa Canim, Yuan-Chi Chang, Mohammad Sadoghi Hamedani, Bassem Makni, Kenneth Andrew Ross
-
Patent number: 8065304Abstract: In one illustrative embodiment, a computer implemented method using asymmetric memory management is provided. The computer implemented method receives a request, containing a search key, to access an array of records in the asymmetric memory, wherein the array has a sorted prefix portion and an unsorted append portion, the append portion alternatively comprising a linked-list, and responsive to a determination that the request is an insert request, inserts the record in the request in arrival order in the unsorted append portion to form a newly inserted record. Responsive to a determination that the newly inserted record completes the group of records, stores an index, in sorted order, for the group of records.Type: GrantFiled: June 11, 2008Date of Patent: November 22, 2011Assignee: International Business Machines CorporationInventor: Kenneth Andrew Ross
-
Patent number: 7752414Abstract: A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one of the plurality of hash functions. The data item and a key portion and a payload portion of all data items are stored contiguously within the memory location. Also provided for are retrieving data items in a computer. A plurality of hash functions of data values in a probe key are computed. A corresponding memory location is determined for each of the plurality of hash functions. Data items in each memory location are examined to determine a match with the probe key. Responsive to a match, a payload of the matching stored data item is returned. All of the steps are performed free of conditional branch instructions.Type: GrantFiled: July 3, 2008Date of Patent: July 6, 2010Assignee: International Business Machines CorporationInventor: Kenneth Andrew Ross
-
Patent number: 7752418Abstract: A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one of the plurality of hash functions. The data item and a key portion and a payload portion of all data items are stored contiguously within the memory location. Also provided for are retrieving data items in a computer. A plurality of hash functions of data values in a probe key are computed. A corresponding memory location is determined for each of the plurality of hash functions. Data items in each memory location are examined to determine a match with the probe key. Responsive to a match, a payload of the matching stored data item is returned. All of the steps are performed free of conditional branch instructions.Type: GrantFiled: June 9, 2008Date of Patent: July 6, 2010Assignee: International Business Machines CorporationInventor: Kenneth Andrew Ross
-
Publication number: 20090313418Abstract: In one illustrative embodiment, a computer implemented method using asymmetric memory management is provided. The computer implemented method receives a request, containing a search key, to access an array of records in the asymmetric memory, wherein the array has a sorted prefix portion and an unsorted append portion, the append portion alternatively comprising a linked-list, and responsive to a determination that the request is an insert request, inserts the record in the request in arrival order in the unsorted append portion to form a newly inserted record. Responsive to a determination that the newly inserted record completes the group of records, stores an index, in sorted order, for the group of records.Type: ApplicationFiled: June 11, 2008Publication date: December 17, 2009Applicant: International Business Machines CorporationInventor: Kenneth Andrew Ross
-
Publication number: 20080263316Abstract: A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one of the plurality of hash functions. The data item and a key portion and a payload portion of all data items are stored contiguously within the memory location. Also provided for are retrieving data items in a computer. A plurality of hash functions of data values in a probe key are computed. A corresponding memory location is determined for each of the plurality of hash functions. Data items in each memory location are examined to determine a match with the probe key. Responsive to a match, a payload of the matching stored data item is returned. All of the steps are performed free of conditional branch instructions.Type: ApplicationFiled: July 3, 2008Publication date: October 23, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Kenneth Andrew Ross
-
Publication number: 20080235488Abstract: A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one of the plurality of hash functions. The data item and a key portion and a payload portion of all data items are stored contiguously within the memory location. Also provided for are retrieving data items in a computer. A plurality of hash functions of data values in a probe key are computed. A corresponding memory location is determined for each of the plurality of hash functions. Data items in each memory location are examined to determine a match with the probe key. Responsive to a match, a payload of the matching stored data item is returned. All of the steps are performed free of conditional branch instructions.Type: ApplicationFiled: June 9, 2008Publication date: September 25, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Kenneth Andrew Ross
-
Patent number: 7424591Abstract: A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one of the plurality of hash functions. The data item and a key portion and a payload portion of all data items are stored contiguously within the memory location. Also provided for are retrieving data items in a computer. A plurality of hash functions of data values in a probe key are computed. A corresponding memory location is determined for each of the plurality of hash functions. Data items in each memory location are examined to determine a match with the probe key. Responsive to a match, a payload of the matching stored data item is returned. All of the steps are performed free of conditional branch instructions.Type: GrantFiled: June 19, 2006Date of Patent: September 9, 2008Assignee: International Business Machines CorporationInventor: Kenneth Andrew Ross
-
Publication number: 20070294506Abstract: A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one of the plurality of hash functions. The data item and a key portion and a payload portion of all data items are stored contiguously within the memory location. Also provided for are retrieving data items in a computer. A plurality of hash functions of data values in a probe key are computed. A corresponding memory location is determined for each of the plurality of hash functions. Data items in each memory location are examined to determine a match with the probe key. Responsive to a match, a payload of the matching stored data item is returned. All of the steps are performed free of conditional branch instructions.Type: ApplicationFiled: June 19, 2006Publication date: December 20, 2007Applicant: International Business Machines CorporationInventor: Kenneth Andrew Ross