Sciweavers

3202 search results - page 86 / 641
» Memory access scheduling
Sort
View
ASPLOS
2012
ACM
14 years 5 hour ago
An update-aware storage system for low-locality update-intensive workloads
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibili...
Dilip Nijagal Simha, Maohua Lu, Tzi-cker Chiueh
ISSS
1997
IEEE
103views Hardware» more  ISSS 1997»
15 years 8 months ago
Fast and Extensive System-Level Memory Exploration for ATM Applications
In this paper, our memory architecture exploration methodology and CAD techniques for network protocol applications are presented. Prototype tools have been implemented, and appli...
Peter Slock, Sven Wuytack, Francky Catthoor, Gjalt...
IPPS
2006
IEEE
15 years 10 months ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien
IPPS
2005
IEEE
15 years 10 months ago
NUMA-Aware Java Heaps for Server Applications
We introduce a set of techniques to both measure and optimize memory access locality of Java applications running on cc-NUMA servers. These techniques work at the object level and...
Mustafa M. Tikir, Jeffrey K. Hollingsworth
NCA
2005
IEEE
15 years 9 months ago
Fundamental Network Processor Performance Bounds
In this paper, fundamental conditions which bound the network processing unit (NPU) worst-case performance are established. In particular, these conditions formalize and integrate...
Hao Che, Chethan Kumar, Basavaraj Menasinahal