Resource allocation is one of the main issues for providing services in an efficient way on distributed database. Improving the performance is one of the key research issues by proper design of efficient distributed database and proper usage of resources in information technology. The cost of each computational service depends on the amount of computations. The system resources have to be allocated in order to handle the workload and minimize the cost of computing by using proper allocation strategy. Performance is strongly related to the allocation of resources and data fragments in distributed environment. The query requires data to be accessed from one or multiple sites. The required data are fragmented and placed in various data center, where resources exist. In this paper we propose an algorithm to minimize the total data-transfer cost required for processing the queries by proper allocation of resources. We are finding the optimum allocation strategy, which predicts the performance by estimating the cost.
No takes yet. Share an insight, caveat, or question.
Jagannatha et al. (2016) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: