Patents by Inventor James R. H. Challenger

James R. H. Challenger 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: 8533722
    Abstract: An apparatus and method for making fractional assignments of processing elements to processing nodes for stream-based applications in a distributed computer system includes determining an amount of processing power to give to each processing element. Based on a list of acceptable processing nodes, a determination of fractions of which processing nodes will work on each processing element is made. To update allocations of the amount of processing power and the fractions, the process is repeated.
    Type: Grant
    Filed: June 3, 2008
    Date of Patent: September 10, 2013
    Assignee: International Business Machines Corporation
    Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf
  • Patent number: 8437029
    Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.
    Type: Grant
    Filed: June 15, 2011
    Date of Patent: May 7, 2013
    Assignee: International Business Machines Corporation
    Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Oktay Gunluk, Kirsten Weale Hildrum, Richard P King, Deepak Rajan, David Tao, Joel Leonard Wolf, Laura Wynter
  • Patent number: 8392827
    Abstract: A method for dynamically converting electronically encoded HTML document from a text format to an image format. The method includes receiving a request for the content from a client, obtaining the content in text format, determining a content creation preference, and converting the content in text format to content in the image format according to the content creation preference. The method includes replying to the request, wherein the reply includes the content in the image format. The method applies a watermark to the content in the image format according to a watermarking preference. The method generates an image map in accordance with a mapping preference, wherein the image map relates selectable spatial display coordinates to external document identifiers.
    Type: Grant
    Filed: April 30, 2001
    Date of Patent: March 5, 2013
    Assignee: International Business Machines Corporation
    Inventors: James R. H. Challenger, Paul M. Dantzig, Robert Filepp, Ronald Mraz
  • Publication number: 20110246999
    Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.
    Type: Application
    Filed: June 15, 2011
    Publication date: October 6, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Oktay Gunluk, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf, Laura Wynter
  • Patent number: 8032586
    Abstract: A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. After a message is received at a computing device that contains a cache management unit, a fragment in the message body of the message is cached. Subsequent requests for the fragment at the cache management unit result in a cache hit. A FRAGMENTLINK tag is used to specify the location in a fragment for an included or linked fragment which is to be inserted into the fragment during fragment or page assembly or page rendering. A FRAGMENTLINK tag may include a FOREACH attribute that is interpreted as indicating that the FRAGMENTLINK tag should be replaced with multiple FRAGMENTLINK tags. The FOREACH attribute has an associated parameter that has multiple values that are used in identifying multiple fragments for the multiple FRAGMENTLINK tags.
    Type: Grant
    Filed: June 21, 2007
    Date of Patent: October 4, 2011
    Assignee: International Business Machines Corporation
    Inventors: James R. H. Challenger, Michael H. Conner, George P. Copeland, Arun K. Iyengar
  • Patent number: 8018614
    Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.
    Type: Grant
    Filed: June 3, 2008
    Date of Patent: September 13, 2011
    Assignee: International Business Machines Corporation
    Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Oktay Gunluk, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf, Laura Wynter
  • Patent number: 7987239
    Abstract: A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. After a message is received at a computing device, a fragment in the message body is cached. Cache ID rules from an origin server accompany a fragment to describe a method for forming a unique cache ID for the fragment such that dynamic content can be cached away from an origin server. A cache ID may be based on a URI and/or query parameters and/or cookies that are associated with a fragment. After user authentication, a cookie containing the user's role may be used in subsequent requests for role-specific fragments and in the cache identifier for role-specific fragments, thereby allowing requests from other users for role-specific fragments to be resolved in the cache when the users have the same role because these users would also have the same cookie.
    Type: Grant
    Filed: September 13, 2007
    Date of Patent: July 26, 2011
    Assignee: International Business Machines Corporation
    Inventors: Rajesh S. Agarwalla, James R. H. Challenger, George P. Copeland, Arun K. Iyengar, Mark H. Linehan, Subbarao Meduri
  • Patent number: 7870359
    Abstract: A method for managing computer memory, in accordance with the present invention, includes maintaining multiple sets of free blocks of memory wherein a free block is added to a set based on its size. In response to a request for a block of a request size, a set of blocks is searched for a free block which is at least as large as the request size but smaller than the request size plus a threshold. If such a block is found, the block is allocated in its entirety.
    Type: Grant
    Filed: October 18, 2007
    Date of Patent: January 11, 2011
    Assignee: International Business Machines Corporation
    Inventors: James R. H. Challenger, Arun K. Iyengar
  • Patent number: 7853949
    Abstract: An apparatus and method for making fractional assignments of processing elements to processing nodes for stream-based applications in a distributed computer system includes determining an amount of processing power to give to each processing element. Based on a list of acceptable processing nodes, a determination of fractions of which processing nodes will work on each processing element is made. To update allocations of the amount of processing power and the fractions, the process is repeated.
    Type: Grant
    Filed: March 13, 2006
    Date of Patent: December 14, 2010
    Assignee: International Business Machines Corporation
    Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf
  • Publication number: 20100242042
    Abstract: An apparatus and method for scheduling stream-based applications in a distributed computer system includes a scheduler configured to schedule work using three temporal levels. Each temporal level includes a method. A macro method is configured to schedule jobs that will run, in a highest temporal level, in accordance with a plurality of operation constraints to optimize importance of work. A micro method is configured to fractionally allocate, at a medium temporal level, processing elements to processing nodes in the system to react to changing importance of the work. A nano method is configured to revise, at a lowest temporal level, fractional allocations on a continual basis.
    Type: Application
    Filed: March 13, 2006
    Publication date: September 23, 2010
    Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf, Kun-Lung Wu
  • Patent number: 7738129
    Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.
    Type: Grant
    Filed: March 13, 2006
    Date of Patent: June 15, 2010
    Assignee: International Business Machines Corporation
    Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Oktay Gunluk, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf, Laura Wynter
  • Patent number: 7587515
    Abstract: A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. Within the request path from a client to a server, a first computing device may attach to a request message a message header that indicates that the first computing device supports fragment processing; a second computing device within the request path processes this request message. When the second computing device receives a response message corresponding to the request message, it can check for a message header directive that indicates that it should cache the response message's fragment only if the response path does not have at least one computing device that supports the processing of fragments; if so, then it forwards the response message without caching its contained fragment.
    Type: Grant
    Filed: December 19, 2001
    Date of Patent: September 8, 2009
    Assignee: International Business Machines Corporation
    Inventors: Rajesh S. Agarwalla, James R. H. Challenger, George P. Copeland, Arun K. Iyengar, Subbarao Meduri
  • Patent number: 7509393
    Abstract: A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. After a message is received at a computing device, a fragment in the message body is cached. Cache ID rules from an origin server accompany a fragment to describe a method for forming a unique cache ID for the fragment such that dynamic content can be cached away from an origin server. A cache ID may be based on a URI and/or query parameters and/or cookies that are associated with a fragment. After user authentication, a cookie containing the user's role may be used in subsequent requests for role-specific fragments and in the cache identifier for role-specific fragments, thereby allowing requests from other users for role-specific fragments to be resolved in the cache when the users have the same role because these users would also have the same cookie.
    Type: Grant
    Filed: December 19, 2001
    Date of Patent: March 24, 2009
    Assignee: International Business Machines Corporation
    Inventors: Rajesh S. Agarwalla, James R. H. Challenger, George P. Copeland, Arun K. Iyengar, Mark H. Linehan, Subbarao Meduri
  • Publication number: 20080271036
    Abstract: An apparatus and method for making fractional assignments of processing elements to processing nodes for stream-based applications in a distributed computer system includes determining an amount of processing power to give to each processing element. Based on a list of acceptable processing nodes, a determination of fractions of which processing nodes will work on each processing element is made. To update allocations of the amount of processing power and the fractions, the process is repeated.
    Type: Application
    Filed: June 3, 2008
    Publication date: October 30, 2008
    Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf
  • Publication number: 20080235698
    Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.
    Type: Application
    Filed: June 3, 2008
    Publication date: September 25, 2008
    Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Oktay Gunluk, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf, Laura Wynter
  • Patent number: 7426534
    Abstract: A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. After a message is received at a computing device that contains a cache management unit, a fragment in the message body of the message is cached. Subsequent requests for the fragment at the cache management unit result in a cache hit. A FRAGMENTLINK tag is used to specify the location in a fragment for an included or linked fragment which is to be inserted into the fragment during fragment or page assembly or page rendering. A FRAGMENTLINK tag may include a FOREACH attribute that is interpreted as indicating that the FRAGMENTLINK tag should be replaced with multiple FRAGMENTLINK tags. The FOREACH attribute has an associated parameter that has multiple values that are used in identifying multiple fragments for the multiple FRAGMENTLINK tags.
    Type: Grant
    Filed: December 19, 2001
    Date of Patent: September 16, 2008
    Assignee: International Business Machines Corporation
    Inventors: James R. H. Challenger, Michael H. Conner, George P. Copeland, Arun K. Iyengar
  • Patent number: 7412535
    Abstract: A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. After a message is received at a computing device that contains a cache management unit, a fragment in the message body of the message is cached. Subsequent requests for the fragment at the cache management unit result in a cache hit. A FRAGMENTLINK tag is used to specify the location in a fragment for an included or linked fragment which is to be inserted into the fragment during fragment or page assembly or page rendering. If a FRAGMENTLINK tag is present within the message body of a message, then the FRAGMENT message header for the message may indicate the presence of the FRAGMENTLINK tag with a directive for the FRAGMENT message header, e.g., using a “contains-fragment” directive.
    Type: Grant
    Filed: December 19, 2001
    Date of Patent: August 12, 2008
    Assignee: International Business Machines Corporation
    Inventors: Rajesh S. Agarwalla, James R. H. Challenger, George P. Copeland, Arun K. Iyengar, Mark H. Linehan
  • Patent number: 7308606
    Abstract: A method for managing computer memory, in accordance with the present invention, includes maintaining multiple sets of free blocks of memory wherein a free block is added to a set based on its size. In response to a request for a block of a request size, a set of blocks is searched for a free block which is at least as large as the request size but smaller than the request size plus a threshold. If such a block is found, the block is allocated in its entirety.
    Type: Grant
    Filed: October 20, 2004
    Date of Patent: December 11, 2007
    Assignee: International Business Machines Corporation
    Inventors: James R. H. Challenger, Arun K. Iyengar
  • Patent number: 7143026
    Abstract: A method for preparing rules used for generating text to describe structured data comprises providing a sample of structured data, and providing a text corresponding to the sample of structured data to a pattern matching learning engine, the text comprising at least one value from within the sample of structured data. The method further comprises organizing the text into a hierarchy of syntactic components, and building rules based on the text and the sample of structured data, wherein the rules define an organization of the hierarchy of syntactic components.
    Type: Grant
    Filed: December 12, 2002
    Date of Patent: November 28, 2006
    Assignee: International Business Machines Corporation
    Inventors: James R. H. Challenger, Robert Filepp
  • Patent number: 6920605
    Abstract: A method for constructing and publishing a plurality of objects, in accordance with the present invention, includes the steps of providing a plurality of fragments, constructing objects from the plurality of fragments, delaying publication of at least one of the objects, where the at least one of the objects includes at least one fragment belonging to a first class, to examine content, and publishing at least one of the objects including at least one of the fragments belonging to a second class without examining content. A program storage device for implementation of the present invention is also included.
    Type: Grant
    Filed: April 1, 1999
    Date of Patent: July 19, 2005
    Assignee: International Business Machines Corporation
    Inventors: James R. H. Challenger, Cameron Ferstat, Arun K. Iyengar, Paul Reed, Gerald A. Spivak, Karen A. Witting