Richard Anthony Ferreri

age ~60

from Fort Collins, CO

Get Report

Also known as:

Richard A Ferreri
Rick A Ferreri
Dick A Ferreri

Phone and address:: 3021 Morab Ct, Fort Collins, CO 80525
(970)2261270

Connected to:

Richard Ferreri Phones & Addresses

3021 Morab Ct, Fort Collins, CO 80525 • (970)2261270
Ft Collins, CO
Albuquerque, NM
Mesa, AZ

Work

Company:

Hewlett-packard
1988 to 2005
Position:

Os developer and cad tool developer

Education

School / High School:

The University of New Mexico
1983 to 1987

Skills

Processors • Cad • Eda • Asic • Soc • Architecture • Microprocessors • Computer Aided Design • Static Timing Analysis • Tcl • Very Large Scale Integration • Architectures • Physical Design • Cmos • Rtl Design • System on A Chip • Timing Closure • Logic Design • Application Specific Integrated Circuits • Vlsi

Industries

Semiconductors

Resumes

Principal Engineer

view source

Location:

Fort Collins, CO

Industry:

Semiconductors

Work:

Hewlett-Packard 1988 - 2005
Os Developer and Cad Tool Developer
Hewlett-Packard 1988 - 2004
Computer Engineer
Intel Corporation 1988 - 2004
Principal Engineer

Education:

The University of New Mexico 1983 - 1987
University of New Mexico School of Engineering
Bachelors, Bachelor of Science, Computer Engineering

Skills:

Processors
Cad
Eda
Asic
Soc
Architecture
Microprocessors
Computer Aided Design
Static Timing Analysis
Tcl
Very Large Scale Integration
Architectures
Physical Design
Cmos
Rtl Design
System on A Chip
Timing Closure
Logic Design
Application Specific Integrated Circuits
Vlsi

Us Patents

Dynamically Configurable Generic Container
view source
US Patent:

20020111699, Aug 15, 2002
Filed:

Feb 9, 2001
Appl. No.:

09/779968
Inventors:

Bruno Melli - Ft Collins CO, US
Richard Ferreri - Ft Collins CO, US
International Classification:

G05B011/01
US Classification:

700/018000
Abstract:

A method and system are disclosed for creating and using a generic container as a data structure used in a software program. A selected data structure may be specified at start-up time or run-time using a mapping table that tracks the specified data structures for each generic container used by the program. Existing data structures are abstracted to a generic interface for use with the container. The program interacts with the generic container using the generic interface, which allows the container to add, delete, and look up data stored in the container and to retrieve a key used by the container. A program uses an object factory to create an instance of a generic container having the generic interface. At run-time, the object factory refers to the mapping table to determine which specific data structure is used for each generic container.

Verifying A Program Version
view source
US Patent:

20030154470, Aug 14, 2003
Filed:

Feb 14, 2002
Appl. No.:

10/074030
Inventors:

John Applin - Fort Collins CO, US
Richard Ferreri - Fort Collins CO, US
International Classification:

G06F009/44
US Classification:

717/170000
Abstract:

A version for each of a plurality of object files in a computer program is verified by identifying a version of an object file of the plurality of object files in the computer program and comparing the identified version to an initial version. In response to the identified version being different than the initial version, an alert is generated.

System And Methods Involving A Data Structure Searchable With O(Logn) Performance
view source
US Patent:

20050060314, Mar 17, 2005
Filed:

Apr 22, 2004
Appl. No.:

10/829488
Inventors:

Lanzhong Wang - Fort Collins CO, US
Richard Ferreri - Fort Collins CO, US
John Applin - Fort Collins CO, US
International Classification:

G06F007/00
US Classification:

707007000
Abstract:

One embodiment of the invention involves a data structure that is stored on a computer-readable medium comprising a sorted portion that contains a plurality of entries that are sorted into an order, an unsorted portion that contains a plurality of entries that have not been sorted, and a boundary that separates the sorted portion and the unsorted portion. The sorted portion of the data structure may be searched with O(logN) performance while an entry is added to the unsorted portion.