Sciweavers

339 search results - page 61 / 68
» Reducing Memory Ordering Overheads in Software Transactional...
Sort
View
AAAI
2008
13 years 11 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
IWQOS
2011
Springer
12 years 11 months ago
OLIC: OnLine Information Compression for scalable hosting infrastructure monitoring
—Quality-of-service (QoS) management often requires a continuous monitoring service to provide updated information about different hosts and network links in the managed system. ...
Yongmin Tan, Xiaohui Gu, Vinay Venkatesh
ECOOP
2007
Springer
14 years 2 months ago
Generational Real-Time Garbage Collection
Abstract. While real-time garbage collection is now available in production virtual machines, the lack of generational capability means applications with high allocation rates are ...
Daniel Frampton, David F. Bacon, Perry Cheng, Davi...
ICS
1999
Tsinghua U.
14 years 29 days ago
Improving the performance of speculatively parallel applications on the Hydra CMP
Hydra is a chip multiprocessor (CMP) with integrated support for thread-level speculation. Thread-level speculation provides a way to parallelize sequential programs without the n...
Kunle Olukotun, Lance Hammond, Mark Willey
CHES
2008
Springer
132views Cryptology» more  CHES 2008»
13 years 10 months ago
Light-Weight Instruction Set Extensions for Bit-Sliced Cryptography
Bit-slicing is a non-conventional implementation technique for cryptographic software where an n-bit processor is considered as a collection of n 1-bit execution units operating in...
Philipp Grabher, Johann Großschädl, Dan...