نتایج جستجو برای: data placement
تعداد نتایج: 2468213 فیلتر نتایج به سال:
The main issues characterizing current video applications are their strong requirements for huge storage spaces and their need for timing synchronization Video data storage is a critical research topic due to the so called I O bottle neck problem which a ects the quality of service of video applications This paper introduces a two level video data representation model in order to guide video da...
This paper studies the energy efficiency of composable datacentre (DC) infrastructures over network topologies. Using a mixed integer linear programming (MILP) model, we compare performance disaggregation at rack-scale and pod-scale selected electrical, optical hybrid topologies relative to traditional DC. Relative DC, results show that physical is sufficient for optimal when topology adopted r...
Data placement is an essential part of today’s distributed applications since moving the data close to the application has many benefits. The increasing data requirements of both scientific and commercial applications, and collaborative access to these data make it even more important. In the current approach, data placement is regarded as a side affect of computation. Our goal is to make data ...
current studies in second language (l2) learning have revealed the positive role of corrective feedback (cf) in both oral and written forms in different language features. the present study was an attempt to investigate the effect of both direct and indirect written corrective feedback (wcf) on the use of grammatical collocations in l2 writing. the study also sought to examine whether the effec...
This paper proposes a multi-criteria data placement mechanism for typical cloud storage systems. The primary goal of this study is to place the clients’ files in cluster by taking into account principles service level agreements and levels user support services. For purpose, scoring model defined based on trade-off between three criteria that can be crucial from viewpoint: access latency, priva...
We investigate the total number of diagonals that can be placed in the unit squares of a given grid in such a way that no two diagonals have a common point. We develop theoretical and computational results for square and rectangular shaped grids, and extend the problem to three-dimensional arrays. We pose some open questions for further investigation.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید