Sciweavers

822 search results - page 89 / 165
» Contention in shared memory algorithms
Sort
View
SIGCOMM
2012
ACM
12 years 15 days ago
Multi-resource fair queueing for packet processing
Middleboxes are ubiquitous in today’s networks and perform a variety of important functions, including IDS, VPN, firewalling, and WAN optimization. These functions differ vastl...
Ali Ghodsi, Vyas Sekar, Matei Zaharia, Ion Stoica
JCPHY
2011
192views more  JCPHY 2011»
13 years 28 days ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer
CF
2006
ACM
14 years 1 months ago
Landing openMP on cyclops-64: an efficient mapping of openMP to a many-core system-on-a-chip
This paper presents our experience mapping OpenMP parallel programming model to the IBM Cyclops-64 (C64) architecture. The C64 employs a many-core-on-a-chip design that integrates...
Juan del Cuvillo, Weirong Zhu, Guang R. Gao
LCPC
2007
Springer
14 years 4 months ago
Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
Ronald Veldema, Michael Philippsen
IEE
2007
104views more  IEE 2007»
13 years 10 months ago
Complete distributed garbage collection using DGC-consistent cuts and .NET AOP-support
: The memory management of distributed objects, when done manually, is an error-prone task. It leads to memory leaks and dangling references, causing applications to fail. Avoiding...
Luís Veiga, P. Pereira, Paulo Ferreira