Ron Barzel Barzel

US Patent:

8176357, May 8, 2012

Filed:

May 28, 2010

Appl. No.:

12/789507

Inventors:

Felix S. Hsu - Fremont CA, US
Ron Barzel - Truckee CA, US

Assignee:

Eastman Kodak Company - Rochester NY

International Classification:

G06F 11/00

US Classification:

714 41, 714 15, 714 471, 714 472, 714 55

Abstract:

A file storage system that uses a server to communicate between a client and a storage system. The server receives a file storage request pertaining to a file, generates and stores a file record for the request and forwards the request to a file storage system. The server performs either an internal retry or forwards a no-file response from the storage system to the client computer in response to receiving a no-file file status from the storage system depending on an amount of elapsed time from the time the server initially receives the file storage request.

US Patent:

20110296240, Dec 1, 2011

Filed:

May 28, 2010

Appl. No.:

12/789504

Inventors:

Felix S. Hsu - Fremont CA, US
Ron Barzel - Truckee CA, US

International Classification:

G06F 17/30
G06F 11/14
G06F 15/16

US Classification:

714 18, 707827, 714E11113, 707E1701, 707E17032, 709203

Abstract:

A method of storing and retrieving digital files from a storage system comprising requesting one or more files through a server which compares the timestamp of each file to the present time to determine an elapsed time for each file. The server then requests a storage system for each file having an elapsed time less than or equal to a pre-determined time limit using an internal-retry request and requests from the storage system each file having an elapsed time greater than a pre-determined time limit using a fail-fast request.

US Patent:

20120323988, Dec 20, 2012

Filed:

Jun 16, 2011

Appl. No.:

13/161601

Inventors:

Ron Barzel - Truckee CA, US
Felix S. Hsu - Fremont CA, US
Ronald S. Cok - Rochester NY, US

International Classification:

G06F 15/16

US Classification:

709202

Abstract:

A method of allocating computing tasks in a communication network comprises providing a server that sends a request with an expiration time over the network to one or more processor computers for an allocation of a processing task to be performed by the server computer. The server computer performs the allocated processing task to completion if it's received within the expiration time and only if a higher priority task is not received before processing is completed.

US Patent:

20120324095, Dec 20, 2012

Filed:

Jun 16, 2011

Appl. No.:

13/161611

Inventors:

Ron Barzel - Truckee CA, US
Felix S. Hsu - Fremont CA, US
Ronald S. Cok - Rochester NY, US

International Classification:

G06F 15/16

US Classification:

709224

Abstract:

A method of allocating computing tasks in a computer network when servers receive processing tasks that are unequally distributed among the server computers. A task-available message is sent over the computer network from a server having a heavy task load to the other server computers. The task-available message is processed by at least one of the other server computer by requesting a task.

US Patent:

20120324096, Dec 20, 2012

Filed:

Jun 16, 2011

Appl. No.:

13/161634

Inventors:

Ron Barzel - Truckee CA, US
Felix S. Hsu - Fremont CA, US
Ronald S. Cok - Rochester NY, US

International Classification:

G06F 15/16

US Classification:

709224

Abstract:

A plurality of server computers connected to computer network processes tasks that are unequally distributed among the server computers. A server sends a task-available message over the computer network to the remaining server computers to request assistance. The received task-available message is processed by some of the servers while others of the servers do not process the message because they are too busy. The servers that process the message respond by requesting a task from the message sending server.

US Patent:

20120324111, Dec 20, 2012

Filed:

Jun 16, 2011

Appl. No.:

13/161627

Inventors:

Ron Barzel - Truckee CA, US
Felix S. Hsu - Fremont CA, US
Ronald S. Cok - Rochester NY, US

International Classification:

G06F 15/16

US Classification:

709226

Abstract:

Server computers send requests over a network for an allocation of server tasks and processing tasks, the processing task requests having an associated expiration time. The plurality of server computers process received server tasks provided to the server computers in response to the requests, and process processing tasks within the expiration time in response to the requests for processing tasks. The server computers perform the allocated processing tasks only if there are no pending server tasks.

US Patent:

20130181997, Jul 18, 2013

Filed:

Jan 17, 2012

Appl. No.:

13/351596

Inventors:

RON BARZEL - Truckee CA, US
Jon Ailyn Campbell - Oakland CA, US
Ronald Steven Cok - Rochester NY, US
Mark S. Cook - Greenbrae CA, US

International Classification:

G06T 1/00

US Classification:

345501

Abstract:

A method of dynamically presenting temporally ordered image events includes providing a pre-determined presentation rate and a corresponding pre-determined presentation period; using a processor to receive at irregular intervals a plurality of temporally ordered image events at an average image event rate greater than the presentation rate; storing the received image events in an ordered list corresponding to the order in which the image events were received; accessing, according to a pre-determined rule based on the pre-determined presentation rate and image event rate, a subset of the stored image events from the ordered list; and sequentially presenting each of the accessed subset of image events in the order in which the image events were received for the presentation period.

US Patent:

20130185635, Jul 18, 2013

Filed:

Jan 17, 2012

Appl. No.:

13/351547

Inventors:

RON BARZEL - Truckee CA, US
Jon Allyn Campbell - Oakland CA, US
Ronald Steven Cok - Rochester NY, US
Mark S. Cook - Greenbrae CA, US

International Classification:

G06F 17/00

US Classification:

715277

Abstract:

A method of dynamically presenting temporally ordered image events includes providing a pre-determined presentation rate and a corresponding pre-determined presentation period; using a processor to receive at irregular intervals a plurality of temporally ordered image events at an average image event rate less than the presentation rate; storing the received image events in an ordered list corresponding to the order in which the image events were received; accessing, according to a pre-determined rule, stored image events from the ordered list; sequentially presenting the accessed image events for the presentation period; and interrupting the sequential presentation of the stored image events when a new image event is received and presenting the received new image event for the presentation period and resuming the sequential presentation of the accessed image events.