Stephen C Schmidt

US Patent:

7885932, Feb 8, 2011

Filed:

Mar 10, 2010

Appl. No.:

12/721214

Inventors:

Vrishal Kulkarni - Waltham MA, US
Stephen Schmidt - Medford MA, US
Craig W. Stanfill - Lincoln MA, US
Ephraim Meriwether Vishniac - Arlington MA, US

Assignee:

Ab Initio Technology LLC - Lexington MA

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707640, 707706, 707802, 711161, 711162

Abstract:

Managing data includes: receiving at least one group of individually accessible data units over an input device or port, each data unit identified by a key value, with key values of the received data units being sorted such that the key value identifying a given first data unit that is received before a given second data unit occurs earlier in a sort order than the key value identifying the given second data unit; and processing the data units for storage in a data storage system. The processing includes: storing a plurality of blocks of data, each of one or more of the blocks being generated by combining a plurality of the data units; providing an index that includes an entry for each of the blocks, wherein one or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value; and generating one or more screening data structures associated with the stored blocks for determining a possibility that a data unit that includes a given key value was included in the group of individually accessible data units.

US Patent:

8214331, Jul 3, 2012

Filed:

Jan 3, 2011

Appl. No.:

12/983375

Inventors:

Vrishal Kulkarni - Waltham MA, US
Stephen Schmidt - Medford MA, US
Craig W. Stanfill - Lincoln MA, US
Ephraim Meriwether Vishniac - Arlington MA, US

Assignee:

Ab Initio Technology LLC - Lexington MA

International Classification:

G06F 17/30

US Classification:

707640, 707706, 707802

Abstract:

Managing data includes: receiving at least one group of individually accessible data units over an input device or port, each data unit identified by a key value, with key values of the received data units being sorted such that the key value identifying a given first data unit that is received before a given second data unit occurs earlier in a sort order than the key value identifying the given second data unit; and processing the data units for storage in a data storage system. The processing includes: storing a plurality of blocks of data, each of one or more of the blocks being generated by combining a plurality of the data units; providing an index that includes an entry for each of the blocks, wherein one or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value; and generating one or more screening data structures associated with the stored blocks for determining a possibility that a data unit that includes a given key value was included in the group of individually accessible data units.

US Patent:

8489553, Jul 16, 2013

Filed:

Jul 2, 2012

Appl. No.:

13/540125

Inventors:

Vrishal Kulkarni - Waltham MA, US
Stephen Schmidt - Medford MA, US
Craig W. Stanfill - Lincoln MA, US
Ephraim Meriwether Vishniac - Arlington MA, US

Assignee:

Ab Initio Technology LLC - Lexington MA

International Classification:

G06F 17/30

US Classification:

707640, 707706, 707802

Abstract:

Managing data by: receiving a group of individually accessible data units, each data unit identified by a key value, with key values determined such that the key value identifying a first data unit received before a second data unit occurs earlier in a sort order than the key value identifying the second data unit; and processing the data units for storage in a data storage system. The processing includes: storing blocks of data, the blocks being generated by combining a plurality of the data units; providing an index with entries that enable location, based on a provided key value, of a block that includes a data unit corresponding to the provided key value; and generating one or more screening data structures associated with the blocks for determining, based on a given key value, whether to search the stored blocks for a data unit corresponding to the given key value.

US Patent:

20020045145, Apr 18, 2002

Filed:

Feb 9, 2001

Appl. No.:

09/780543

Inventors:

Philip Carbone - North Reading MA, US
Karen Benedek - Winchester MA, US
Stephen Schmidt - Woburn MA, US
Richard Shandross - Arlington MA, US
William Goetzler - Brookline MA, US
Peter Payne - Park Ridge IL, US

International Classification:

F23D014/62
F23D014/04

US Classification:

431/354000

Abstract:

A gas-fired burner wherein a back plate having at least one inlet tube is connected with respect to a flameholder plate having a plurality of ports. The flameholder plate and the back plate form a plenum. A plurality of mixing baffles are formed within the plenum and between the back plate and the flameholder plate. A radiation plate is also connected with respect to the flameholder plate, the radiation plate and flameholder plate forming a combustion chamber with at least one gas flow boundary serving as a heat radiating surface.

US Patent:

20110307897, Dec 15, 2011

Filed:

Jun 15, 2011

Appl. No.:

13/161010

Inventors:

Matthew Darcy Atterbury - Lexington MA, US
H. Mark Bromley - Lyndeborough NH, US
Wayne Mesard - Belmont MA, US
Arkadi Popov - Sharon MA, US
Stephen Schmidt - Medford MA, US
Craig W. Stanfill - Lincoln MA, US

International Classification:

G06F 9/46

US Classification:

718102

Abstract:

Processing data includes: receiving units of work that each include one or more work elements, and processing a first unit of work using a first compiled dataflow graph () loaded into a data processing system () in response to receiving the first unit of work. The processing includes: analysis to determine a characteristic of the first unit of work; identifying one or more compiled dataflow graphs from graphs stored in a data storage system () that include at least some that were compiled for processing a unit of work having the determined characteristic; loading one of the identified compiled dataflow graphs into the data processing system () as the first compiled dataflow graph (); and generating one or more output work elements from at least one work element in the first unit of work.

US Patent:

20140025685, Jan 23, 2014

Filed:

Jul 15, 2013

Appl. No.:

13/942277

Inventors:

Stephen Schmidt - Medford MA, US
Craig W. Stanfill - Lincoln MA, US
Ephraim Meriwether Vishniac - Arlington MA, US

International Classification:

G06F 17/30

US Classification:

707741

Abstract:

Managing data by: receiving a group of individually accessible data units, each data unit identified by a key value, with key values determined such that the key value identifying a first data unit received before a second data unit occurs earlier in a sort order than the key value identifying the second data unit; and processing the data units for storage in a data storage system. The processing includes: storing blocks of data, the blocks being generated by combining a plurality of the data units; providing an index with entries that enable location, based on a provided key value, of a block that includes a data unit corresponding to the provided key value; and generating one or more screening data structures associated with the blocks for determining, based on a given key value, whether to search the stored blocks for a data unit corresponding to the given key value.

US Patent:

20200257556, Aug 13, 2020

Filed:

Sep 17, 2019

Appl. No.:

16/572756

Inventors:

- Lexington MA, US
Stephen J. Schmidt - Medford MA, US
Bo Wang - Acton MA, US

International Classification:

G06F 9/48
G06F 9/50

Abstract:

Requesting computational resources for executing a program including a number of program portions includes computing sets of requests. Each set, except an initial set, is processed by a computational resource manager only if the previously submitted sets were granted. One or more additional sets are formed for processing by the manager after the initial set. A request of the additional sets includes a partial request for a program portion that is in a least-fulfilled set of program portions. Each program portion is associated with a respective fulfillment ratio of its quantity of previously requested resources divided by an associated target quantity. The partial request requests a quantity of resources that is small enough so that, after the partial request is granted, each program portion in the least-fulfilled set will have a fulfillment ratio that is greater than its fulfillment ratio had been, and is still smaller than one.

US Patent:

20180165129, Jun 14, 2018

Filed:

Dec 6, 2017

Appl. No.:

15/833213

Inventors:

- Lexington MA, US
Stephen J. Schmidt - Medford MA, US
Bo Wang - Acton MA, US

International Classification:

G06F 9/50
G06F 9/48

Abstract:

Requesting computational resources for executing a program including a number of program portions includes computing sets of requests. Each set, except an initial set, is processed by a computational resource manager only if the previously submitted sets were granted. One or more additional sets are formed for processing by the manager after the initial set. A request of the additional sets includes a partial request for a program portion that is in a least-fulfilled set of program portions. Each program portion is associated with a respective fulfillment ratio of its quantity of previously requested resources divided by an associated target quantity. The partial request requests a quantity of resources that is small enough so that, after the partial request is granted, each program portion in the least-fulfilled set will have a fulfillment ratio that is greater than its fulfillment ratio had been, and is still smaller than one.