David A Jordan

Author:

David Francis Jordan

ISBN #:

0135045630

Author:

David Starr Jordan

ISBN #:

0486221962

Author:

David Starr Jordan

ISBN #:

0806301996

Author:

David Starr Jordan

ISBN #:

0824002644

Author:

David Starr Jordan

ISBN #:

0824002652

Author:

David Starr Jordan

ISBN #:

0824002938

Author:

David Starr Jordan

ISBN #:

0766105458

Author:

David Starr Jordan

ISBN #:

0766189694

US Patent:

7404061, Jul 22, 2008

Filed:

Feb 14, 2005

Appl. No.:

11/057664

Inventors:

David A. Jordan - Austin TX, US

International Classification:

G06F 12/02

US Classification:

711170, 711219

Abstract:

A method, system, and computer program manager for a computing system memory in the operation of a computing process. At least one memory segment provides memory resources for the computing process. The memory segment includes a plurality of memory objects, each of the memory objects includes an equal number of bytes and has a predetermined order that associates the address of the memory object in the memory segment to the addresses of the remainder of the plurality of memory objects. A pointer identifies a first memory object from the plurality of memory objects. The first memory object occupies a first ordered position according to the predetermined order. The process allocates the first memory objects from the memory segment during the operation of the computing process. The pointer increments to a second memory object having a second ordered position relative to the first memory object. The process continues the allocating and incrementing steps on subsequently ordered memory objects within the memory segment as required by the computing process.

US Patent:

7991976, Aug 2, 2011

Filed:

Jun 19, 2008

Appl. No.:

12/142291

Inventors:

David A. Jordan - Austin TX, US

Assignee:

Computer Associates Think, Inc. - Islandia NY

International Classification:

G06F 12/00

US Classification:

711171

Abstract:

A method, system, and computer program manager for a computing system memory in the operation of a computing process. At least one memory segment provides memory resources for the computing process, which includes a plurality of memory objects, each of the memory objects includes an equal number of bytes and has a predetermined order that associates the address of the memory object in the memory segment to the addresses of the remainder of the plurality of memory objects. A pointer identifies a first memory object from the plurality of memory objects. The first memory object occupies a first ordered position according to the predetermined order. The process allocates the first memory objects from the memory segment during the operation of the computing process. The pointer increments to a second memory object having a second ordered position relative to the first memory object. The process continues the allocating and incrementing steps on subsequently ordered memory objects within the memory segment as required by the computing process.

US Patent:

20100265835, Oct 21, 2010

Filed:

Apr 20, 2009

Appl. No.:

12/426632

Inventors:

Ben Haley - Austin TX, US
Cathy Fulton - Austin TX, US
David Jordan - Austin TX, US

International Classification:

H04L 12/26

US Classification:

370252

Abstract:

The disclosure presents a system, method, and computer readable medium for computing network latencies. Network devices using flow processors create network traffic summary information in the form of flow records. A harvester may gather, process, and analyze flow records to find matching flows. Using matching flows, a harvester computes the latency, either one-way or round-trip, between two devices on the network. This information may be exported or stored on other devices on the network. The teachings of the present disclosure enable wide network coverage through the use of existing network traffic summary records. Further, the present disclosure mitigates network slowdowns associated with monitoring equipment. The present disclosure also reduces or eliminates the need for clock synchronization between devices on the network.