Search

Yann Millen Livis

from Bedminster, NJ
Age ~66
Get Report
Also known as:
Jacob Lifshits
Phone and address:
106 Autumn Ridge Rd, Bedminster, NJ 07921
(908) 719-9714
Related to:
Millen LivisMariana LivisJacob S Lifshits, 66Lyudmila LifshitsMarina Livis, 44
Connected to:
David A Livis, 63Millen Livis, 67Alexander V Livits, 65Helena Livitz, 39Zina M Livitz, 77Alon Livne, 66Hanoch Livneh, 77Caren L Livni, 65Elijahu Livni, 83Norma J Livo, 95

Yann Livis Phones & Addresses

  • 106 Autumn Ridge Rd, Bedminster, NJ 07921 (908) 719-9714
  • Palm Beach Gardens, FL
  • 812 Grand St, Hoboken, NJ 07030
  • Somerset, NJ
  • 106 Autumn Ridge Rd, Bedminster, NJ 07921

Work

Company: Infosource Position: President

Skills

Requirements Gathering • Sdlc • Business Analysis • Requirements Analysis • Equities • Financial Markets • Trading Systems • Software Project Management • Sql • Risk Management • Microsoft Sql Server • It Strategy • Options • Unix • Derivatives • Banking • C • Unix Shell Scripting

Industries

Information Technology And Services

Resumes

Resumes

Yann Livis Photo 1

President

View page
Location:
106 Autumn Ridge Rd, Bedminster, NJ 07921
Industry:
Information Technology And Services
Work:
Infosource
President
Skills:
Requirements Gathering
Sdlc
Business Analysis
Requirements Analysis
Equities
Financial Markets
Trading Systems
Software Project Management
Sql
Risk Management
Microsoft Sql Server
It Strategy
Options
Unix
Derivatives
Banking
C
Unix Shell Scripting

Business Records

Name / Title
Company / Classification
Phones & Addresses
Yann Livis
Principal
Infosource Inc
Business Services at Non-Commercial Site · Nonclassifiable Establishments
106 Autumn Rdg Rd, Bedminster, NJ 07921
Yann Livis
Manager
Vilnius Group LLC
Nonclassifiable Establishments
1610 Presidential Way, West Palm Beach, FL 33401
3330 Fairchild Gdn Ave, West Palm Beach, FL 33410
812 Grand St, Uptown, NJ 07030
2406 Colonial Ave, Lakeland, FL 33801

Publications

Us Patents

Incremental Replication Using Snapshots

View page
US Patent:
20110225382, Sep 15, 2011
Filed:
May 23, 2011
Appl. No.:
13/113870
Inventors:
Kirill MALKIN - Morris Plains NJ, US
Yann LIVIS - Bedminster NJ, US
Assignee:
RELDATA, INC. - Parsippany NJ
International Classification:
G06F 12/16
US Classification:
711162, 711E12103
Abstract:
A first snapshot is taken of a first block storage resource that is initially identical in content to a second block storage resource. A second snapshot of the first block storage resource is taken at a later time. A record is kept of all blocks modified on the first block storage resource. Only those blocks modified between the time of the first and second snapshots are written to the second block storage resource. After all the modified blocks are written to the second block storage resource, a snapshot is taken of the second block storage resource to maintain a consistent snapshot of the second block storage resource in case of communication failure during the next round. The first snapshot is then deleted, the second takes the role of the first, and the next round of replication begins.

Incremental Replication Using Snapshots

View page
US Patent:
20070055835, Mar 8, 2007
Filed:
Sep 6, 2006
Appl. No.:
11/470542
Inventors:
Kirill Malkin - Morris Plains NJ, US
Yann Livis - Bedminster NJ, US
Assignee:
RELDATA, INC. - Parsippany NJ
International Classification:
G06F 12/16
US Classification:
711162000
Abstract:
A first snapshot is taken of a first block storage resource that is initially identical in content to a second block storage resource. A second snapshot of the first block storage resource is taken at a later time. A record is kept of all blocks modified on the first block storage resource. Only those blocks modified between the time of the first and second snapshots are written to the second block storage resource. After all the modified blocks are written to the second block storage resource, a snapshot is taken of the second block storage resource to maintain a consistent snapshot of the second block storage resource in case of communication failure during the next round. The first snapshot is then deleted, the second takes the role of the first, and the next round of replication begins.

Method And System For Libfabric Atomics-Based Lockless Cluster-Wide Shared Memory Access Api In A Distributed System

View page
US Patent:
20220413743, Dec 29, 2022
Filed:
Jun 29, 2021
Appl. No.:
17/362587
Inventors:
- Houston TX, US
Yann Livis - Bedminster NJ, US
Dmitry L. Ivanov - Branchburg NJ, US
International Classification:
G06F 3/06
Abstract:
The system allocates, in a distributed system comprising a plurality of nodes, a plurality of portions of memory which comprise shared remote memory content. The system registers the allocated portions with an operating system to be accessed via RDMA. The system accesses, by a first node, the allocated portions to obtain a local copy. The system performs an atomic operation on one or more bits of the shared remote memory content via libfabric atomic application programming interface calls, by one or more of: updating the one or more bits based on a new value and an offset; retrieving, from the shared remote memory content based on the offset, a current value of the one or more bits prior to the updating; and performing an action on the shared remote memory content based on a comparison of the retrieved current value with an expected value in the local copy.

Method And System For Persistent Partitionable Distributed Map Using Sparse Arrays And Sparse Ordered Two-Bit Bitmaps In Shared Memory

View page
US Patent:
20220405006, Dec 22, 2022
Filed:
Jun 22, 2021
Appl. No.:
17/355000
Inventors:
- Houston TX, US
Yann Livis - Bedminster NJ, US
Oleg Neverovitch - Hillsborough NJ, US
International Classification:
G06F 3/06
Abstract:
One aspect facilitates a global map in a distributed system. The system generates a first data structure which comprises key-value pairs, wherein, in a respective key-value pair, the respective key is an integer and the respective value comprises a pointer to a sparse array which includes a bitmap (such as an ordered two-bit bitmap). The system stores the first data structure as a first partition of the global map. The system searches, based on a pattern, the first data structure to obtain a first value. If the first value comprises a two-bit bitmap, the system converts, based on the pattern, the first value to a two-dimensional bitmap, and performs a function on the first value to obtain a first result. The system uses the first value or the first result as metadata to execute a read or write operation in a filesystem associated with the distributed system.

Linearized Dynamic Storage Pool

View page
US Patent:
20150019807, Jan 15, 2015
Filed:
Jul 10, 2014
Appl. No.:
14/328423
Inventors:
- Milpitas CA, US
Yann Livis - Bedminster NJ, US
International Classification:
G06F 3/06
US Classification:
711114
Abstract:
The present technology provides a two step process for providing a linearized dynamic storage pool. First, physical storage devices are abstracted. The physical storage devices used for the pool are divided into extents, grouped by storage class, and stripes are created from data chunks of similar classified devices. A virtual volume is then provisioned from and the virtual volume is divided into virtual stripes. A volume map is created to map the virtual stripes with data to the physical stripes, linearly mapping the virtual layout to the physical capacity to maintain optimal performance.
Control profile
Yann Millen Livis from Bedminster, NJ, age ~66 Get Report