Professional Records
License Records
Ivan Posva
Address:
2040 W Middlefield Rd APT 30, Mountain View, CA 94043
License #:
A5058887
Category:
Airmen
Ivan Posva Phones & Addresses
-
2040 W Middlefield Rd APT 30, Mountain View, CA 94043 (650) 714-8253
-
Menlo Park, CA
-
Santa Clara, CA
Publications
Us Patents
System Of Type Inference For Tuple Graph Programs Method Of Executing A Tuple Graph Program Across A Network
View pageUS Patent:
20190065154, Feb 28, 2019
Filed:
Aug 24, 2017
Appl. No.:
15/685048
Inventors:
- Mountain View CA, US
Matthew Rosencrantz - Menlo Park CA, US
Sanjay Ghemawat - Mountainview CA, US
Srdjan Petrovic - Palo Alto CA, US
Ivan Posva - Mountain View CA, US
Matthew Rosencrantz - Menlo Park CA, US
Sanjay Ghemawat - Mountainview CA, US
Srdjan Petrovic - Palo Alto CA, US
Ivan Posva - Mountain View CA, US
International Classification:
G06F 9/44
G06F 17/30
G06F 9/45
G06F 17/30
G06F 9/45
Abstract:
A programming model provides a method for type inference in programming operations. Information defining one or more attributes of an operation is received, the information specifying a field including a field name and a field type identifier for each of the attributes. Constraints for the operation are determined at least based on the attributes, wherein the constraints restrict at least one of a type of input for the operation or a type of output for the operation. Information defining an input for the operation is received, and it is determined, based on the constraints and the received information defining the input, the type of output for the operation. The type of output is associated with an output for the operation.
Method For Intra-Subgraph Optimization In Tuple Graph Programs
View pageUS Patent:
20190065162, Feb 28, 2019
Filed:
Aug 24, 2017
Appl. No.:
15/685055
Inventors:
- Mountain View CA, US
Matthew Rosencrantz - Menlo Park CA, US
Sanjay Ghemawat - Mountainview CA, US
Srdjan Petrovic - Palo Alto CA, US
Ivan Posva - Mountain View CA, US
Matthew Rosencrantz - Menlo Park CA, US
Sanjay Ghemawat - Mountainview CA, US
Srdjan Petrovic - Palo Alto CA, US
Ivan Posva - Mountain View CA, US
International Classification:
G06F 9/45
G01R 31/3183
G01R 31/3183
Abstract:
A programming model generates a graph for a program, the graph including a plurality of nodes and edges, wherein each node of the graph represents an operation and edges between the nodes represent streams of data input to and output from the operations represented by the nodes. The model determines where in a distributed architecture to execute the operations represented by the nodes. Such determining may include determining which nodes have location restrictions, assigning locations to each node having a location restriction based on the restriction, and partitioning the graph into a plurality of subgraphs, the partitioning including assigning locations to nodes without location restrictions in accordance with a first set of constraints, wherein each node within a particular subgraph is assigned to the same location. Each of the subgraphs is executed at its assigned location in a respective single thread.
Method Of Executing A Tuple Graph Program Across A Network
View pageUS Patent:
20190068504, Feb 28, 2019
Filed:
Aug 24, 2017
Appl. No.:
15/685022
Inventors:
- Mountain View CA, US
Matthew Rosencrantz - Menlo Park CA, US
Sanjay Ghemawat - Mountainview CA, US
Srdjan Petrovic - Palo Alto CA, US
Ivan Posva - Mountain View CA, US
Matthew Rosencrantz - Menlo Park CA, US
Sanjay Ghemawat - Mountainview CA, US
Srdjan Petrovic - Palo Alto CA, US
Ivan Posva - Mountain View CA, US
International Classification:
H04L 12/803
H04L 29/08
H04L 12/24
H04L 29/08
H04L 12/24
Abstract:
A programming model provides a method for executing a program in a distributed architecture. One or more first shards of the distributed architecture execute one or more operations, and sending tuples to at least one second shard, the tuples being part of a stream and being based on the one or more operations. The one or more first shards send a token value to the at least one second shard when the sending of the tuples in the stream is complete. The at least one second shard determines whether a total of the token values matches a number of the one or more first shards, and takes a first action in response to determining that the total of the token values matches the number of the one or more first shards. The first action may include marking the stream as being complete and/or generating a message indicating that the stream is complete.
Per-Selector Dispatch
View pageUS Patent:
20150324291, Nov 12, 2015
Filed:
May 15, 2013
Appl. No.:
13/895267
Inventors:
- Mountain View CA, US
Kevin Scott MILLIKIN - Lystrup, DK
Srdjan MITROVIC - Atherton CA, US
Ivan POSVA - Mountain View CA, US
Florian SCHNEIDER - Aarhus, DK
Kevin Scott MILLIKIN - Lystrup, DK
Srdjan MITROVIC - Atherton CA, US
Ivan POSVA - Mountain View CA, US
Florian SCHNEIDER - Aarhus, DK
International Classification:
G06F 12/08
Abstract:
Aspects of the subject technology relate to a computer-implemented process, including steps for compiling a first method call at a first call site in code of an object-oriented language, wherein the first call site is associated with a first selector, referencing a global cache comprising a plurality of per-selector caches, wherein each of the per-selector caches is indexed based on a corresponding selector identification and identifying a first per-selector cache, from among the plurality of per-selector caches, using the first selector. In certain aspects, the process can further include steps for invoking a method on a first object by performing a lookup in the first per-selector cache using a class associated with the first object to determine if a first target function exists in the first per-selector cache. Systems and computer readable media are also provided.
Implement Inline Cache Using A Data Array
View pageUS Patent:
20150199186, Jul 16, 2015
Filed:
Oct 9, 2012
Appl. No.:
13/648128
Inventors:
- Mountain View CA, US
Kasper Verdich LUND - Aarhus C, DK
Ivan POSVA - Mountain View CA, US
Kasper Verdich LUND - Aarhus C, DK
Ivan POSVA - Mountain View CA, US
Assignee:
GOOGLE INC. - Mountain View CA
International Classification:
G06F 9/45
Abstract:
Methods and systems are provided for implementing an inline cache that uses a data array to perform receiver class checks. The data array contains classes, targets, and counters. The invocation is forwarded to the appropriate target when the checked class matches. On the other hand, an inline cache miss expands the data array with the new receiver class. The inline cache stub counts the invocations for specific classes and stores the count into the data array. The optimizing compiler can generate better code using the call type frequency (e.g., sort checks, limit the number of checks to the most frequently used classes, etc.).
Eager Tokenization Of Programs And Distribution Of Token Sequences To Client
View pageUS Patent:
20150199187, Jul 16, 2015
Filed:
Oct 9, 2012
Appl. No.:
13/648028
Inventors:
- Mountain View CA, US
Kasper Verdich LUND - Aarhus C, DK
Ivan POSVA - Mountain View CA, US
Kasper Verdich LUND - Aarhus C, DK
Ivan POSVA - Mountain View CA, US
Assignee:
Google Inc. - Mountain View CA
International Classification:
G06F 9/45
Abstract:
Methods and systems are provided for increasing the speed at which source code is incrementally compiled by eagerly tokenizing the source code and retaining the sequence of tokens for later use of the compiler. The token sequence may be stored along with a snapshot of the execution state of the program. This snapshot represents the program logic as well as a specific state of the program. The snapshot can be sent to the client, which then recreates the state of the program. Fast startup time of programs on the client is achieved by incrementally compiling only the parts of the program that are executed. Rather than tokenizing the program each time a small portion of it is compiled, the sequence of tokens stored in the snapshot may be used.
Detecting Software Race Conditions
View pageUS Patent:
20110041015, Feb 17, 2011
Filed:
Oct 22, 2010
Appl. No.:
12/910761
Inventors:
Daniel Dwight Grove - Mercer Island WA, US
Ivan Posva - Menlo Park CA, US
Jack H. Choquette - Mountain View CA, US
Jeffrey Gee - Daly City CA, US
Ivan Posva - Menlo Park CA, US
Jack H. Choquette - Mountain View CA, US
Jeffrey Gee - Daly City CA, US
Assignee:
AZUL SYSTEMS, INC. - Mountain View CA
International Classification:
G06F 11/14
G06F 11/00
G06F 11/00
US Classification:
714 471, 714E11112
Abstract:
Detecting a race condition is disclosed. An indication of a store operation to a memory address is received. An identifier of the memory address is stored. The identifier is used to detect an occurrence of a memory operation that is not associated with a previous ordering operation.
Memory Management
View pageUS Patent:
20070067486, Mar 22, 2007
Filed:
Aug 11, 2006
Appl. No.:
11/503388
Inventors:
Gil Tene - San Carlos CA, US
Cliff Click - San Jose CA, US
Michael Wolf - San Francisco CA, US
Ivan Posva - Menlo Park CA, US
Cliff Click - San Jose CA, US
Michael Wolf - San Francisco CA, US
Ivan Posva - Menlo Park CA, US
International Classification:
G06F 15/16
US Classification:
709236000
Abstract:
Improving performance of a computer program is disclosed. A first set of escape data is gathered. A first compiled program is provided using the first set of escape data. A second set of escape data is gathered based on the first compiled program. A second compiled program is provided using the second set of escape data. The second compiled program is more optimized than the first compiled program.