Results 261 to 270 of about 88,406 (306)
Optimizing storage on fog computing edge servers: A recent algorithm design with minimal interference. [PDF]
PLoS OneZhao X +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM Transactions on Algorithms, 2003
This article presents asymptotically optimal algorithms for rectangular matrix transpose, fast Fourier transform (FFT), and sorting on computers with multiple levels of caching. Unlike previous optimal algorithms, these algorithms are cache oblivious : no variables dependent on hardware parameters, such as cache ...
M. Frigo +3 more
+4 more sources
This article presents asymptotically optimal algorithms for rectangular matrix transpose, fast Fourier transform (FFT), and sorting on computers with multiple levels of caching. Unlike previous optimal algorithms, these algorithms are cache oblivious : no variables dependent on hardware parameters, such as cache ...
M. Frigo +3 more
+4 more sources
Self‐tuning caching: the Universal Caching algorithm
Software: Practice and Experience, 2006AbstractA cache replacement policy is normally suited to a particular class of applications, or limited to a set of fixed criteria for evaluating the cache‐worthiness of an object. We present Universal Caching as a mechanism to capture the generality of the most adaptive algorithms, while depending on a very limited set of basic criteria for cache ...
Ganesh Santhanakrishnan +2 more
openaire +1 more source
Web caching through modified cache replacement algorithm
2012 International Conference on Recent Trends in Information Technology, 2012Web caching is a mechanism used to improve network performance by reducing network traffic, load on the Web Server and delay in accessing the Web page. This is achieved by storing frequently accessed Web pages on proxy cache placed within the network. Caching can be taken place either at client side or in the proxy Server.
V. Sathiyamoorthi, V. Murali Bhaskaran
openaire +1 more source
Computational Mathematics and Modeling, 2010
The memory in modern computer systems has a highly complex hierarchy. The farther the memory from the processor, the larger it is, but also the slower. Each computer has its own architecture and its own cache memory, and it is not easy to write an algorithm that will run with equal efficiency on all computers.
openaire +1 more source
The memory in modern computer systems has a highly complex hierarchy. The farther the memory from the processor, the larger it is, but also the slower. Each computer has its own architecture and its own cache memory, and it is not easy to write an algorithm that will run with equal efficiency on all computers.
openaire +1 more source
Placement Algorithms for Hierarchical Cooperative Caching
Journal of Algorithms, 2001Summary: Consider a hierarchical network in which each node periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following conditions are satisfied: the frequency with which each node accesses each object is known; each node has a cache of known capacity; any cache can be accessed by any node;
Korupolu, Madhukar R. +2 more
openaire +1 more source
Energy effficient cache node placement using genetic algorithm & cooperative caching algorithm
2015 2nd International Conference on Electronics and Communication Systems (ICECS), 2015Optimization of communication among sensors to serve data in short latency and minimal energy is necessitated for some of the wireless sensor network applications. For a self-organizing wireless sensor network Genetic Algorithm based multi-objective methodology is developed and is used as a technique in the selection of sensor nodes which play special ...
M Shahaziya Parvez, H. M. Divya
openaire +1 more source
Cache Line Aware Algorithm Design for Cache-Coherent Architectures
IEEE Transactions on Parallel and Distributed Systems, 2016The increase in the number of cores per processor and the complexity of memory hierarchies make cache coherence key for programmability of current shared memory systems. However, ignoring its detailed architectural characteristics can harm performance significantly.
Sabela Ramos, Torsten Hoefler
openaire +1 more source