Sciweavers

103 search results - page 16 / 21
» Asymmetric Memory Fences: Optimizing Both Performance and Im...
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 2 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
ICS
2004
Tsinghua U.
15 years 3 months ago
Adaptive incremental checkpointing for massively parallel systems
Given the scale of massively parallel systems, occurrence of faults is no longer an exception but a regular event. Periodic checkpointing is becoming increasingly important in the...
Saurabh Agarwal, Rahul Garg, Meeta Sharma Gupta, J...
SC
2000
ACM
15 years 2 months ago
Extending OpenMP for NUMA Machines
This paper describes extensions to OpenMP that implement data placement features needed for NUMA architectures. OpenMP is a collection of compiler directives and library routines ...
John Bircsak, Peter Craig, RaeLyn Crowell, Zarka C...
HICSS
1997
IEEE
110views Biometrics» more  HICSS 1997»
15 years 2 months ago
Resource Management in the mpC Programming Environment
The mpC language was developed to write efJicientand portable programsfor wide range of distributed memory machines. It supports both task and data parallelism, allows both static...
Dmitry Arapov, Alexey Kalinov, Alexey L. Lastovets...
INFOCOM
2009
IEEE
15 years 4 months ago
Variable-Stride Multi-Pattern Matching For Scalable Deep Packet Inspection
Abstract—Accelerating multi-pattern matching is a critical issue in building high-performance deep packet inspection systems. Achieving high-throughputs while reducing both memor...
Nan Hua, Haoyu Song, T. V. Lakshman