Search results for "cache"
showing 10 items of 79 documents
Motores de búsqueda y derechos de autor: infracción y responsabilidad
2015
Los motores de búsqueda se configuran como herramientas indispensables para localizar fácilmente cualquier tipo de información entre las más de tres billones de páginas web existentes en la red. Estos buscadores se presentan, de facto, como instrumentos básicos para que todo usuario pueda tener acceso a la información, cultura y educación, de manera que están convirtiéndose en unas herramientas indispensables para el libre desarrollo de las personas. Sin embargo, a pesar de estas ventajas, en ocasiones, los buscadores vuelcan contenidos protegidos en la página de resultados sin autorización de su titular, de forma que de no mediar algún límite o excepción tasado en la ley, pueden estar vuln…
Role of different endurance training programs on cancer cachexia:pointing particular attention to the gender and age differences Macaluso
2013
Evidence from recent publications indicates that repeated exercise may enhance the quality of life of cancer patients (Maddocks et al., 2012). Regular physical activity may attenuate the adverse effects of cancer therapy, prevent or reverse cachexia and improve survival, although not all the patients are able or willing to undertake programs currently being offered. The aims of this study were to analyze: i) the effects of a progressive endurance exercise (progressive Training, pTR) on survival and cachexia in sedentary (SED) mice inoculated (I) with a fresh fragment of solid C26 tumor [SED-I-pTR; SED-I-SED]; ii) the effect of different protocols of endurance exercise (Trained for 30 min, T…
LPCC
2019
Most high-performance computing (HPC) clusters use a global parallel file system to enable high data throughput. The parallel file system is typically centralized and its storage media are physically separated from the compute cluster. Compute nodes as clients of the parallel file system are often additionally equipped with SSDs. The node internal storage media are rarely well-integrated into the I/O and compute workflows. How to make full and flexible use of these storage media is therefore a valuable research question. In this paper, we propose a hierarchical Persistent Client Caching (LPCC) mechanism for the Lustre file system. LPCC provides two modes: RW-PCC builds a read-write cache on…
ESB: Ext2 Split Block Device
2012
Solid State Disks (SSDs) start to replace rotating media (hard disks, HDD) in many areas, but are still not as cost efficient concerning capacity to completely replace them. One approach to use their superior performance properties is to use them as a cache for magnetic disks to speed up overall storage operations. In this paper, we present and evaluate a file system level optimization based on ext2. We split metadata and data and store the metadata on a SDD while the data remains on a common HDD. We evaluate our system with filebench under a file server, web server, and web proxy scenario and compare the results with flashcache. We find that many of the scenarios do not contain enough meta…
New Molecular Targets and Lifestyle Interventions to Delay Aging Sarcopenia
2014
The term sarcopenia was originally created to refer age-related loss of muscle mass with consequent loss of strength (Morley et al., 2001). There are now four international definitions of sarcopenia (Cruz-Jentoft et al., 2010; Muscaritoli et al., 2010; Morley et al., 2011). In essence they all agree, requiring a measure of walking capability [either low gait speed or a limited endurance (distance) in a 6-min walk], together with an appendicular lean mass of <2 SDs of a sex and ethnically corrected normal level for individuals 20–30 years old. Sarcopenia is a prevalent health problem among the elderly. On average, 5–13 and 11–50% of people aged 60−70 years and ≥80 years, respectively suffer …
Multi-objective optimisations for a superscalar architecture with selective value prediction
2012
This work extends an earlier manual design space ex ploration of our developed Selective Load Value Pre diction based superscalar architecture to the L2 unified cache. A fter that we perform an automatic design space expl oration using a special developed software tool by varying several architectural parameters. Our goal is to find optim al configurations in terms of CPI (Cycles per Instruction) and energy consumption. By varying 19 architectural parameter s, as we proposed, the design space is over 2.5 millions of billions configurations which obviously means that only heuristic search can be considered. Therefore, we propose dif ferent methods of automatic design space exploratio n based…
Optimization of Application-Specific L1 Cache Translation Functions of the LEON3 Processor
2020
Reconfigurable caches offer an intriguing opportunity to tailor cache behavior to applications for better run-times and energy consumptions. While one may adapt structural cache parameters such as cache and block sizes, we adapt the memory-address-to-cache-index mapping function to the needs of an application. Using a LEON3 embedded multi-core processor with reconfigurable cache mappings, a metaheuristic search procedure, and Mibench applications, we show in this work how to accurately compare non-deterministic performances of applications and how to use this information to implement an optimization procedure that evolves application-specific cache mappings.
The Design of Secure and Efficient P2PSIP Communication Systems
2010
Recently, both academia and industry have initiated research projects directed on integration of P2PSIP paradigm into communication systems. In this paradigm, P2P network stores most of the network information among participating peers without help of the central servers. The concept of self-configuration, self-establishment greatly improves the robustness of the network system compared with the traditional Client/Server based systems. In this paper, we propose a system architecture for constructing efficient and secure P2PSIP communication systems. The proposed approach includes three-layer hierarchical overlay division, peer identifier assignment, cache based efficiency enhancement, proxy…
Exploiting selective instruction reuse and value prediction in a superscalar architecture
2009
In our previously published research we discovered some very difficult to predict branches, called unbiased branches. Since the overall performance of modern processors is seriously affected by misprediction recovery, especially these difficult branches represent a source of important performance penalties. Our statistics show that about 28% of branches are dependent on critical Load instructions. Moreover, 5.61% of branches are unbiased and depend on critical Loads, too. In the same way, about 21% of branches depend on MUL/DIV instructions whereas 3.76% are unbiased and depend on MUL/DIV instructions. These dependences involve high-penalty mispredictions becoming serious performance obstac…
XLCS: A New Bit-Parallel Longest Common Subsequence Algorithm on Xeon Phi Clusters
2019
Finding the longest common subsequence (LCS) of two strings is a classical problem in bioinformatics. A basic approach to solve this problem is based on dynamic programming. As the biological sequence databases are growing continuously, bit-parallel sequence comparison algorithms are becoming increasingly important. In this paper, we present XLCS, a new parallel implementation to accelerate the LCS algorithm on Xeon Phi clusters by performing bit-wise operations. We have designed an asynchronous IO framework to improve the data transfer efficiency. To make full use of the computing resources of Xeon Phi clusters, we use three levels of parallelism: node-level, thread-level and vector-level.…