公开(公告)号：US11048554B1

公开(公告)日：2021-06-29

申请号：US16366868

申请日：2019-03-27

Applicant: Amazon Technologies, Inc.

Inventor： Patrick E. Brennan ,  Mitchell Flaherty ,  Christopher Magee Greenwood ,  Wells Lin ,  Sriram Venugopal ,  Linfeng Yu ,  Yilin Guo ,  Alexander R. Yee ,  Gary Michael Herndon

IPC: G06F9/38 ,  G06F9/54 ,  G06F17/15 ,  G06F9/50 ,  H04L29/08

Abstract: Systems and methods are disclosed for handling requests to create multiple volumes with an expected usage correlation on a block storage service. Rather than handling each request to create a volume independently, embodiments described herein can handle the request in bulk. In one embodiment, the service allows for oversubscription of use on hosts, as well as parallelization of placement decisions, by distributing requests among a set of parallelized placement engines. Each engine can distribute its subset of volumes at least partly randomly among a candidate set of volumes, with the size of the candidate set selected based on a total number of volumes. This distribution mechanism can ensure distribution of volumes without requiring centralized placement of the volumes.

公开(公告)号：US11080092B1

公开(公告)日：2021-08-03

申请号：US16366836

申请日：2019-03-27

Applicant: Amazon Technologies, Inc.

Inventor： Yilin Guo ,  Christopher Magee Greenwood ,  Mitchell Flaherty ,  Sriram Venugopal ,  Wells Lin ,  Patrick E. Brennan ,  Linfeng Yu ,  Alexander R. Yee ,  Gary Michael Herndon

IPC: G06F9/46 ,  G06F9/50 ,  G06F9/54 ,  H04L29/08 ,  G06F9/38 ,  G06F17/15

Abstract: Systems and methods are disclosed for handling requests to create multiple volumes with an expected usage correlation on a block storage service. Rather than handling each request to create a volume independently, embodiments described herein can handle the request in bulk, quickly determining whether the request as a whole can be handled at the system. In one embodiment, the service allows for oversubscription of use on hosts, as well as parallelization of placement decisions, by rejecting placement requests when a number of possible hosts for a volume within a requested set falls below a candidate set size, which is determined based on factors such as a number of requested volumes and an expected accuracy of state information for the service at a placement engine within a distributed set of engines.