限制同时异步调用数量的模式
我需要从外部系统检索多个对象。外部系统支持多个同时请求(即线程),但可能会淹没外部系统 - 因此我希望能够异步检索多个对象,但我希望能够限制同时异步请求的数量。即我需要检索 100 个项目,但不想一次检索超过 25 个项目。当 25 个请求完成时,我想触发另一个检索,一旦它们全部完成,我想按照请求的顺序返回所有结果(即,在返回整个调用之前没有必要返回结果) )。对于这类事情有什么推荐的模式吗?
像这样的东西合适吗(显然是伪代码)?
private List<externalSystemObjects> returnedObjects = new List<externalSystemObjects>;
public List<externalSystemObjects> GetObjects(List<string> ids)
{
int callCount = 0;
int maxCallCount = 25;
WaitHandle[] handles;
foreach(id in itemIds to get)
{
if(callCount < maxCallCount)
{
WaitHandle handle = executeCall(id, callback);
addWaitHandleToWaitArray(handle)
}
else
{
int returnedCallId = WaitHandle.WaitAny(handles);
removeReturnedCallFromWaitHandles(handles);
}
}
WaitHandle.WaitAll(handles);
return returnedObjects;
}
public void callback(object result)
{
returnedObjects.Add(result);
}
I need to retrieve multiple objects from an external system. The external system supports multiple simultaneous requests (i.e. threads), but it is possible to flood the external system - therefore I want to be able to retrieve multiple objects asynchronously, but I want to be able to throttle the number of simultaneous async requests. i.e. I need to retrieve 100 items, but don't want to be retrieving more than 25 of them at once. When each request of the 25 completes, I want to trigger another retrieval, and once they are all complete I want to return all of the results in the order they were requested (i.e. there is no point returning the results until the entire call is returned). Are there any recommended patterns for this sort of thing?
Would something like this be appropriate (pseudocode, obviously)?
private List<externalSystemObjects> returnedObjects = new List<externalSystemObjects>;
public List<externalSystemObjects> GetObjects(List<string> ids)
{
int callCount = 0;
int maxCallCount = 25;
WaitHandle[] handles;
foreach(id in itemIds to get)
{
if(callCount < maxCallCount)
{
WaitHandle handle = executeCall(id, callback);
addWaitHandleToWaitArray(handle)
}
else
{
int returnedCallId = WaitHandle.WaitAny(handles);
removeReturnedCallFromWaitHandles(handles);
}
}
WaitHandle.WaitAll(handles);
return returnedObjects;
}
public void callback(object result)
{
returnedObjects.Add(result);
}
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(2)
将要处理的项目列表视为一个队列,其中 25 个处理线程将任务出队、处理任务、添加结果,然后重复直到队列为空:
您可以使用异步回调执行相同的操作,无需使用线程。
Consider the list of items to process as a queue from which 25 processing threads dequeue tasks, process a task, add the result then repeat until the queue is empty:
You can do the same using asynchronous callbacks, there is no need to use threads.
使用一些类似队列的结构来保存待处理的请求是一种非常常见的模式。在可能有多层处理的 Web 应用程序中,您会看到“漏斗”样式的方法,处理更改的早期部分具有较大的队列。还可能对队列应用某种优先级,较高优先级的请求被洗牌到队列的顶部。
在您的解决方案中需要考虑的一件重要事情是,如果请求到达率高于您的处理率(这可能是由于拒绝服务攻击,或者只是今天处理的某些部分异常缓慢),那么您的队列将会增加无界限。您需要制定一些策略,例如当队列深度超过某个值时立即拒绝新请求。
Having some queue-like structure to hold the pending requests is a pretty common pattern. In Web apps where there may be several layers of processing you see a "funnel" style approach with the early parts of the processing change having larger queues. There may also be some kind of prioritisation applied to queues, higher priority requests being shuffled to the top of the queue.
One important thing to consider in your solution is that if request arrival rate is higher than your processing rate (this might be due to a Denial of Service attack, or just that some part of the processing is unusually slow today) then your queues will increase without bound. You need to have some policy such as to refuse new requests immediately when the queue depth exceeds some value.