Search

Diane Meirowitz Phones & Addresses

  • 5815 Cactus Valley Rd, Charlotte, NC 28277
  • 22 Fisher Rd, Arlington, MA 02476 (781) 641-3014
  • Acton, MA
  • Matthews, NC

Work

Company: Sun microsystems Dec 1996 to Feb 2010 Position: Senior staff engineer

Education

Degree: Master of Science, Masters School / High School: University of New Hampshire 1983 to 1985 Specialities: Computer Science

Skills

Compilers • Linux • Solaris • Sparc Assembly • X86 Assembly • C++ • Fortran • Optimization • Optimizations • Algorithms • Software Engineering • Distributed Systems • Unix • Multithreading • Shell Scripting • Oop • Parallel Computing • Scalability • Debugging • Design Patterns • System Architecture • Software Design • Software Development • Compiler Development • Object Oriented Design • Sun • Object Oriented Programming • High Performance Computing • X86

Languages

English

Interests

Ukulele • Yoga • Literature • Swing and Ballroom Dancing • Hiking • Running

Industries

Computer Software

Resumes

Resumes

Diane Meirowitz Photo 1

Principal Software Engineer

View page
Location:
Charlotte, NC
Industry:
Computer Software
Work:
Sun Microsystems Dec 1996 - Feb 2010
Senior Staff Engineer

Oracle Dec 1996 - Feb 2010
Principal Software Engineer

Thinking Machines Corporation Nov 1994 - Nov 1996
Consulting Engineer

Kendall Square Research Jun 1993 - Oct 1994
Member of Technical Staff

Hewlett-Packard Dec 1991 - Jun 1993
Principal Software Engineer
Education:
University of New Hampshire 1983 - 1985
Master of Science, Masters, Computer Science
University of New Hampshire 1980 - 1983
Bachelors, Bachelor of Science
University of New Hampshire
Bachelors
Skills:
Compilers
Linux
Solaris
Sparc Assembly
X86 Assembly
C++
Fortran
Optimization
Optimizations
Algorithms
Software Engineering
Distributed Systems
Unix
Multithreading
Shell Scripting
Oop
Parallel Computing
Scalability
Debugging
Design Patterns
System Architecture
Software Design
Software Development
Compiler Development
Object Oriented Design
Sun
Object Oriented Programming
High Performance Computing
X86
Interests:
Ukulele
Yoga
Literature
Swing and Ballroom Dancing
Hiking
Running
Languages:
English

Publications

Us Patents

Systems And Methods For Uniquely Defining Fortran Run Time Type Descriptors For Polymorphic Entities

View page
US Patent:
20130080736, Mar 28, 2013
Filed:
Sep 26, 2011
Appl. No.:
13/245060
Inventors:
DIANE R. MEIROWITZ - CHARLOTTE NC, US
IAIN G. BASON - WINCHESTER MA, US
Assignee:
ORACLE INTERNATIONAL CORPORATION - REDWOOD CITY CA
International Classification:
G06F 12/10
US Classification:
711208, 711E12059
Abstract:
Systems and methods disclosed herein uniquely define each type of Fortran type descriptor within an executable file or shared library to allow for a rapid determination of how the dynamic type of one object (e.g., a first polymorphic entity) relates to that of another object (e.g., a second polymorphic entity) while allowing for the lazy loading of shared libraries. In one aspect, type descriptor definitions are instantiated (e.g., during compile-time) in each object file in which polymorphic entities are defined, each type descriptor definition is marked with a singleton attribute, and each group of common type descriptor definitions is associated with a COMDAT group to ensure that only a single copy of each type descriptor is defined in a corresponding executable file at a particular address in memory to which polymorphic entities can reference. Type descriptor addresses can be compared to determine dynamic type relations between polymorphic entities.

Factored Assert Chains

View page
US Patent:
7272829, Sep 18, 2007
Filed:
Jul 22, 2003
Appl. No.:
10/625334
Inventors:
Diane R. Meirowitz - Arlington MA, US
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 9/45
US Classification:
717155, 717140, 717148, 717154
Abstract:
Factored assert chains allow for improved tracking of implicit information in a computer program. The compiler may generate assert statements at various points in the program where there is implicit information. The dominator tree for the program or section of program may then be constructed. Then φ-nodes may be inserted throughout a control flow graph. Following that, for each statement in the program or section of program, an assert chain may be constructed from each use to the most recent available assert statement for the variable. Then, if the statement is an assert statement, each use may be kept track of as a mapping to an assertion, otherwise a mapping of any reference to an assert statement for each definition may be deleted. This may then iterate through the dominator tree. At the end, a series of factored assert chains remains, which may be utilized by the compiler to improve the efficiency of generated code.
Diane R Meirowitz from Charlotte, NC, age ~66 Get Report