Search

Nedim T Fresko

from San Francisco, CA
Age ~53
Get Report
Related to:
Iris Aluf Medina, 53
Connected to:
Wendy Fresn, 50Karen H Fresne, 62Kathy M Fresne, 67Arturo F Fresnedo, 92Johanna E Fresneda, 50Roberto Fresneda, 67Jeanette Fresnel, 34Ria G Fresnoza, 44Moreen M Freso, 75Anthony R Fresolo, 36

Nedim Fresko Phones & Addresses

  • 171 Miraloma Dr, San Francisco, CA 94127 (415) 731-0845
  • 1366 5Th St, San Francisco, CA 94122 (415) 242-1327 (415) 731-0845
  • 121 Lincoln Way, San Francisco, CA 94122 (415) 242-1327 (415) 731-0845
  • Glen Ellen, CA
  • Campbell, CA
  • Mountain View, CA
  • West Lafayette, IN
  • Chicago, IL
  • 121 Lincoln Way, San Francisco, CA 94122 (415) 713-7037

Work

Position: Sales Occupations

Emails

n***[email protected]

Public records

Vehicle Records

Nedim Fresko

View page
Address:
121 Lincoln Way, San Francisco, CA 94122
Phone:
(415) 378-7795
VIN:
WBAVC53557FZ77057
Make:
BMW
Model:
3 SERIES
Year:
2007

Resumes

Resumes

Nedim Fresko Photo 1

Vice President, Alexa Devices And Developer Technologies

View page
Location:
San Francisco, CA
Industry:
Computer Software
Work:
Lab126, an Amazon Company - Cupertino since Jul 2012
Director, Engineering
Research In Motion - Redwood Shores, California Feb 2012 - Jul 2012
VP, Engineering
Research In Motion - San Francisco Bay Area Nov 2009 - Mar 2012
Senior Director, Engineering
Research In Motion Limited - San Francisco Bay Area 2007 - Oct 2009
Director, Engineering
Sun Microsystems - California, USA Nov 2006 - Oct 2007
Distinguished Engineer
Education:
Purdue University 1994 - 1996
M.S., Computer Science Technion-Machon Technologi Le' Israel 1989 - 1994
Bachelor of Science, Computer Engineering Robert Koleji 1982 - 1988
High School
Skills:
Java
Software Development
Android
Architecture
Open Source
Product Development
System Software
Mobile
Innovation
Languages:
English
Turkish
Hebrew
Nedim Fresko Photo 2

Nedim Fresko

View page

Publications

Us Patents

Method And Apparatus For Performing Pre-Allocation Of Memory To Avoid Triggering Garbage Collection Operations

View page
US Patent:
6349312, Feb 19, 2002
Filed:
Jul 23, 1999
Appl. No.:
09/360187
Inventors:
Nedim Fresko - San Francisco CA
Dean R. E. Long - Boulder Creek CA
Assignee:
Sun Microsystems, Inc. - Palo Alto CA
International Classification:
G06F 1202
US Classification:
707205, 711170, 711173, 707206
Abstract:
The present invention provides a mechanism for enabling memory allocation operations to be deterministic. According to the invention, determinism is achieved by first pre-allocating a contiguous memory space, and then using that memory space to perform subsequent memory allocation operations. Because the subsequent memory allocation operations are performed using memory space that has already been allocated, it is ensured that the allocation operations will not trigger a garbage collection operation. Also, because the pre-allocated memory space is contiguous, there will be no fragmentation concerns. Thus, the present invention eliminates the two major causes of non-constant allocation times. By doing so, the present invention makes it possible to achieve determinism in a dynamic memory allocation system.

Methods And Apparatus For Linking A Program For Remote Execution

View page
US Patent:
6453467, Sep 17, 2002
Filed:
Dec 1, 2000
Appl. No.:
09/726609
Inventors:
Peter W. Madany - Fremont CA
Richard Tuck - San Francisco CA
Nedim Fresko - San Francisco CA
Assignee:
Sun Microsystems, Inc. - Palo Alto CA
International Classification:
G06F 944
US Classification:
717165, 717167
Abstract:
A linkage editor executing at a server receives instructions for packaging software components that are required for program execution at a client. The linkage editor generates an output file by iteratively analyzing the program for references to other software components and extracting those components from their parent classes. The linkage editor sends the completed output file to an interface task, which transmits it to the client.

Methods And Apparatus For Packaging A Program For Remote Execution

View page
US Patent:
6493870, Dec 10, 2002
Filed:
Mar 20, 1998
Appl. No.:
09/044900
Inventors:
Peter W. Madany - Fremont CA
Richard Tuck - San Francisco CA
Nedim Fresko - San Francisco CA
Hania Gajewska - Woodside CA
Assignee:
Sun Microsystems, Inc. - Palo Alto CA
International Classification:
G06F 944
US Classification:
717165, 717166, 717107, 709332, 709217, 709219
Abstract:
A task executing at a server receives a request to package program code for remote execution on a client, and determines the software components that already reside at the client. The task uses this information to formulate a set of instructions to another task that creates the package. The created package is transmitted to the client, and program execution begins.

Method And Apparatus For Pre-Processing And Packaging Class Files

View page
US Patent:
6530080, Mar 4, 2003
Filed:
Jul 19, 1999
Appl. No.:
09/356589
Inventors:
Nedim Fresko - San Francisco CA
Richard Tuck - San Francisco CA
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 944
US Classification:
717166, 717143
Abstract:
A method and apparatus for pre-processing and packaging class files. Embodiments remove duplicate information elements from a set of class files to reduce the size of individual class files and to prevent redundant resolution of the information elements. Memory allocation requirements are determined in advance for the set of classes as a whole to reduce the complexity of memory allocation when the set of classes are loaded. The class files are stored in a single package for efficient storage, transfer and processing as a unit. In an embodiment, a pre-processor examines each class file in a set of class files to locate duplicate information in the form of redundant constants contained in a constant pool. The duplicate constant is placed in a separate shared table, and all occurrences of the constant are removed from the respective constant pools of the individual class files. During pre-processing, memory allocation requirements are determined for each class file, and used to determine a total allocation requirement for the set of class files.

Real Time Synchronization In Multi-Threaded Computer Systems

View page
US Patent:
6587955, Jul 1, 2003
Filed:
Feb 1, 2000
Appl. No.:
09/495820
Inventors:
William Foote - Cupertino CA
Dean Roy Ernest Long - Boulder Creek CA
Nedim Fresko - San Francisco CA
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 112
US Classification:
713400, 714 39, 709107
Abstract:
Methods and apparatus for implementing priority inversion avoidance protocols and deterministic locking where an API is used to select objects in a multi-threaded computer system are disclosed. In one aspect of the invention, an enhanced monitor is associated with one or more selected objects by way of an associated API. The enhanced monitor is arranged to set behavior for a lock associated with the selected objects as determined by a user defined behavior object included within the enhanced monitor. In this arrangement, only the selected one or more objects are associated with the enhanced monitor.

System And Method For Reducing The Footprint Of Preloaded Classes

View page
US Patent:
6658492, Dec 2, 2003
Filed:
Mar 20, 1998
Appl. No.:
09/045508
Inventors:
Hideya Kawahara - Mountain View CA
Nedim Fresko - San Francisco CA
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 900
US Classification:
709332, 717166, 717159
Abstract:
A method and system that reduces the space allocated for internal data structures by a runtime engine. The internal data structures store member information for preloaded classes used by applications executed by the runtime engine. The system determines the different types of internal data structures represented in the classes and identifies thee possible values of each types members. The system next determines the amount of space required to store the values for each type in a respective value table and the number of bits needed to index each entry of that table. The system determines based on the stored information whether occurrences of a member are optimally represented as a set of value table indices and a value table or, in the conventional manner, as a general variable that stores the members value for each occurrence. The system then emits appropriate information for the member and its parent data structure.

Method And Apparatus For Implementing Modular Garbage Collectors

View page
US Patent:
6836782, Dec 28, 2004
Filed:
Apr 17, 2001
Appl. No.:
09/836927
Inventors:
Nedim Fresko - San Francisco CA
Dean R. E. Long - Boulder Creek CA
Christopher J. Plummer - San Martin CA
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 1730
US Classification:
707206, 707103, 707 1, 718104
Abstract:
Methods and apparatus for efficiently enabling garbage collectors to be swapped into and out of virtual machine environments are disclosed. According to one aspect of the present invention, an interface for reclaiming memory in a multi-threaded virtual machine environment that has a virtual machine includes a first module that is associated with the virtual machine and a second module that is separate from the first module but interfaces with the first module. The first module includes a first routine for initiating a garbage collection process within the virtual machine environment, a second routine for scanning roots associated with the virtual machine environment, and a third routine for following roots through objects associated with the virtual machine environment. The second module includes a fourth routine for initializing a heap in the virtual machine environment, a fifth routine for allocating an object in the virtual machine environment, and a sixth routine for performing the garbage collection process. In one embodiment, the second module also includes a seventh routine for implementing read and write barriers for the garbage collection process.

Method And Apparatus For Creating Efficient Native Methods That Extend A Bytecode Interpreter

View page
US Patent:
6886157, Apr 26, 2005
Filed:
May 25, 2001
Appl. No.:
09/865963
Inventors:
Dean R. E. Long - Boulder Creek CA, US
Christopher J. Plummer - San Martin CA, US
Nedim Fresko - San Francisco CA, US
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F009/45
US Classification:
717151, 717153, 717165
Abstract:
Methods, apparatus and computer program products are disclosed for a method of invoking a native method in a Java virtual machine (“JVM”). A special-purpose fast interface, executing in conjunction with an interpreter loop, for native methods reduces C stack recursion in the JVM. The interface performs as an extension to the interpreter loop component in the JVM in that a native method, invoked via the special-purpose interface, is able to modify the interpreter loop state if necessary. This is done without adding new bytecode instructions. A method of executing a native method in a Java virtual machine is described. The JVM first determines whether a native method is to be handled by a special native interface or one of multiple other native interfaces. If it is determined that the method is to be handled by the special native interface, the method is invoked and passed arguments enabling it to access the state of the JVM. The method is then executed.
Control profile
Nedim T Fresko from San Francisco, CA, age ~53 Get Report