Sciweavers

3202 search results - page 431 / 641
» Memory access scheduling
Sort
View
IOPADS
1996
87views more  IOPADS 1996»
13 years 9 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
SIGPLAN
2008
13 years 8 months ago
Single global lock semantics in a weakly atomic STM
As memory transactions have been proposed as a language-level replacement for locks, there is growing need for well-defined semantics. In contrast to database transactions, transa...
Vijay Menon, Steven Balensiefer, Tatiana Shpeisman...
COMPUTER
1998
68views more  COMPUTER 1998»
13 years 8 months ago
Making Network Interfaces Less Peripheral
Much of a computer’s value depends on how well it interacts with networks. To enhance this value, designers must improve the performance of networks delivered to users. Fortunat...
Shubhendu S. Mukherjee, Mark D. Hill
SCP
2010
163views more  SCP 2010»
13 years 3 months ago
Compact and efficient strings for Java
In several Java VMs, strings consist of two separate objects: metadata such as the string length are stored in the actual string object, while the string characters are stored in ...
Christian Häubl, Christian Wimmer, Hanspeter ...
HPCA
2011
IEEE
12 years 12 months ago
A new server I/O architecture for high speed networks
Traditional architectural designs are normally focused on CPUs and have been often decoupled from I/O considerations. They are inefficient for high-speed network processing with a...
Guangdeng Liao, Xia Znu, Laxmi N. Bhuyan