Search

Cary A Coutant

from Saratoga, CA
Age ~67
Get Report
Also known as:
Cary Allen Coutant, Cary A Countant
Phone and address:
13478 Briar Ct, Saratoga, CA 95070
(408) 741-0801
Related to:
Rebecca S Countant, 38Deborah S Coutant, 67Rebecca S Coutant, 38
Connected to:
Brandon A Coutant, 37Alexandro Coutard, 45Josceline Coutard, 67Orlo G Coutcher, 78Jennifer E Coute, 62Kristi J Coutee, 40Sharon Coutee, 51Shirley Coutee, 75Tara J Coutelle, 40Brad T Coutermash, 104

Cary Coutant Phones & Addresses

  • 13478 Briar Ct, Saratoga, CA 95070 (408) 741-0801 (408) 741-4863
  • San Francisco, CA
  • San Jose, CA
  • Sunnyvale, CA
  • Largo, FL
  • Los Gatos, CA
  • Tucson, AZ
  • Santa Clara, CA
  • 13478 Briar Ct, Saratoga, CA 95070 (408) 741-0801

Emails

c***[email protected]

Resumes

Resumes

Cary Coutant Photo 1

Member Of Technical Staff At Google

Position:
Member of Technical Staff at Google
Location:
San Francisco Bay Area
Industry:
Computer Software
Work:
Google since Aug 2007
Member of Technical Staff
Hewlett-Packard Co. Aug 1981 - May 2007
Senior Software Engineer
Education:
University of Arizona 1977 - 1981
M.S., Computer Science Furman University 1974 - 1977
B.S., Physics

Publications

Us Patents

System And Method For Optimization Of Shared Data

US Patent:
6665671, Dec 16, 2003
Filed:
Apr 4, 2001
Appl. No.:
09/826273
Inventors:
Cary A. Coutant - Saratoga CA
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 1730
US Classification:
707 8, 7071041, 709229, 711213, 717164
Abstract:
A system and method are described for optimizing access of shared data. Briefly described, in architecture, the system can be implemented as follows. The data load optimization system includes a linkage table that contains at least one unresolved data module accessible by a computer program. The linkage table also includes a load determination logic that determines the location of the unresolved data module at load time of the computer program, and a load modification logic that modifies the load instruction in the computer program, at load time of the computer program, to directly load the unresolved data module at the location. The present invention can also be viewed as providing a method for efficiently accessing shared data. In this regard, the method can be broadly summarized by the following steps: (1) generating a linkage table for the computer program when a load instruction in the computer program loads an unresolved data that is not in a same load module as the computer program; (2) determining a location of the unresolved data at load time of the computer program; and (3) modifying the load instruction at load time of the computer program to directly load the unresolved data at the location.

Method And Apparatus For Managing Access To Out-Of-Frame Registers

US Patent:
6665793, Dec 16, 2003
Filed:
Dec 28, 1999
Appl. No.:
09/473820
Inventors:
Achmed Rumi Zahir - Menlo Park CA
Cary A. Coutant - Saratoga CA
Carol L. Thompson - San Jose CA
Jonathan K. Ross - Woodinville WA
Assignee:
Institute for the Development of Emerging Architectures, L.L.C. - Cupertino CA
International Classification:
G06F 9312
US Classification:
712228, 711132, 712202, 712225
Abstract:
Method and apparatus for managing access to registers that are outside a current register stack frame are disclosed. An instruction execution unit in a processor receives an instruction to be executed. A processor includes a register stack, the register stack including a plurality of register stack frames. Each of the register stack frames includes zero or more registers. One of the plurality of register stack frames is a current register stack frame. When execution of the instruction requires writing to a register referenced by the instruction, the instruction execution unit determines whether the register referenced by the instruction is within the current register stack frame. If the instruction execution unit determines that the register is not within the current register stack frame, the instruction execution unit does not execute the instruction and may, for example, generate a fault. The instruction execution unit executes the instruction is the instruction execution unit determines that the register is within the current register stack frame. When execution of the instruction requires reading from a register referenced by the instruction, the instruction execution unit executes the instruction whether or not the register referenced by the instruction is within the current register stack frame.

Dynamic Registration Of Dynamically Generated Code And Corresponding Unwind Information

US Patent:
6993750, Jan 31, 2006
Filed:
Dec 13, 2001
Appl. No.:
10/016955
Inventors:
Robert Hundt - Santa Clara CA, US
Muralitharan Vijayasundaram - Santa Clara CA, US
Cary A. Coutant - Saratoga CA, US
Kannan Narasimhan - Allen TX, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 9/44
US Classification:
717130, 717127, 717131, 717158, 719328
Abstract:
A method and system for enabling the registration of dynamically generated code and corresponding unwind information. In one embodiment, the present invention creates a module which includes data related to dynamically generated code and corresponding unwind information. The present embodiment also provides an application program interface which allows the data to be registered such that dynamic registration of the dynamically generated code and the corresponding unwind information is enabled.

Method And Apparatus For Switching Between Multiple Implementations Of A Routine

US Patent:
7065754, Jun 20, 2006
Filed:
Oct 31, 2000
Appl. No.:
09/702593
Inventors:
Cary A. Coutant - Saratoga CA, US
Carol L. Thompson - San Jose CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 9/45
US Classification:
717146, 717164, 717166, 712 36
Abstract:
Method and apparatus for switching between multiple implementations of a routine. A plurality of implementations of a routine are compiled into respective object code modules. In one embodiment, each implementation of the routine is adapted for a particular hardware configuration. The different object code modules are associated with respective sets of hardware characteristics and with the name of the routine. When the application program and library are loaded into memory of the computer system, a references to the routine are resolved using the sets of hardware characteristics and the hardware configuration of the system.

Method And Apparatus For Managing Access To Out-Of-Frame Registers

US Patent:
7272702, Sep 18, 2007
Filed:
Nov 6, 2003
Appl. No.:
10/702252
Inventors:
Achmed Rumi Zahir - Menlo Park CA, US
Cary A. Coutant - Saratoga CA, US
Carol L. Thompson - San Jose CA, US
Jonathan K. Ross - Woodinville WA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 9/34
US Classification:
712220
Abstract:
Method and apparatus for managing access to registers that are outside a current register stack frame are disclosed. An instruction execution unit in a processor receives an instruction to be executed. A processor includes a register stack, the register stack including a plurality of register stack frames. Each of the register stack frames includes zero or more registers. One of the plurality of register stack frames is a current register stack frame. When execution of the instruction requires writing to a register referenced by the instruction, the instruction execution unit determines whether the register referenced by the instruction is within the current register stack frame. If the instruction execution unit determines that the register is not within the current register stack frame, the instruction execution unit does not execute the instruction and may, for example, generate a fault. The instruction execution unit executes the instruction is the instruction execution unit determines that the register is within the current register stack frame. When execution of the instruction requires reading from a register referenced by the instruction, the instruction execution unit executes the instruction whether or not the register referenced by the instruction is within the current register stack frame.

Method And Apparatus For Managing Access To Out-Of-Frame Registers

US Patent:
7334112, Feb 19, 2008
Filed:
Nov 6, 2003
Appl. No.:
10/702355
Inventors:
Achmed Rumi Zahir - Menlo Park CA, US
Cary A. Coutant - Saratoga CA, US
Carol L. Thompson - San Jose CA, US
Jonathan K. Ross - Woodinville WA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 9/312
US Classification:
712220
Abstract:
Method and apparatus for managing access to registers that are outside a current register stack frame are disclosed. An instruction execution unit in a processor receives an instruction to be executed. A processor includes a register stack, the register stack including a plurality of register stack frames. Each of the register stack frames includes zero or more registers. One of the plurality of register stack frames is a current register stack frame. When execution of the instruction requires writing to a register referenced by the instruction, the instruction execution unit determines whether the register referenced by the instruction is within the current register stack frame. If the instruction execution unit determines that the register is not within the current register stack frame, the instruction execution unit does not execute the instruction and may, for example, generate a fault. The instruction execution unit executes the instruction is the instruction execution unit determines that the register is within the current register stack frame. When execution of the instruction requires reading from a register referenced by the instruction, the instruction execution unit executes the instruction whether or not the register referenced by the instruction is within the current register stack frame.

Method And System For Debugging Merged Functions Within A Program

US Patent:
8429632, Apr 23, 2013
Filed:
Jun 30, 2009
Appl. No.:
12/495625
Inventors:
Cary A. Coutant - Saratoga CA, US
Christopher G. Demetriou - Redwood City CA, US
Assignee:
Google Inc. - Mountain View CA
International Classification:
G06F 9/45
US Classification:
717151, 717124, 717127, 717128, 717129, 717131
Abstract:
A method for debugging the object code of a program is disclosed. While executing an object code segment on an information processing device, a debugger receives a location identifier associated with the object code segment and identifies a call site within a call stack of the program using the location identifier. The call site is responsible for invoking the execution of the object code segment. Next, the debugger scans a call table for an entry of the call site that includes information for locating a debugging information entry within a compilation unit of the program. The debugger retrieves the debugging information entry from the compilation unit using the location information and identifies a unique one of multiple different source code segments as the one corresponding to the object code segment using a source code segment identifier in the debugging information entry.

Method And System For Optimizing The Object Code Of A Program

US Patent:
8458681, Jun 4, 2013
Filed:
Jun 30, 2009
Appl. No.:
12/495649
Inventors:
Cary A. Coutant - Saratoga CA, US
Christopher G. Demetriou - Redwood City CA, US
Assignee:
Google Inc. - Mountain View CA
International Classification:
G06F 9/45
US Classification:
717151, 717124, 717127, 717128, 717129, 717131
Abstract:
A method for optimizing the object code of a program is disclosed. A compiler generates, respectively, first and second object code segments for first and second source code segments of the program. If the two object code segments are determined to be identical, the compiler generates first and second debugging information entries in a compilation unit of the program and both entries include information for locating the first object code segment. The compiler inserts two entries into a call table in the compilation unit, each entry including information for locating a respective call site that invokes a respective source code segment within a call stack of the program and information for locating a respective debug information entry. The call table is used for associating an operation within the first object code segment with one of the first and second source code segments at runtime.
Control profile
Cary A Coutant from Saratoga, CA, age ~67 Get Report