Patents by Inventor Loren Staley

Loren Staley 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: 7424528
    Abstract: In one embodiment of the present invention, a method for measuring the capacity of a media server for supporting concurrent media streams to a population of clients is provided. The method comprises identifying a mixed workload, wherein the mixed workload corresponds to a number of media streams served concurrently by the media server to a population of clients wherein all of said number of media streams do not comprise common content encoded at a common bit rate. The method further comprises using a cost function to compute a load for the media server under the mixed workload.
    Type: Grant
    Filed: November 27, 2002
    Date of Patent: September 9, 2008
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Ludmila Cherkasova, Loren Staley
  • Publication number: 20040103189
    Abstract: In one embodiment of the present invention, a method for measuring the capacity of a media server for supporting concurrent media streams to a population of clients is provided. The method comprises identifying a mixed workload, wherein the mixed workload corresponds to a number of media streams served concurrently by the media server to a population of clients wherein all of said number of media streams do not comprise common content encoded at a common bit rate. The method further comprises using a cost function to compute a load for the media server under the mixed workload.
    Type: Application
    Filed: November 27, 2002
    Publication date: May 27, 2004
    Inventors: Ludmila Cherkasova, Loren Staley
  • Patent number: 5854934
    Abstract: A method of scheduling prefetch instructions in a compiler is described that improves performance by minimizing the performance degradation due to dirty cache misses. The method determines the length N of a loop (step 66). The number of prefetch instructions were M within that loop are then determined (step 68). A prefetch spacing P is then calculated according to the formula P=N/M, where the length of the loop is expressed in cycles (step 70). This prefetch spacing is then attached to each prefetch instruction and the instruction scheduler schedules the prefetch instructions so as to space the prefetch instructions apart by approximately the prefetch spacing P (step 72). After the scheduler arranged for P cycles, a prefetch instruction will be assigned a higher priority for scheduling in the next lot.
    Type: Grant
    Filed: August 23, 1996
    Date of Patent: December 29, 1998
    Assignee: Hewlett-Packard Company
    Inventors: Wei Hsu, Loren Staley