公开(公告)号：US10061621B1

公开(公告)日：2018-08-28

申请号：US15952819

申请日：2018-04-13

Applicant: SAS Institute Inc.

Inventor： Feng Chen, II ,  Matthew Scott Maxwell ,  Tugrul Sanli ,  Xiaodong Yao

IPC: G06F9/46 ,  G06F9/50 ,  G06F9/48

CPC classification number: G06F9/5066 ,  G06F9/4843 ,  G06F9/5072 ,  G06F2209/5022

Abstract: In one example, a system can receive configuration data indicating how resources can be combined, identify availability data indicating the total number of various resources that are available, and determine maximum-capacity data using the availability data and the configuration data. The system can also receive distribution data having probability distributions for jobs to be implemented using the resources, determine capacity valuations using the distribution data and the availability data, and determine a configuration of resources using the capacity valuations and the maximum-capacity data. Thereafter, the system can receive a job and determine that a valuation for the job exceeds a predefined threshold associated with using the configuration of resources. In response to determining that the valuation exceeds the predefined threshold, the system can assign the resources to the job in the configuration. The system can then cause the job to be performed using the configuration of resources assigned to the job.

公开(公告)号：US10261837B2

公开(公告)日：2019-04-16

申请号：US16023949

申请日：2018-06-29

Applicant: SAS Institute Inc.

Inventor： Feng (Jason) Chen ,  Matthew Scott Maxwell ,  Tugrul Sanli ,  Xiaodong Yao

IPC: G06F9/46 ,  G06F9/50 ,  G06F9/48 ,  H04L12/911 ,  G06N7/00 ,  H04L29/08

Abstract: Exemplary embodiments relate to the problem of allocating a finite number of units of a resource among requestors willing to offer different amounts of value for the resource. When different classes of requestors are permitted to cancel the request or fail to show up to collect the unit of the resource with different probabilities (collectively referred to as “wash”), the problem becomes difficult to solve efficiently. According to the procedures described herein, the capacity is artificially inflated to offset the impact of wash, and then protection levels are computed using the inflated capacity as if there was no wash. The capacity is then artificially inflated again based on the new protection levels, and the process is repeated until, e.g., the results converge. Using this procedure, overallocation limits and protection levels can be computed in real-time, and accordingly the resource can be allocated efficiently as new requests are received.

公开(公告)号：US11366699B1

公开(公告)日：2022-06-21

申请号：US17670104

申请日：2022-02-11

Applicant: SAS Institute Inc.

Inventor： Altan Gulcu ,  Xiaodong Yao

IPC: G06F9/46 ,  G06F9/50 ,  G06F9/455

Abstract: Some examples describes herein relate to handling bulk requests for resources. In one example, a system can determine a bulk request parameter-value associated with a bulk request. The system can then predict a baseline benefit value, which can be a benefit value when the bulk request parameter-value is used as a lower boundary for a unit parameter-value. The system can also determine a lower boundary constraint on the unit parameter-value independently of the bulk request parameter-value. The system can then execute an iterative process using the baseline benefit value and the lower boundary constraint. Based on a result of the iterative process, the system can determine whether and how much the bulk request parameter-value should be adjusted. The system may adjust the bulk request parameter-value accordingly or output a recommendation to do so.

公开(公告)号：US20190012210A1

公开(公告)日：2019-01-10

申请号：US16023949

申请日：2018-06-29

Applicant: SAS Institute Inc.

Inventor： Feng (Jason) Chen ,  Matthew Scott Maxwell ,  Tugrul Sanli ,  Xiaodong Yao

IPC: G06F9/50 ,  G06F9/48 ,  H04L12/911 ,  G06N7/00

Abstract: Exemplary embodiments relate to the problem of allocating a finite number of units of a resource among requestors willing to offer different amounts of value for the resource. When different classes of requestors are permitted to cancel the request or fail to show up to collect the unit of the resource with different probabilities (collectively referred to as “wash”), the problem becomes difficult to solve efficiently. According to the procedures described herein, the capacity is artificially inflated to offset the impact of wash, and then protection levels are computed using the inflated capacity as if there was no wash. The capacity is then artificially inflated again based on the new protection levels, and the process is repeated until, e.g., the results converge. Using this procedure, overallocation limits and protection levels can be computed in real-time, and accordingly the resource can be allocated efficiently as new requests are received.

公开(公告)号：US09805324B2

公开(公告)日：2017-10-31

申请号：US15264256

申请日：2016-09-13

Applicant: SAS Institute Inc.

Inventor： Bingfeng Ding ,  Feng Chen ,  Kevin L. Scott ,  Metin Balikcioglu ,  Tugrul Sanli ,  Xiaodong Yao

IPC: G06Q10/06 ,  H04L12/911 ,  G06Q10/04 ,  G06Q30/02

CPC classification number: G06Q10/06312 ,  G06Q10/04 ,  G06Q10/06 ,  G06Q10/0631 ,  G06Q30/0202 ,  H04L47/823

Abstract: Exemplary embodiments are generally directed to methods, mediums, and systems for accounting for extensions or reductions of the period for which a resource (e.g., computer processor time, scientific apparatus, storage units, devices, etc.) is allocated. According to exemplary embodiments, allocation-based aggregated effects of extension and relinquishment are modeled. The modeled effects are used to offset allocation forecasts based on historical data. As a result, the dimensionality of the problem of incorporating in-house data is greatly reduced as compared to other techniques, and allocation forecasts can be made more accurately and efficiently.