Patents by Inventor Scott Lane Burris

Scott Lane Burris 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: 9946563
    Abstract: A batch scheduler receives a task. Further, a processor, at the batch scheduler, generates a virtual machine corresponding to the task. In addition, the virtual machine is deployed from the batch scheduler to a compute node. The task is also dispatched from the batch scheduler to the virtual machine at the compute node.
    Type: Grant
    Filed: February 21, 2012
    Date of Patent: April 17, 2018
    Assignee: Disney Enterprises, Inc.
    Inventors: Jonathan Eric Geibel, Jeffrey M. Jordan, Scott Lane Burris, Kevin Christopher Constantine
  • Patent number: 9779008
    Abstract: A server receives a first set of file activity data from a first file monitor. The first set of file activity data indicates activity associated with a first set of files accessed at a first compute node in communication with a network. Further, the server receives a second set of file activity data from a second file monitor. The second set of file activity data indicates activity associated with a second set of files accessed at a second compute node in communication with the network. In addition, the server aggregates the first set of file activity data and the second set of file activity data into an aggregated set of network file activity data.
    Type: Grant
    Filed: February 21, 2012
    Date of Patent: October 3, 2017
    Assignee: Disney Enterprises, Inc.
    Inventors: Jonathan Eric Geibel, Jeffrey M. Jordan, Scott Lane Burris, Kevin Christopher Constantine, Thomas Charles Greer
  • Patent number: 9104491
    Abstract: A request from a client to perform a task is received. The client has a predetermined limit of compute resources. The task is dispatched from a batch scheduler to a compute node as a non-speculative task if a quantity of compute resources is available at the compute node to process the task, and the quantity of compute resources in addition to a total quantity of compute resources being utilized by the client is less than or equal to the predetermined limit, such that the non-speculative task is processed without being preempted by an additional task requested by an additional client. The task is dispatched, from the batch scheduler to the compute node, as a speculative task if the quantity of compute resources is available to process the task, and the quantity of compute resources in addition to the total quantity of compute resources is greater than the predetermined limit.
    Type: Grant
    Filed: February 21, 2012
    Date of Patent: August 11, 2015
    Assignee: Disney Enterprises, Inc.
    Inventors: Jonathan Eric Geibel, Jeffrey M. Jordan, Scott Lane Burris, Kevin Christopher Constantine, Henry Allen Driskill
  • Publication number: 20130219395
    Abstract: A request from a client to perform a task is received. The client has a predetermined limit of compute resources. The task is dispatched from a batch scheduler to a compute node as a non-speculative task if a quantity of compute resources is available at the compute node to process the task, and the quantity of compute resources in addition to a total quantity of compute resources being utilized by the client is less than or equal to the predetermined limit, such that the non-speculative task is processed without being preempted by an additional task requested by an additional client. The task is dispatched, from the batch scheduler to the compute node, as a speculative task if the quantity of compute resources is available to process the task, and the quantity of compute resources in addition to the total quantity of compute resources is greater than the predetermined limit.
    Type: Application
    Filed: February 21, 2012
    Publication date: August 22, 2013
    Applicant: DISNEY ENTERPRISES, INC.
    Inventors: Jonathan Eric Geibel, Jeffrey M. Jordan, Scott Lane Burris, Kevin Christopher Constantine, Henry Allen Driskill
  • Publication number: 20130219385
    Abstract: A batch scheduler receives a task. Further, a processor, at the batch scheduler, generates a virtual machine corresponding to the task. In addition, the virtual machine is deployed from the batch scheduler to a compute node. The task is also dispatched from the batch scheduler to the virtual machine at the compute node.
    Type: Application
    Filed: February 21, 2012
    Publication date: August 22, 2013
    Applicant: DISNEY ENTERPRISES, INC.
    Inventors: Jonathan Eric Geibel, Jeffrey M. Jordan, Scott Lane Burris, Kevin Christopher Constantine
  • Publication number: 20130219049
    Abstract: A server receives a first set of file activity data from a first file monitor. The first set of file activity data indicates activity associated with a first set of files accessed at a first compute node in communication with a network. Further, the server receives a second set of file activity data from a second file monitor. The second set of file activity data indicates activity associated with a second set of files accessed at a second compute node in communication with the network. In addition, the server aggregates the first set of file activity data and the second set of file activity data into an aggregated set of network file activity data.
    Type: Application
    Filed: February 21, 2012
    Publication date: August 22, 2013
    Applicant: DISNEY ENTERPRISES, INC.
    Inventors: Jonathan Eric Geibel, Jeffrey M. Jordan, Scott Lane Burris, Kevin Christopher Constantine, Thomas Charles Greer
  • Publication number: 20130219386
    Abstract: A resource broker determines availability of a portion of a set of compute resources in real-time. The set of compute resources is assigned as a priority to a master process. Further, the resource broker assigns the portion of the set of compute resources to an auxiliary process if the portion of the set of compute resources is available. In addition, the resource broker determines that the master process is attempting to utilize the portion of the set of compute resources. The resource broker also assigns the portion of the set of compute resources to the master process from the auxiliary process without an interruption that exceeds a predetermined time threshold of processing being performed by the master process.
    Type: Application
    Filed: February 21, 2012
    Publication date: August 22, 2013
    Applicant: DISNEY ENTERPRISES, INC.
    Inventors: Jonathan Eric Geibel, Jeffrey M. Jordan, Scott Lane Burris, Kevin Christopher Constantine