scholarly journals Enhancing spatial locality via data layout optimizations

Author(s):  
M. Kandemir ◽  
A. Choudhary ◽  
J. Ramanujam ◽  
N. Shenoy ◽  
P. Banerjee
Keyword(s):  
Author(s):  
Song Jiang

As the hard disk remains as the mainstream on-line storage device, it continues to be the performance bottleneck of data-intensive applications. One of existing most effective solutions to ameliorate the bottleneck is to use the buffer cache in the OS kernel to achieve two objectives: reduction of direct access of on-disk data and improvement of disk performance. These two objectives can be achieved by applying both temporal locality and spatial locality in the management of the buffer cache. Traditionally only temporal locality is exploited for the purpose, and spatial locality, which refers to the on-disk sequentiality of requested blocks, is largely ignored. As the throughput of access of sequentially-placed disk blocks can be an order of magnitude higher than that of access to randomly-placed blocks, the missing of spatial locality in the buffer management can cause the performance of applications without dominant sequential accesses to be seriously degraded. In the chapter, we introduce a state-of-the-art technique that seamlessly combines these two locality properties embedded in the data access patterns into the management of the kernel buffer cache management. After elaboration on why the spatial locality is needed in addition to the temporal locality, we detail a framework, DULO (DUal LOcality), in which these two properties are taken account of simultaneously. A prototype implementation of DULO in the Linux kernel as well as some experiment results are presented, showing that DULO can significantly increases disk I/O throughput for real-world applications such as Web server, TPC benchmark, file system benchmark, and scientific programs. It reduces their execution times by as much as 53%. We conclude the chapter by identifying and encouraging a new direction for research and practice on the improvement of disk I/O performance, which is to expose more disk-specific data layout and access patterns to the upper-level system software for disk-oriented policies.


2021 ◽  
Vol 103 (15) ◽  
Author(s):  
Minjae Kim ◽  
Hu Miao ◽  
Sangkook Choi ◽  
Manuel Zingl ◽  
Antoine Georges ◽  
...  

2021 ◽  
Author(s):  
Bashar Romanous ◽  
Skyler Windh ◽  
Ildar Absalyamov ◽  
Prerna Budhkar ◽  
Robert Halstead ◽  
...  

AbstractThe join and group-by aggregation are two memory intensive operators that are affecting the performance of relational databases. Hashing is a common approach used to implement both operators. Recent paradigm shifts in multi-core processor architectures have reinvigorated research into how the join and group-by aggregation operators can leverage these advances. However, the poor spatial locality of the hashing approach has hindered performance on multi-core processor architectures which rely on using large cache hierarchies for latency mitigation. Multithreaded architectures can better cope with poor spatial locality by masking memory latency with many outstanding requests. Nevertheless, the number of parallel threads, even in the most advanced multithreaded processors, such as UltraSPARC, is not enough to fully cover the main memory access latency. In this paper, we explore the hardware re-configurability of FPGAs to enable deeper execution pipelines that maintain hundreds (instead of tens) of outstanding memory requests across four FPGAs-drastically increasing concurrency and throughput. We present two end-to-end in-memory accelerators for the join and group-by aggregation operators using FPGAs. Both accelerators use massive multithreading to mask long memory delays of traversing linked-list data structures, while concurrently managing hundreds of thread states across four FPGAs locally. We explore how content addressable memories can be intermixed within our multithreaded designs to act as a synchronizing cache, which enforces locks and merges jobs together before they are written to memory. Throughput results for our hash-join operator accelerator show a speedup between 2$$\times $$ × and 3.4$$\times $$ × over the best multi-core approaches with comparable memory bandwidths on uniform and skewed datasets. The accelerator for the hash-based group-by aggregation operator demonstrates that leveraging CAMs achieves average speedup of 3.3$$\times $$ × with a best case of 9.4$$\times $$ × in terms of throughput over CPU implementations across five types of data distributions.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Fatmah Alantali ◽  
Yasmin Halawani ◽  
Baker Mohammad ◽  
Mahmoud Al-Qutayri
Keyword(s):  

2021 ◽  
Vol 20 (1) ◽  
Author(s):  
Roula Zougheibe ◽  
Jianhong (Cecilia) Xia ◽  
Ashraf Dewan ◽  
Ori Gudes ◽  
Richard Norman

Abstract Background Numerous studies have examined the association between safety and primary school-aged children’s forms of active mobility. However, variations in studies’ measurement methods and the elements addressed have contributed to inconsistencies in research outcomes, which may be forming a barrier to advancing researchers’ knowledge about this field. To assess where current research stands, we have synthesised the methodological measures in studies that examined the effects of neighbourhood safety exposure (perceived and measured) on children’s outdoor active mobility behaviour and used this analysis to propose future research directions. Method A systematic search of the literature in six electronic databases was conducted using pre-defined eligibility criteria and was concluded in July 2020. Two reviewers screened the literature abstracts to determine the studies’ inclusion, and two reviewers independently conducted a methodological quality assessment to rate the included studies. Results Twenty-five peer-reviewed studies met the inclusion criteria. Active mobility behaviour and health characteristics were measured objectively in 12 out of the 25 studies and were reported in another 13 studies. Twenty-one studies overlooked spatiotemporal dimensions in their analyses and outputs. Delineations of children’s neighbourhoods varied within 10 studies’ objective measures, and the 15 studies that opted for subjective measures. Safety perceptions obtained in 22 studies were mostly static and primarily collected via parents, and dissimilarities in actual safety measurement methods were present in 6 studies. The identified schematic constraints in studies’ measurement methods assisted in outlining a three-dimensional relationship between ‘what’ (determinants), ‘where’ (spatial) and ‘when’ (time) within a methodological conceptual framework. Conclusions The absence of standardised measurement methods among relevant studies may have led to the current diversity in findings regarding active mobility, spatial (locality) and temporal (time) characteristics, the neighbourhood, and the representation of safety. Ignorance of the existing gaps and heterogeneity in measures may impact the reliability of evidence and poses a limitation when synthesising findings, which could result in serious biases for policymakers. Given the increasing interest in children’s health studies, we suggested alternatives in the design and method of measures that may guide future evidence-based research for policymakers who aim to improve children’s active mobility and safety.


2013 ◽  
Vol 48 (8) ◽  
pp. 283-284 ◽  
Author(s):  
Jun Liu ◽  
Wei Ding ◽  
Ohyoung Jang ◽  
Mahmut Kandemir

2021 ◽  
Vol 13 (1) ◽  
pp. 168781402098732
Author(s):  
Ayisha Nayyar ◽  
Ummul Baneen ◽  
Syed Abbas Zilqurnain Naqvi ◽  
Muhammad Ahsan

Localizing small damages often requires sensors be mounted in the proximity of damage to obtain high Signal-to-Noise Ratio in system frequency response to input excitation. The proximity requirement limits the applicability of existing schemes for low-severity damage detection as an estimate of damage location may not be known  a priori. In this work it is shown that spatial locality is not a fundamental impediment; multiple small damages can still be detected with high accuracy provided that the frequency range beyond the first five natural frequencies is utilized in the Frequency response functions (FRF) curvature method. The proposed method presented in this paper applies sensitivity analysis to systematically unearth frequency ranges capable of elevating damage index peak at correct damage locations. It is a baseline-free method that employs a smoothing polynomial to emulate reference curvatures for the undamaged structure. Numerical simulation of steel-beam shows that small multiple damages of severity as low as 5% can be reliably detected by including frequency range covering 5–10th natural frequencies. The efficacy of the scheme is also experimentally validated for the same beam. It is also found that a simple noise filtration scheme such as a Gaussian moving average filter can adequately remove false peaks from the damage index profile.


Sign in / Sign up

Export Citation Format

Share Document