Sciweavers

4747 search results - page 238 / 950
» Shuffle Memory System
Sort
View
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
15 years 5 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
SIAMCOMP
2010
105views more  SIAMCOMP 2010»
14 years 11 months ago
Fast Access to Distributed Atomic Memory
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as...
Partha Dutta, Rachid Guerraoui, Ron R. Levy, Marko...
SAC
2009
ACM
15 years 9 months ago
Impact of function inlining on resource-constrained embedded systems
With the development of computer systems, function inlining schemes were used to reduce execution time while increasing codes. In embedded systems such as wireless sensor nodes, t...
Bongjae Kim, Sangho Yi, Yookun Cho, Jiman Hong
CASES
2005
ACM
15 years 6 months ago
Segment protection for embedded systems using run-time checks
The lack of virtual memory protection is a serious source of unreliability in many embedded systems. Without the segment-level protection it provides, these systems are subject to...
Matthew Simpson, Bhuvan Middha, Rajeev Barua
DATE
2006
IEEE
202views Hardware» more  DATE 2006»
15 years 10 months ago
Automatic systemC design configuration for a faster evaluation of different partitioning alternatives
In this paper we present a methodology that is based on SystemC [1] for rapid prototyping to greatly enhance and accelerate the exploration of complex systems to optimize the syst...
Nico Bannow, Karsten Haug, Wolfgang Rosenstiel