Search

Mark R Hahnenberg

from San Francisco, CA
Age ~34
Get Report
Related to:
Jennifer J Hahnenberg, 45Frank A Hahnenberg, 43Timothy A Hahnenberg, 41Richard J Hahnenberg, 74Zelma F HahnenbergRuth J Stanton, 67Fay HahnenbergEmil J Hahnenberg
Connected to:
Edward J Hahnenberg, 82Scott Hahnen, 64John C Hahnenfeld, 60Debbie L Hahnenkamp, 69Gary W Hahnenkamp, 69Tammy J Hahner, 58Nancy E Hahon, 77Ann M Hahr, 64Ariel M Hahs, 39Patty L Hahs, 69

Mark Hahnenberg Phones & Addresses

  • 3947 18Th St APT 4, San Francisco, CA 94114
  • Pittsburgh, PA
  • Spartanburg, SC

Work

Company: Airtable Dec 2018 Position: Software engineer

Education

Degree: Bachelors, Bachelor of Science School / High School: Carnegie Mellon University 2007 to 2011 Specialities: Computer Science

Skills

Compilers • Compiler Construction • Virtual Machines • C++ • C • Java • Javascript • Python • Objective C • Ios Development • Swift • Ruby • Play Framework

Languages

English

Industries

Computer Software

Resumes

Resumes

Mark Hahnenberg Photo 1

Software Engineer

View page
Location:
333 10Th St, San Francisco, CA 94103
Industry:
Computer Software
Work:
Airtable
Software Engineer
Nylas Jul 2016 - Nov 2018
Infrastructure Engineer
Facebook Aug 2014 - Apr 2016
Software Engineer
Apple Jun 2011 - Aug 2014
Software Engineer
Education:
Carnegie Mellon University 2007 - 2011
Bachelors, Bachelor of Science, Computer Science Paul M. Dorman High School 2007
Skills:
Compilers
Compiler Construction
Virtual Machines
C++
C
Java
Javascript
Python
Objective C
Ios Development
Swift
Ruby
Play Framework
Languages:
English

Publications

Us Patents

Split Heap Garbage Collection

View page
US Patent:
20140047209, Feb 13, 2014
Filed:
Aug 23, 2012
Appl. No.:
13/593422
Inventors:
Filip J. Pizlo - Capitola CA, US
Geoffrey Garen - San Jose CA, US
Mark Hahnenberg - San Francisco CA, US
International Classification:
G06F 12/02
US Classification:
711173, 711E12002
Abstract:
A method and an apparatus to scan a stack for references to a heap used in executing a code via the heap are described. The heap may be allocated with fixed and varied sized slots. Each varied sized slot may be referenced by at most one fixed sized slot. Which slots are live may be identified based on the references in the stack. A fixed slot can be live if referenced by the stack. A fixed or varied slot referenced by a live slot can also be live. Varied sized slots referenced by the stack may be identified as pinned. The heap may be de-fragmented to reclaim fixed sized slots which are not live without moving live fixed sized slots and to reclaim varied sized slots which are neither live nor pinned by moving live varied slots.

Size Dependent Type In Accessing Dynamically Typed Array Objects

View page
US Patent:
20150067658, Mar 5, 2015
Filed:
May 16, 2014
Appl. No.:
14/280377
Inventors:
- Cupertino CA, US
Mark Hahnenberg - San Francisco CA, US
Assignee:
Apple Inc. - Cupertino CA
International Classification:
G06F 9/455
US Classification:
717148
Abstract:
A method and an apparatus for providing a flat array type in an object model for dynamically typed programs are described. Whether an array object is of a flat array type can be dynamically tracked for a dynamic language based program. Array elements of an array object of the flat array type may be stored in an inline storage within an object cell of the array object. The inline storage may be limited by available memory space between adjacent object cells. The flat array type of an array object may be detected based on whether the inline storage has sufficient memory space to store elements of the array. An array object of the flay array type may allow array elements of the array object to be accessed within a object cell without additional memory loading via a pointer stored in the object cell.
Control profile
Mark R Hahnenberg from San Francisco, CA, age ~34 Get Report