Jeffrey Mark Achtermann

6704782, Mar 9, 2004

Dec 9, 1999

09/458269

Jeffrey Mark Achtermann - Austin TX
Alberto Giammaria - Austin TX
John Conrad Sanchez - Pflugerville TX

International Business Machines Corporation - Armonk NY

G06F 15173

709224, 709223

A method of monitoring data distribution progress in a computer network including a Distribution Manager and an end-user terminal communicating with the Distribution Manager through at least one node in the network. The Distribution Manager generates an identifier associated with the distribution along with a routing to the end-user terminal through the network. The Distribution Manager updates a Distribution State Table, maintaining information describing the progress of the distribution, and a Node State Table, maintaining information describing the status of the node in the network. The distribution data is then sent to the end-user terminal via the selected routing. Data are collected at the node from the end-user terminal describing the status of the end-user terminal and those data are transferred to the Distribution Manager. The Distribution Manager updates the distribution State and Node State Tables with the data received from the Node.

6912586, Jun 28, 2005

Nov 12, 1999

09/438437

Jeffrey Mark Achtermann - Austin TX, US
Arabinda Bose - Cedar Park TX, US
Alberto Giammaria - Austin TX, US

International Business Machines Corporation - Armonk NY

G06F013/00

709232, 709222, 709224, 370226

A method that, all-in-one, allows applications to distribute asynchronously large amounts of data from a source node to multiple destination nodes, to process that data on each single node and to collect the results of that processing on one or more report-to nodes. Distributions are given levels of priority that determine the order in which they are handled by repeaters. A distribution with a given priority can use the number of sessions reserved for its priority level plus any sessions allocated for lower priority levels. Distributions are enqueues in a persistent queue, according to its priority, for subsequent distribution and immediately returns to the caller an ID that can be used as a correlator for the results.

7191208, Mar 13, 2007

Dec 14, 1999

09/460852

Jeffrey Mark Achtermann - Austin TX, US
Troy Allen Cranford - Austin TX, US
Alberto Giammaria - Austin TX, US
Shinta Dewi Arifin Tjio - Austin TX, US

International Business Machines Corporation - Armonk NY

G06F 15/16

709203, 709245, 717171, 717176

A method of distributing data in a network including a server and an end-user computer. The end-user computer queries the server for a distribution list and then receives that list from the server. The end-user computer then determines if the distribution list is non-empty, and if it is non-empty, selects a distribution from the distribution list using a selected one of manual and automatic modes. The selected distribution is then downloaded from the server to the end-user computer.

7400578, Jul 15, 2008

Dec 16, 2004

11/014066

Robert Earl Guthrie - Austin TX, US
Jeffrey Mark Achtermann - Austin TX, US

International Business Machines Corporation - Armonk NY

H04J 1/16
H04J 3/14

370229, 370232

A method is presented for throttling data transmissions within a data processing system. Information about a data transfer from a server to a client is received within the application layer of a server, which stores the information about the data transfer along with information about a number of recent data transfers from the server to the client to create a sliding window of historical information about data transfers. The data transfer from the application layer of the server is delayed within the application layer of the server for an amount of time that is approximately equal to a computed delay time value in response to a determination that an average data transfer rate over the number of recent data transfers from the server to the client may exceed a data transfer rate threshold parameter.

7418506, Aug 26, 2008

Nov 12, 1999

09/438436

Jeffrey Mark Achtermann - Austin TX, US
Arabinda Bose - Cedar Park TX, US
Alberto Giammaria - Austin TX, US

International Business Machines Corporation - Armonk NY

G06F 15/16
G06F 15/177
G06F 15/173
G06F 9/46
G06F 11/00

709227, 709222, 709223, 718102, 718103, 714 4

An apparatus and method for scheduling data distributions to or results information from, or collectively, “jobs” to a plurality of data processing systems via a network. A connection to a target system is created. For each distribution, a session, which is an independent thread, is allocated from one of a plurality of pool of sessions and launched to effect execution of the job. Each pool corresponds to a predetermined priority level, and the session is allocated from the pool having the same priority level as the priority level of the job being scheduled. A connection supports a multiplicity of independent threads. In the event of an error, the session is released, and the scheduling of the aborted job is retried after a predetermined retry interval expires. After expiry of the retry interval, a callback method is invoked when the target system on which the scheduled job is executed becomes accessible.

7769822, Aug 3, 2010

Jul 17, 2007

11/778817

Jeffrey Mark Achtermann - Austin TX, US
Liliana Orozco - Del Valle TX, US
Patrick Leo Woods - Pflugerville TX, US

International Business Machines Corporation - Armonk NY

G06F 15/16

709218, 709202

In a content delivery network comprising multiple servers positioned at different locations, and including clients respectively located closer to one of the servers than to others, a method distributes specified file content to respective clients. The method initially uploads the specified content to a particular server, and generates a download plan for replicating the specified content at one or more other servers in successive stages, wherein each of the other servers is designated as a target server. The clients are notified, when the specified content is available for downloading at each target server. One mode of operation, of the target servers, immediately serves the specified content to a given client from the target server; another mode notifies the given client of the amount of time remaining until the target server completes replicating the specified content.

7792984, Sep 7, 2010

Jan 23, 2003

10/351564

Jeffrey Mark Achtermann - Austin TX, US
Robert Earl Guthrie - Austin TX, US
Christopher Victor Lazzaro - Austin TX, US
Mark Allen Sistrunk - Austin TX, US

International Business Machines Corporation - Armonk NY

G06F 15/16

709232, 709231

Systems and methods for the distribution of bulk data using multicast routing are provided. A multicast advertisement is sent to potential receivers of the bulk distribution. The advertisement may include a list of intended receivers and the ‘multicast group that the distribution will be multicast on. In response to the advertisement, intended receivers may listen on the multicast group address for the bulk data. Receivers that are not targets for the distribution do not join the multicast group, and consequently, the delivery of data by routers to subnets that have no target receivers may thus be obviated.

7895069, Feb 22, 2011

Nov 9, 2006

11/558310

Jeffrey M. Achtermann - Austin TX, US
Steven A. Jarvis - Austin TX, US
Liliana Orozco - Del Valle TX, US

International Business Machines Corporation - Armonk NY

G06F 17/60

705 8

A system, computer-implementable method, and computer-readable medium for processing a collection of work items in a data processing system. According to a preferred embodiment of the present invention, an agent monitor assembles a work items list that includes a collection of work items, wherein at least one work item among the collection of work items is a work item that is unassigned to at least one agent among a collection of agents. The agent monitor assigns the at least one work item to the at least one agent. In response to determining that the at least one agent has entered into a hang state, the agent monitor releases the at least one work item from the at least one agent.