Patents by Inventor Mark C. Astley
Mark C. Astley has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9755992Abstract: A system and method for latency assignment in a system having shared resources for performing jobs including computing a new resource price at each resource based on latencies in a previous iteration. The new resource price is sent to a task controller that has at least one subtask running at the resource. Each subtask has an initial deadline. New deadlines for the subtasks in a task are determined based on the new resource prices at the task controller. The new deadlines are sent to the resources where at least one subtask in the task is running to improve system performance.Type: GrantFiled: March 11, 2016Date of Patent: September 5, 2017Assignee: International Business Machines CorporationInventors: Mark C. Astley, Sumeer K. Bhola, Cristian Lumezanu
-
Publication number: 20160197847Abstract: A system and method for latency assignment in a system having shared resources for performing jobs including computing a new resource price at each resource based on latencies in a previous iteration. The new resource price is sent to a task controller that has at least one subtask running at the resource. Each subtask has an initial deadline. New deadlines for the subtasks in a task are determined based on the new resource prices at the task controller. The new deadlines are sent to the resources where at least one subtask in the task is running to improve system performance.Type: ApplicationFiled: March 11, 2016Publication date: July 7, 2016Inventors: Mark C. Astley, Sumeer K. Bhola, Cristian Lumezanu
-
Patent number: 9342363Abstract: A system and method for latency assignment in a system having shared resources for performing jobs including computing a new resource price at each resource and sending the new resource price to a task controller in a task path that has at least one job running in the task path. A path price is computed for each task path of the task controller, if there is a critical time specified for the task. New deadlines are determined for the resources in a task path based on the resource price and the path price. The new deadlines are sent to the resources where the at least one job is running to improve system performance.Type: GrantFiled: January 8, 2008Date of Patent: May 17, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mark C. Astley, Sumeer Bhola, Cristian Lumezanu
-
Patent number: 7689695Abstract: A system and method which integrates a greedy allocation for consumer admission control with a Lagrangian allocation to compute flow rates and which links the results of the two approaches to allow a tradeoff between consumer admission control and flow rates. The Lagrangian Rates, Greedy Populations (hereinafter, “LRGP”) solution is a scalable and efficient distributed solution for maximizing the total utility in an event-driven distributed infrastructure. The greedy population, consumer portion generates prices used in the LaGrangian rate flow approach. The method is iterative including a regular exchange of information for ongoing optimization, dynamically adjusting producer rates in response to changes to consumer service and dynamically adjusting the service to consumer populations in response to changes in the producer rates.Type: GrantFiled: June 28, 2007Date of Patent: March 30, 2010Assignee: International Business Machines CorporationInventors: Mark C. Astley, Sumeer Kumar Bhola, Cristian Lumezanu
-
Publication number: 20090178047Abstract: A system and method for latency assignment in a system having shared resources for performing jobs including computing a new resource price at each resource and sending the new resource price to a task controller in a task path that has at least one job running in the task path. A path price is computed for each task path of the task controller, if there is a critical time specified for the task. New deadlines are determined for the resources in a task path based on the resource price and the path price. The new deadlines are sent to the resources where the at least one job is running to improve system performance.Type: ApplicationFiled: January 8, 2008Publication date: July 9, 2009Inventors: MARK C. ASTLEY, Sumeer Bhola, Cristian Lumezanu
-
Patent number: 7525964Abstract: A method, system, and computer program for delivering messages and data to competing consumers. One aspect of the invention includes a message delivery system including a destination messaging engine, one or more receiver messaging engines, and a message pool. The destination messaging engine is configured to distribute data from one or more producers. The receiver messaging engines are configured to request data from the destination messaging engine and transmit the data to one or more consumers. The message pool is configured to store data from the producers, with the destination messaging engine arbitrating data in the message pool among the receiver messaging engines.Type: GrantFiled: November 3, 2004Date of Patent: April 28, 2009Assignee: International Business Machines CorporationInventors: Mark C. Astley, Andrew D. J. Banks, Sumeer K. Bhola, Ignacio Silva-Lepe, Michael J. Ward, David Ware
-
Patent number: 7487246Abstract: A content-based publish/subscribe system for providing gapless message delivery from a publishing client to a subscribing client is disclosed. The system includes a plurality of brokers operatively coupled to one another via a network. Each of the brokers include at least one processor and are configured as a publisher-hosting broker, a subscriber-hosting broker or an intermediate broker. The subscriber-hosting broker may be operatively coupled to the publisher-hosting broker via the network through the intermediate broker. At least a portion of the plurality of brokers are configured so as to eliminate a need for persistent storage of messages at the intermediate broker and to substantially guarantee a gapless delivery of one or more messages transmitted by the publishing client to the subscribing client, even in the presence of a failure in the publish/subscribe system.Type: GrantFiled: June 30, 2006Date of Patent: February 3, 2009Assignee: Irternational Business Machines CorporationInventors: Mark C. Astley, Joshua S. Auerbach, Sumeer K. Bhola, Marc A. Kaplan, Robert E. Strom, Yuanyuan Zhao
-
Publication number: 20080016217Abstract: A system and method which integrates a greedy allocation for consumer admission control with a Lagrangian allocation to compute flow rates and which links the results of the two approaches to allow a tradeoff between consumer admission control and flow rates. The Lagrangian Rates, Greedy Populations (hereinafter, “LRGP”) solution is a scalable and efficient distributed solution for maximizing the total utility in an event-driven distributed infrastructure. The greedy population, consumer portion generates prices used in the LaGrangian rate flow approach. The method is iterative including a regular exchange of information for ongoing optimization, dynamically adjusting producer rates in response to changes to consumer service and dynamically adjusting the service to consumer populations in response to changes in the producer rates.Type: ApplicationFiled: June 28, 2007Publication date: January 17, 2008Applicant: International Business Machines CorporationInventors: Mark C. Astley, Sumeer Kumar Bhola, Cristian Lumezanu
-
Patent number: 7162524Abstract: A content-based publish/subscribe system for providing gapless message delivery from a publishing client to a subscribing client, the system includes a plurality of brokers operatively coupled to one another via a network. Each of the brokers include at least one processor and are configured as a publisher-hosting broker, a subscriber-hosting broker or an intermediate broker. The subscriber-hosting broker is operatively coupled to the publisher-hosting broker via the network through the intermediate broker. At least a portion of the plurality of brokers are configured so as to eliminate a need for persistent storage of messages at the intermediate broker and to substantially guarantee a gapless delivery of one or more messages transmitted by the publishing client to the subscribing client, even in the presence of a failure in the publish/subscribe system.Type: GrantFiled: June 21, 2002Date of Patent: January 9, 2007Assignee: International Business Machines CorporationInventors: Mark C. Astley, Joshua S. Auerbach, Sumeer K. Bhola, Marc A. Kaplan, Robert E. Strom, Yuanyuan Zhao
-
Publication number: 20040003064Abstract: A content-based publish/subscribe system for providing gapless message delivery from a publishing client to a subscribing client, the system includes a plurality of brokers operatively coupled to one another via a network. Each of the brokers include at least one processor and are configured as a publisher-hosting broker, a subscriber-hosting broker or an intermediate broker. The subscriber-hosting broker is operatively coupled to the publisher-hosting broker via the network through the intermediate broker. At least a portion of the plurality of brokers are configured so as to eliminate a need for persistent storage of messages at the intermediate broker and to substantially guarantee a gapless delivery of one or more messages transmitted by the publishing client to the subscribing client, even in the presence of a failure in the publish/subscribe system.Type: ApplicationFiled: June 21, 2002Publication date: January 1, 2004Applicant: International Business Machines CorporationInventors: Mark C. Astley, Joshua S. Auerbach, Sumeer K. Bhola, Marc A. Kaplan, Robert E. Strom, Yuanyuan Zhao
-
Publication number: 20030093680Abstract: A client-server authentication method for use where a server process has access to a repository storing cipher-protected client passwords. The method includes applying the same cipher function to the client's copy of its password as was previously applied to generate the stored cipher-protected client passwords. This ensures that both the client and server have access to an equivalent cipher-protected client password—providing a shared secret for driving a mutual challenge-response authentication protocol without having to convert the password into cleartext at the server. The invention can be implemented without significant additional software infrastructure in a UNIX environment. Client passwords are typically stored in the UNIX password repository under the protection of the crypt( ) function applied to the combination of the password and a random number (a ‘salt’).Type: ApplicationFiled: November 13, 2001Publication date: May 15, 2003Applicant: International Business Machines CorporationInventors: Mark C. Astley, Neil George Stanley Young