Managing service requests with common renewable resources

Abstract

This article discusses managing fulfillment of requests for services that have dependencies on common human and computing resources. The objective of this research is to minimize the duration of a group of requests that utilize partially overlapping sets of renewable resources. Minimizing the latency between the fulfillments is a critical design consideration in managing these requests. A reduction in latency could lead to the minimization of the total span of a group of requests, and is the key to achieving high levels of a resource's usage and cost-effective process management. It is evident that these latency problems must be either drastically reduced or effectively hidden. The approach described in this article is an interesting hybrid of the two, providing both the significant latency reduction, as well as the mechanism for hiding some of remaining delays.

本文在探討如何管理與人員和計算資源相關之服務請求。 本研究之目的在於最小化對於可再生資源之使用有部份時間重疊之一群請求服務之期間。 在管理這些請求中 ， 最小化完成服務請求間之潛在因素是一個重要的設計考量。 一個潛在因素的減少可以導致一群服務請求之總作業時間最小化 ， 其為一個實踐高水平的資源使用和成本效益程序管理之關鍵。 很顯然 ， 這些潛在因素的問題必須要大大的降低或是有效的隱藏。 本文所介紹的方法是這兩種有趣的混合 ， 可同時提供降低兩者之潛在因素以及可以隱藏一些剩餘延遲之結構。

(*聯絡人: [email protected])

Keywords:

• processes with common resources
• scheduling service requests
• cloud security
• resource scheduling

Keywords:

• 關鍵詞: 共用資源程序 ， 服務要求排程 ， 雲端安全 ， 資源排程

Notes

(*聯絡人: [email protected])