Michael Es Harvey

US Patent:

7549079, Jun 16, 2009

Filed:

Nov 30, 2005

Appl. No.:

11/289974

Inventors:

Sean Connolly - Nashua NH, US
Gary Allison - Nashua NH, US
Jiangbin Luo - Nashua NH, US
Nitin Yashwant Karkhanis - Nashua NH, US
Stephen John Vivian - Londonderry NH, US
Michael Seward Harvey - Hollis NH, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 11/00

US Classification:

714 5, 714 4, 714 46, 714 57

Abstract:

A graphical user interface based method of configuring automatic failover from a primary database system to a standby database system that is coupled to the primary database system by a network. Also coupled to the network is an observer process that is independent of the database systems and that initiates the failover process. The observer periodically pings the database systems to determine whether a failover is necessary. The graphical user interface permits a user to specify the primary and secondary database systems, configure the observer, and specify conditions under which a failover may occur and to enable automatic failover. A failover context is created from the inputs to the GUI and stored in persistent storage belonging to the database systems. If the Observer's context is stale, the Observer fetches the database system's context.

US Patent:

20130282666, Oct 24, 2013

Filed:

Apr 24, 2012

Appl. No.:

13/454799

Inventors:

Steven McGee - Bedford NH, US
Jiangbin Luo - Bedford NH, US
Benedicto Garin - Hollis NH, US
Mahesh Girkar - Cupertino CA, US
Michael Harvey - Hollis NH, US
Nitin Karkhanis - Nashua NH, US
Steve Lee - Hollis NH, US
Juan Loaiza - Woodside CA, US
Robert McGuirk - Nashua NH, US
Hongjie Yang - Foster City CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

707683, 707E17005

Abstract:

Disclosed are methods and apparatuses to provide a redo repeater that allows for no data loss protection without the performance impact to the primary database even when a significant geographical distance separates the primary and standby databases. The Repeater is a lightweight entity that receives redo from the primary database with the purpose of redistributing that redo throughout the primary/standby system configuration. The Repeater able to extend no data loss protection and switchover functionality to terminal standby databases even though the primary database does not need to have a direct connection with those destinations.

US Patent:

61254304, Sep 26, 2000

Filed:

Oct 30, 1998

Appl. No.:

9/183677

Inventors:

Karen Lee Noel - Pembroke NH
Michael Seward Harvey - Hollis NH

Assignee:

Compaq Computer Corporation - Houston TX

International Classification:

G06F 945

US Classification:

711152

Abstract:

A new virtual memory system is disclosed having a virtual address space including a gap of inaccessible virtual addresses within the virtual address space. A new virtual memory allocation routine is disclosed providing a starting address of accessible virtual addresses allocated to a currently executing process in a response to a request. The accessible virtual addresses are virtually contiguous, and include no addresses from within the gap of inaccessible virtual addresses. A new virtual memory deallocation routine is further disclosed providing deallocation of ranges of virtual addresses which may or may not include addresses within the inaccessible gap.

US Patent:

59788925, Nov 2, 1999

Filed:

May 3, 1996

Appl. No.:

8/642706

Inventors:

Karen Lee Noel - Pembroke NH
Michael Seward Harvey - Hollis NH

Assignee:

Digital Equipment Corporation - Maynard MA

International Classification:

G06F 1200

US Classification:

711170

Abstract:

A new virtual memory system is disclosed having a virtual address space including a gap of inaccessible virtual addresses within the virtual address space. A new virtual memory allocation routine is disclosed providing a starting address of accessible virtual addresses allocated to a currently executing process in a response to a request. The accessible virtual addresses are virtually contiguous, and include no addresses from within the gap of inaccessible virtual addresses. A new virtual memory deallocation routine is further disclosed providing deallocation of ranges of virtual addresses which may or may not include addresses within the inaccessible gap.

US Patent:

62336681, May 15, 2001

Filed:

Oct 27, 1999

Appl. No.:

9/428014

Inventors:

Michael S. Harvey - Hollis NH
James Alan Woodward - Merrimack NH
Wayne M. Cardoza - Amherst NH

Assignee:

Compaq Computer Corporation - Houston TX

International Classification:

G06F 1208

US Classification:

711206

Abstract:

Each processor in a multi-processor system includes a process page-table-base register and a system page-table-base register. Each register identifies a different page frame containing a different instance of a top-level subtable in a multi-level page table, and both instances' contents map their respective, different page frames to the same virtual page. A first of the instances, to which the process page-table-base register refers, is used to translate virtual addresses in a process-private range, while the second instance is used for shared-range translation. When a context switch occurs, the content of the process page-table-base register is changed in accordance with the process to whose operation the processor is turning, but that of the system page-table-base register remains unchanged. Parts of the shared space are replicated in different local memory modules, and processors in different locales have different contents in their system page-table-base registers to identify different top-level-subtable instances, which map some shared-space virtual pages to different physical page frames.

US Patent:

58192522, Oct 6, 1998

Filed:

Apr 10, 1996

Appl. No.:

8/630795

Inventors:

Thomas R. Benson - Hollis NH
Michael S. Harvey - Hollis NH
Karen L. Noel - Pembroke NH
Mark E. Arsenault - Mason NH
Leonard S. Szubowicz - Merrimack NH
Gary M. Barton - Nashua NH
Ronald F. Brender - Hollis NH
Kenneth W. Cowan - Hollis NH
Mark W. Davis - Belmont MA
Richard E. Peterson - Groton MA
Cheryl D. Stocks - Londonderry NH

Assignee:

Digital Equipment Corporation - Maynard MA

International Classification:

G06F 1730

US Classification:

707 1

Abstract:

A method executed in a computer system for detecting and handling an invalid use of a data structure is described. The method includes the steps of providing a data structure associated with a first computing environment. The data structure includes a field having a value stored therein identifying an inaccessible address in a second computing environment. This field is used in detecting an invalid use of the data structure in the second computing environment by a computer program attempting to access memory using said inaccessible address indicated by said value contained in the first field. Additionally a preferred data structure is described as are alternative embodiments of detecting an invalid use of a data structure.

US Patent:

58731202, Feb 16, 1999

Filed:

May 3, 1996

Appl. No.:

8/642291

Inventors:

Michael Seward Harvey - Hollis NH
Karen Lee Noel - Pembroke NH
Wayne Michael Cardoza - Amherst NH

Assignee:

Digital Equipment Corporation - Maynard MA

International Classification:

G06F 1200

US Classification:

711173

Abstract:

A virtual memory system is disclosed, providing a virtual address space of virtual addresses simultaneously available to a given process. The virtual address space includes a process private space accessible only to a given process, as well as a shared space of virtual addresses potentially accessible to two or more processes. The process private space includes virtual addresses on one side of a private/shared virtual address boundary, while the virtual addresses within the shared space are on the other side of the private/shared virtual address boundary. The private/shared boundary is ensured to be greater than a predetermined highest process private (or shared) virtual address of a different virtual memory system, and less than or equal to a predetermined lowest shared (or process private) virtual address of that different virtual memory system. Compatibility is ensured for software written for the different virtual memory system, allowing such software to run without modification on the present system. In an example embodiment, the private/shared boundary is set responsive to a user input reflecting a desired ratio between shared and process private space.

US Patent:

59667354, Oct 12, 1999

Filed:

Nov 22, 1996

Appl. No.:

8/754868

Inventors:

Karen Lee Noel - Pembroke NH
Michael Seward Harvey - Hollis NH
Thomas Robert Benson - Hollis NH

Assignee:

Digital Equipment Corporation - Maynard MA

International Classification:

G06F 1210

US Classification:

711206

Abstract:

A new system and method for outswapping a process is disclosed. The new system forms one or more working set list chains (also referred to as "page table chains") during the outswap process. The new system then conveniently locates and outswaps a number of page table pages of the process to be outswapped by traversing the working set list chains. In a preferred embodiment, the forming of each working set list chain is performed while traversing a working set list during outswapping of a number of body pages of a process. Each working set list entry potentially describes a page of virtual memory in use by the process to be outswapped. In a further aspect of the disclosed system, traversing the working set list of the process to be outswapped includes determining whether each one of the working set list entries indicates a private page table page. If an entry in the working set list indicates a private page table page, the present system adds a link to a working set list chain. In the disclosed system, a working set list entry is determined to indicate a private page table page if the page of virtual memory described by the working set list entry is within a page table structure associated with said process.