Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,269
The Cache Performance and Optimizations of Blocked Algorithms
- In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems
, 1991
"... Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorithms operate on submatrices or blocks, so that data loaded into the faster levels of the memory hierarchy are reused. This ..."
Abstract
-
Cited by 574 (5 self)
- Add to MetaCart
is highly sensitive to the stride of data accesses and the size of the blocks, and can cause wide variations in machine performance for different matrix sizes. The conventional wisdom of trying to use the entire cache, or even a fixed fraction of the cache, is incorrect. If a fixed block size is used for a
Data Cache Sizing for Embedded Processor Applications
, 1997
"... We present a technique for determining the best data cache size required for a given memory-intensive application. ..."
Abstract
-
Cited by 18 (4 self)
- Add to MetaCart
We present a technique for determining the best data cache size required for a given memory-intensive application.
Cost-Aware WWW Proxy Caching Algorithms
- IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS
, 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and non-parameterized fash ..."
Abstract
-
Cited by 540 (6 self)
- Add to MetaCart
Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and non
An analytical model for the LISP cache size
- in Proc. IFIP Networking
, 2012
"... Abstract. Concerns regarding the scalability of the inter-domain rout-ing have encouraged researchers to start elaborating a more robust In-ternet architecture. While consensus on the exact form of the solution is yet to be found, the need for a semantic decoupling of a node’s loca-tion and identity ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
-set theory to build a model that accurately predicts a map-cache’s performance for traffic with time translation invariance of the working-set size. We validate our model empirically using four different packet traces collected in two different campus networks.
On-Line caching tis Cache Size Varies
"... Reconsider the competitiveness ofon-line strategies using k servers versus the optimal off-line strategy using h S k servers for the paging, weighted cache, and k-server problems. We show that when h < k the competitiveness of the marking algorithm, arandomized paging strategy, is no more than 2( ..."
Abstract
- Add to MetaCart
(ln ~ –lnln ~+~) when &> e, and at most 2 otherwise. We show this is roughly within a factor of two of optimal. Intuitively, we say a paging strategy is loosely Competitive if, for any sequence, at most cache sizes the fault rate of the pa ing strategy is at most an insignificant amount above C
Cache Size in a Cost Model for Heterogeneous Skeletons
- In Proceedings of the 5th ACM SIGPLAN Workshop on High-Level Parallel Programming and Applications
, 2011
"... High performance architectures are increasingly heterogeneous with shared and distributed memory components. Programming such architectures is complicated and performance portability is a major issue as the architectures evolve. This paper proposes a new architectural cost model that accounts for ca ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
for cache size and improves on heterogeneous architectures, and demonstrates a skeleton-based programming model that simplifies programming heterogeneous architectures. We further demonstrate that the cost model can be exploited by skeletons to improve load balancing on heterogeneous architectures
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
, 2001
"... This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache a ..."
Abstract
-
Cited by 803 (23 self)
- Add to MetaCart
balances the number of files stored on each node. However, non-uniform storage node capacities and file sizes require more explicit storage load balancing to permit graceful behavior under high global storage utilization; likewise, non-uniform popularity of files requires caching to minimize fetch distance
The SPLASH-2 programs: Characterization and methodological considerations
- INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE
, 1995
"... The SPLASH-2 suite of parallel applications has recently been released to facilitate the study of centralized and distributed shared-address-space multiprocessors. In this context, this paper has two goals. One is to quantitatively characterize the SPLASH-2 programs in terms of fundamental propertie ..."
Abstract
-
Cited by 1420 (12 self)
- Add to MetaCart
sets of the applications, we describe which operating points in terms of cache size and problem size are representative of realistic situations, which are not, and which re redundant. Using SPLASH-2 as an example, we hope to convey the importance of understanding the interplay of problem size, number
Results 1 - 10
of
3,269
