Patents by Inventor Andrew Staffer
Andrew Staffer 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: 9727372Abstract: A method, system, and apparatus to divide a computing job into micro-jobs and allocate the execution of the micro-jobs to times when needed resources comply with one or more idleness criteria is provided. The micro-jobs are executed on an ongoing basis, but only when the resources needed by the micro-jobs are not needed by other jobs. A software program utilizing this methodology may be run at all times while the computer is powered up without impacting the performance of other software programs running on the same computer system.Type: GrantFiled: July 4, 2016Date of Patent: August 8, 2017Assignee: Invisitasking LLCInventors: Craig Jensen, Andrew Staffer, Basil Thomas
-
Patent number: 9588809Abstract: Resource-based scheduling of computer jobs is disclosed. A computer job is scheduled based on utilization of a resource and a utilization criterion that the computer job has pertaining to the resource, in accordance with an embodiment of the present invention.Type: GrantFiled: October 10, 2006Date of Patent: March 7, 2017Assignee: Invistasking LLCInventors: Craig Jensen, Andrew Staffer, Basil Thomas, Richard Cadruvi
-
Publication number: 20160314015Abstract: A method, system, and apparatus to divide a computing job into micro-jobs and allocate the execution of the micro-jobs to times when needed resources comply with one or more idleness criteria is provided. The micro-jobs are executed on an ongoing basis, but only when the resources needed by the micro-jobs are not needed by other jobs. A software program utilizing this methodology may be run at all times while the computer is powered up without impacting the performance of other software programs running on the same computer system.Type: ApplicationFiled: July 4, 2016Publication date: October 27, 2016Inventors: Craig Jensen, Andrew Staffer, Basil Thomas
-
Patent number: 9384040Abstract: A method, system, and apparatus to divide a computing job into micro-jobs and allocate the execution of the micro-jobs to times when needed resources comply with one or more idleness criteria is provided. The micro-jobs are executed on an ongoing basis, but only when the resources needed by the micro-jobs are not needed by other jobs. A software program utilizing this methodology may be run at all times while the computer is powered up without impacting the performance of other software programs running on the same computer system.Type: GrantFiled: August 7, 2012Date of Patent: July 5, 2016Assignee: CONDUSIV TECHNOLOGIES CORPORATIONInventors: Craig Jensen, Andrew Staffer, Basil Thomas
-
Patent number: 9043374Abstract: A system and method for efficient data storage, which reduces data entropy of data on a data storage device. The technique organizes related data entities (such as files on a hard drive) in close physical proximity and in a predictive or ordered sequence, to reduce the amount of time and effort (mechanical, computational, or otherwise) a storage/retrieval device needs to expend locating each data related entity as it processes a sequence of requests. In addition, the data may be organized and stored according to a file directory index structure, whereby file fragmentation is reduced.Type: GrantFiled: October 25, 2011Date of Patent: May 26, 2015Assignee: iolo technologies, LLCInventors: Andrew Staffer, Noah T. Rowles
-
Patent number: 9043373Abstract: A system and method for efficient data storage, which reduces data entropy of data on a data storage device. The technique organizes related data entities (such as files on a hard drive) in close physical proximity and in a predictive or ordered sequence, to reduce the amount of time and effort (mechanical, computational, or otherwise) a storage/retrieval device needs to expend locating each related data entity as it processes a sequence of requests. In addition, the data may be organized and stored according to a file directory index structure, whereby file fragmentation is reduced.Type: GrantFiled: August 17, 2010Date of Patent: May 26, 2015Assignee: iolo technologies, LLCInventors: Andrew Staffer, Noah T. Rowles
-
Patent number: 8892611Abstract: A method, system, and apparatus for improving performance when retrieving data from one or more storage media. Files to be stored on the one or more storage media are classified into a ranking of different sets. Differences in retrieval value of different regions of the one or more storage media are exploited by selecting which files to store in which regions. For example, files that have a higher classification are stored in regions with faster retrieval values. The files can be classified based on frequency of access. Thus, files that are more frequently accessed are stored in regions that have a faster retrieval value. The files can be classified by another measure such as priority. For example, the classification for some or all of the files can be based on user-assigned priority. The classification may be based on events or data grouping.Type: GrantFiled: December 17, 2010Date of Patent: November 18, 2014Assignee: Condusiv Technologies CorporationInventors: Craig Jensen, Andrew Staffer, Robert Stevens Kleinschmidt, Jr., Sopurkh Khalsa, Gary Quan
-
Patent number: 8732148Abstract: A method, system, and apparatus for improving performance when retrieving data from one or more storage media. Files to be stored on the one or more storage media are classified into a ranking of different sets. Differences in retrieval value of different regions of the one or more storage media are exploited by selecting which files to store in which regions. For example, files that have a higher classification are stored in regions with faster retrieval values. The files can be classified based on frequency of access. Thus, files that are more frequently accessed are stored in regions that have a faster retrieval value. The files can be classified by another measure such as priority. For example, the classification for some or all of the files can be based on user-assigned priority. The classification may be based on events or data grouping.Type: GrantFiled: July 1, 2011Date of Patent: May 20, 2014Assignee: Condusiv Technologies CorporationInventors: Craig Jensen, Andrew Staffer, Robert Stevens Kleinschmidt, Jr., Sopurkh Khalsa, Gary Quan
-
Publication number: 20140108392Abstract: A method, system, and apparatus for improving performance when retrieving data from one or more storage media. Files to be stored on the one or more storage media are classified into a ranking of different sets. Differences in retrieval value of different regions of the one or more storage media are exploited by selecting which files to store in which regions. For example, files that have a higher classification are stored in regions with faster retrieval values. The files can be classified based on frequency of access. Thus, files that are more frequently accessed are stored in regions that have a faster retrieval value. The files can be classified by another measure such as priority. For example, the classification for some or all of the files can be based on user-assigned priority. The classification may be based on events or data grouping.Type: ApplicationFiled: December 17, 2013Publication date: April 17, 2014Applicant: CONDUSIV TECHNOLOGIES CORPORATIONInventors: Craig Jensen, Andrew Staffer, Robert Stevens Kleinschmidt, JR., Sopurkh Khalsa, Gary Quan
-
Patent number: 8645347Abstract: A method, system, and apparatus for improving performance when retrieving data from one or more storage media. Files to be stored on the one or more storage media are classified into a ranking of different sets. Differences in retrieval value of different regions of the one or more storage media are exploited by selecting which files to store in which regions. For example, files that have a higher classification are stored in regions with faster retrieval values. The files can be classified based on frequency of access. Thus, files that are more frequently accessed are stored in regions that have a faster retrieval value. The files can be classified by another measure such as priority. For example, the classification for some or all of the files can be based on user-assigned priority. The classification may be based on events or data grouping.Type: GrantFiled: June 30, 2011Date of Patent: February 4, 2014Assignee: Condusiv Technologies CorporationInventors: Craig Jensen, Andrew Staffer, Robert Stevens Kleinschmidt, Jr., Sopurkh Khalsa, Gary Quan
-
Patent number: 8615765Abstract: Computer micro-jobs are disclosed. A computer job is divided into micro-jobs. In one embodiment, the micro-jobs have a size that allows a particular micro-job to complete within an allotted time for which the particular micro-job owns a resource used to execute the micro-job. In one embodiment, the allotted time is a quantum. In one embodiment, an entire computer job is divided into micro-jobs and the computer job is then executed micro-job by micro-job until the entire computer job is complete. Each of the micro-jobs may complete its execution within its quantum, in one embodiment. In one embodiment, the execution of the micro-jobs is allocated to times when needed resources comply with one or more idleness criteria. A software program executed with micro-jobs may be run at all times while the computer is powered up without impacting the performance of other software programs running on the same computer system.Type: GrantFiled: November 2, 2011Date of Patent: December 24, 2013Assignee: Condusiv Technologies CorporationInventors: Craig Jensen, Andrew Staffer, Basil Thomas, Richard Cadruvi
-
Publication number: 20120304181Abstract: A method, system, and apparatus to divide a computing job into micro-jobs and allocate the execution of the micro-jobs to times when needed resources comply with one or more idleness criteria is provided. The micro-jobs are executed on an ongoing basis, but only when the resources needed by the micro-jobs are not needed by other jobs. A software program utilizing this methodology may be run at all times while the computer is powered up without impacting the performance of other software programs running on the same computer system.Type: ApplicationFiled: August 7, 2012Publication date: November 29, 2012Inventors: Craig Jensen, Andrew Staffer, Basil Thomas
-
Patent number: 8239869Abstract: A method, system, and apparatus to divide a computing job into micro-jobs and allocate the execution of the micro-jobs to times when needed resources comply with one or more idleness criteria is provided. The micro-jobs are executed on an ongoing basis, but only when the resources needed by the micro-jobs are not needed by other jobs. A software program utilizing this methodology may be run at all times while the computer is powered up without impacting the performance of other software programs running on the same computer system.Type: GrantFiled: June 19, 2006Date of Patent: August 7, 2012Assignee: Condusiv Technologies CorporationInventors: Craig Jensen, Andrew Staffer, Basil Thomas
-
Publication number: 20120078985Abstract: A system and method for efficient data storage, which reduces data entropy of data on a data storage device. The technique organizes related data entities (such as files on a hard drive) in close physical proximity and in a predictive or ordered sequence, to reduce the amount of time and effort (mechanical, computational, or otherwise) a storage/retrieval device needs to expend locating each data entity as it processes a sequence of requests. For example, the data may be organized and stored according to a file directory index structure, whereby data and free space fragmentation is also reduced.Type: ApplicationFiled: October 25, 2011Publication date: March 29, 2012Inventors: Andrew Staffer, Noah T. Rowles
-
Publication number: 20120054769Abstract: Computer micro-jobs are disclosed. A computer job is divided into micro-jobs. In one embodiment, the micro-jobs have a size that allows a particular micro-job to complete within an allotted time for which the particular micro-job owns a resource used to execute the micro-job. In one embodiment, the allotted time is a quantum. In one embodiment, an entire computer job is divided into micro-jobs and the computer job is then executed micro-job by micro-job until the entire computer job is complete. Each of the micro-jobs may complete its execution within its quantum, in one embodiment. In one embodiment, the execution of the micro-jobs is allocated to times when needed resources comply with one or more idleness criteria. A software program executed with micro-jobs may be run at all times while the computer is powered up without impacting the performance of other software programs running on the same computer system.Type: ApplicationFiled: November 2, 2011Publication date: March 1, 2012Inventors: Craig Jensen, Andrew Staffer, Basil Thomas, Richard Cadruvi
-
Publication number: 20120047189Abstract: A system and method for efficient data storage, which reduces data entropy of data on a data storage device. The technique organizes related data entities (such as files on a hard drive) in close physical proximity and in a predictive or ordered sequence, to reduce the amount of time and effort (mechanical, computational, or otherwise) a storage/retrieval device needs to expend locating each data entity as it processes a sequence of requests. For example, the data may be organized and stored according to a file directory index structure, whereby data and free space fragmentation is also reduced.Type: ApplicationFiled: August 17, 2010Publication date: February 23, 2012Inventors: Andrew Staffer, Noah T. Rowles
-
Patent number: 8086819Abstract: A method for optimizing a solid state drive is described. The method involves determining whether a free space fragment on the SSD is smaller than the threshold fragment size. If the free space fragment on the SSD is smaller than the threshold fragment size, eliminating the free space fragment. If the free space fragment on the SSD is not smaller than the threshold fragment size, retaining the free space fragment for storing data. Elimination of the free space fragments smaller than the threshold fragment size results in a fewer number of free space fragments being used when writing to the SSD, allowing for improved SSD performance.Type: GrantFiled: October 3, 2008Date of Patent: December 27, 2011Assignee: Diskeeper CorporationInventors: Basil Thomas, Craig Jensen, Andrew Staffer, Santhosh Ramankutty
-
Patent number: 8056083Abstract: Computer micro-jobs are disclosed. A computer job is divided into micro-jobs. In one embodiment, the micro-jobs have a size that allows a particular micro-job to complete within an allotted time for which the particular micro-job owns a resource used to execute the micro-job. In one embodiment, the allotted time is a quantum. In one embodiment, an entire computer job is divided into micro-jobs and the computer job is then executed micro-job by micro-job until the entire computer job is complete. Each of the micro-jobs may complete its execution within its quantum, in one embodiment. In one embodiment, the execution of the micro-jobs is allocated to times when needed resources comply with one or more idleness criteria. A software program executed with micro-jobs may be run at all times while the computer is powered up without impacting the performance of other software programs running on the same computer system.Type: GrantFiled: October 10, 2006Date of Patent: November 8, 2011Assignee: Diskeeper CorporationInventors: Craig Jensen, Andrew Staffer, Basil Thomas, Richard Cadruvi
-
Publication number: 20110270839Abstract: A method, system, and apparatus for improving performance when retrieving data from one or more storage media. Files to be stored on the one or more storage media are classified into a ranking of different sets. Differences in retrieval value of different regions of the one or more storage media are exploited by selecting which files to store in which regions. For example, files that have a higher classification are stored in regions with faster retrieval values. The files can be classified based on frequency of access. Thus, files that are more frequently accessed are stored in regions that have a faster retrieval value. The files can be classified by another measure such as priority. For example, the classification for some or all of the files can be based on user-assigned priority. The classification may be based on events or data grouping.Type: ApplicationFiled: June 30, 2011Publication date: November 3, 2011Applicant: Diskeeper CorporationInventors: Craig Jensen, Andrew Staffer, Robert Stevens Kleinschmidt, JR., Sopurkh Khalsa, Gary Quan
-
Publication number: 20110258186Abstract: A method, system, and apparatus for improving performance when retrieving data from one or more storage media. Files to be stored on the one or more storage media are classified into a ranking of different sets. Differences in retrieval value of different regions of the one or more storage media are exploited by selecting which files to store in which regions. For example, files that have a higher classification are stored in regions with faster retrieval values. The files can be classified based on frequency of access. Thus, files that are more frequently accessed are stored in regions that have a faster retrieval value. The files can be classified by another measure such as priority. For example, the classification for some or all of the files can be based on user-assigned priority. The classification may be based on events or data grouping.Type: ApplicationFiled: July 1, 2011Publication date: October 20, 2011Applicant: Diskeeper CorporationInventors: Craig Jensen, Andrew Staffer, Robert Stevens Kleinschmidt, JR., Sopurkh Khalsa, Gary Quan