Sciweavers

437 search results - page 42 / 88
» Reducing Memory Sharing Overheads in Distributed JVMs
Sort
View
IPPS
2003
IEEE
14 years 27 days ago
Performance Prediction of Paging Workloads Using Lightweight Tracing
A trace of a workload’s system calls can be obtained with minimal interference, and can be used to drive repeatable experiments to evaluate system configuration alternatives. R...
Ariel N. Burton, Paul H. J. Kelly
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
CF
2009
ACM
14 years 2 months ago
Strategies for dynamic memory allocation in hybrid architectures
Hybrid architectures combining the strengths of generalpurpose processors with application-specific hardware accelerators can lead to a significant performance improvement. Our ...
Peter Bertels, Wim Heirman, Dirk Stroobandt
PRDC
2007
IEEE
14 years 1 months ago
PAI: A Lightweight Mechanism for Single-Node Memory Recovery in DSM Servers
Several recent studies identify the memory system as the most frequent source of hardware failures in commercial servers. Techniques to protect the memory system from failures mus...
Jangwoo Kim, Jared C. Smolens, Babak Falsafi, Jame...
CF
2007
ACM
13 years 11 months ago
Accelerating memory decryption and authentication with frequent value prediction
This paper presents a novel architectural technique to hide fetch latency overhead of hardware encrypted and authenticated memory. A number of recent secure processor designs have...
Weidong Shi, Hsien-Hsin S. Lee