Search

Andrew L Hisgen

from New York, NY
Age ~71
Get Report
Also known as:
Andrew Lawrence Hisgen, Andrew J Hisgen, Andy Hisgen, Andrew N
Phone and address:
1725 York Ave APT 30E, New York, NY 10128
(908) 389-9349
Related to:
Marilyn Weeks Sweet, 89Shu H Chen, 63Winnie Y Chan, 65Shirley S Fung, 46Selina S Yoon, 65
Connected to:
Marilyn Hisgen, 81Freda F Hish, 103Katrina J Hish, 61Aritaka Hishida, 53Gale A Hishinuma, 57Paul J Hishmeh, 60Peter C Hisken, 70Angela D Hiskey, 52Lauren E Hiskey, 40Carl C Hisle, 61

Andrew Hisgen Phones & Addresses

  • 1725 York Ave APT 30E, New York, NY 10128 (908) 389-9349
  • 269 Bush St, Mountain View, CA 94041
  • 11612 Bridge Park Ct, Cupertino, CA 95014
  • 1599 Grouse Ln, Mountainside, NJ 07092 (908) 389-1022
  • San Jose, CA
  • San Francisco, CA
  • Palo Alto, CA
  • Staten Island, NY
  • Short Hills, NJ
  • 245 E 93Rd St APT 22C, New York, NY 10128

Work

Position: Professional/Technical

Education

Degree: Graduate or professional degree

Resumes

Resumes

Andrew Hisgen Photo 1

Andrew Hisgen

View page
Location:
New York, NY
Industry:
Computer Software
Skills:
High Availability
Distributed Systems
Cluster
Software Engineering
Scalability
File Systems
System Architecture
Solaris
Andrew Hisgen Photo 2

Andrew Hisgen

View page
Location:
Greater New York City Area
Industry:
Computer Software
Andrew Hisgen Photo 3

Andrew Hisgen

View page

Publications

Us Patents

Emulation Of Persistent Group Reservations

View page
US Patent:
6658587, Dec 2, 2003
Filed:
Jan 10, 2000
Appl. No.:
09/480329
Inventors:
Ira Pramanick - San Jose CA
Declan J. Murphy - San Francisco CA
Krishna K. Kumar - Cupertino CA
Siamak Nazari - Arcadia CA
Andrew L. Hisgen - Cupertino CA
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 1100
US Classification:
714 5, 709230
Abstract:
Method for emulating persistent group reservations on non persistent group reservation-compliant devices, apparatus to perform the method, and computer-readable storage medium containing instructions to perform the method. The present invention enables the emulation of persistent group reservations on a non persistent group reservation-compliant device, including a shared disk, to enable the disks implementation of persistent group reservation-reliant algorithms. This in turn enables the implementation of algorithms based on persistent group reservation features substantially without modification of those algorithms. One such algorithm is a quorum algorithm. One example of persistent group reservations is found in the SCSI-3 standard. The present invention accomplishes persistent group reservation emulation, or PGRE, by storing host- and reservation-specific information on a reserved portion of the disk and using this data to emulate the steps of certain persistent group reservation features. One persistent group reservation preempt feature executes a set of steps as a single atomic action, the mutual exclusion necessary for this feature being done internally by the persistent group reservations-compliant device.

Method And Apparatus For Detecting Dependency Cycles Between Resources In A Computer System

View page
US Patent:
6681242, Jan 20, 2004
Filed:
Jan 10, 2000
Appl. No.:
09/480149
Inventors:
Naveen Kumar - Newark CA
Andrew L. Hisgen - Cupertino CA
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 900
US Classification:
709104, 709100, 709102, 709223, 709226
Abstract:
One embodiment of the present invention provides a system that detects cycles in a set of dependencies between a set of resources in a computer system. The system operates by receiving a new dependency indicating that a first resource cannot proceed unless a second resource is able to proceed. The system determines if the new dependency creates a cycle in the set of dependencies by performing a search, which looks for cycles of dependencies starting from the first resource and ending at the first resource. If the search detects such a cycle, the system indicates that the new dependency creates the cycle. The system may also send an error message when the cycle is detected, and may abort further processing. In one embodiment of the present invention, the new dependency between the first resource and the second resource indicates that the second resource must be started before the first resource is started. In one embodiment of the present invention, the new dependency between the first resource and the second resource indicates that the first resource must be stopped before the second resource is stopped.

System And Method For Comprehensive Availability Management In A High-Availability Computer System

View page
US Patent:
6691244, Feb 10, 2004
Filed:
Mar 14, 2000
Appl. No.:
09/525200
Inventors:
Mark A. Kampe - Los Angeles CA
Andrew Hisgen - Cupertino CA
Assignee:
Sun Microsystems, Inc. - Palo Alto CA
International Classification:
G06F 1100
US Classification:
714 4
Abstract:
A system and method for availability management coordinates operational states of components to implement a desired redundancy model within a high-availability computing system. Within the availability management system, an availability manager monitors various reports on the status of components and nodes within the system. The availability manager uses these reports to direct components to change states if necessary, in order to maintain the desired system redundancy model. The availability management system includes a health monitor for performing component status audits upon individual components and reporting component status changes. The system also includes a watch-dog timer, which monitors the health monitor and reboots the entire node containing the health monitor if it becomes non-responsive. Each node within the system also includes a cluster membership monitor, which monitors nodes becoming non-responsive and reports node non-responsive errors.

Method And Apparatus For Dynamically Altering Configurations Of Clustered Computer Systems

View page
US Patent:
6769008, Jul 27, 2004
Filed:
Jan 10, 2000
Appl. No.:
09/480466
Inventors:
Krishna Kumar - Cupertino CA
Declan J. Murphy - San Francisco CA
Andrew L. Hisgen - Cupertino CA
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 1516
US Classification:
709201, 709220, 709221, 709222, 709226
Abstract:
Improved techniques for dynamically altering configurations of clustered computing systems are disclosed. The improved techniques can be implemented to allow alteration of an existing configuration of a clustered computing system without having to completely shutdown the clustered computing system. As a result, the clustered computing system can provide uninterrupted services while the configuration of the clustered computing system is being dynamically altered, yet also safeguard against unwanted partitions in time or space.

Controlled Take Over Of Services By Remaining Nodes Of Clustered Computing System

View page
US Patent:
6789213, Sep 7, 2004
Filed:
Jan 10, 2000
Appl. No.:
09/479485
Inventors:
Krishna Kumar - Cupertino CA
Declan J. Murphy - San Francisco CA
Andrew L. Hisgen - Cupertino CA
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 1100
US Classification:
714 13, 714 4, 714 10, 714 11, 714 12, 709220, 709221, 718102, 718103, 718104, 718105
Abstract:
Improved techniques for controlled take over of services for clustered computing systems are disclosed. The improved techniques can be implemented to allow one sub-cluster of the clustered computing system to safely take over services of one or more other sub-clusters in the clustered computing system. Accordingly, if the clustered computing system is fragmented into two or more disjointed sub-clusters, one sub-cluster can safely take over services of the one or more other sub-clusters after the one or more other sub-clusters have been shutdown. As a result, the clustered computing system can continue to safely provide services even when the clustered computing system has been fragmented into two or more disjointed sub-clusters due to an operational failure.

Method And Apparatus For Managing Operations Of Clustered Computer Systems

View page
US Patent:
6862613, Mar 1, 2005
Filed:
Jan 10, 2000
Appl. No.:
09/480785
Inventors:
Krishna Kumar - Cupertino CA, US
Declan J. Murphy - San Francisco CA, US
Andrew L. Hisgen - Cupertino CA, US
Robert Block - Mountain View CA, US
Assignee:
Sun Microsystems, Inc. - Palo Alto CA
International Classification:
G06F015/177
US Classification:
709220, 709221, 709202, 709224, 709226, 714 4, 714 11, 714 13, 714 22
Abstract:
Improved techniques for managing operations of clustered computing system are disclosed. The improved techniques provide protection against potential problems encountered in operation of clustered computing. More particularly, the improved techniques can be implemented as an integral solution that provide protection against undesired partitions in space and partitions in time. The improved techniques do not require any human intervention.

Method And Apparatus For Providing A Highly Available Distributed Event Notification Mechanism

View page
US Patent:
20040088401, May 6, 2004
Filed:
Oct 31, 2002
Appl. No.:
10/285176
Inventors:
Ashutosh Tripathi - Fremont CA, US
Andrew Hisgen - New Providence NJ, US
Nicholas Solter - Irvine CA, US
International Classification:
G06F015/173
US Classification:
709/224000
Abstract:
One embodiment of the present invention provides a system that supports event notification within a distributed computing system. Upon receiving an event that was generated at a node in the distributed computing system, the system performs a lookup in a database to determine a list of clients that are registered to be notified of the event. The system then sends a notification of the event to clients in the list. In a variation on this embodiment, the event notification is performed by an event forwarding mechanism that is highly available. In this way, if the event forwarding mechanism fails, a new instance of the event forwarding mechanism is automatically started, possibly on a different node within the distributed computing system.

Method And Apparatus For Recovering From A Failure In A Distributed Event Notification System

View page
US Patent:
20040123183, Jun 24, 2004
Filed:
Dec 23, 2002
Appl. No.:
10/329011
Inventors:
Ashutosh Tripathi - Fremont CA, US
Nicholas Solter - Irvine CA, US
Andrew Hisgen - New Providence NJ, US
Martin Rattner - Los Altos CA, US
International Classification:
H04L001/22
US Classification:
714/031000
Abstract:
One embodiment of the present invention provides a system that facilitates recovering from failure in a distributed event notification system. During operation, the system detects a failure of an event forwarder, which notifies subscribers of events generated by distributed components in the distributed computing system. In response to detecting the failure, the system restarts the event forwarder, typically on another node in the distributed computing system. Next, the system requests a snapshot of current state from the distributed components. In response to this request, the system subsequently receives events from the distributed components that specify current state of the distributed components, and then forwards the events to subscribers that are registered to be notified of the events.
Control profile
Andrew L Hisgen from New York, NY, age ~71 Get Report