Sciweavers

2642 search results - page 232 / 529
» Merge-by-Wire: Algorithms and System Support
Sort
View
POPL
2003
ACM
16 years 5 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 5 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
IPSN
2004
Springer
15 years 10 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
SIGMOD
2008
ACM
126views Database» more  SIGMOD 2008»
16 years 4 months ago
On efficient top-k query processing in highly distributed environments
Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most ...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
CCGRID
2006
IEEE
15 years 10 months ago
PhoenixG: A Unified Management Framework for Industrial Information Grid
Industrial Information Grid (IIG) is a special kind of Grid system, the users of which exclusively own geographically distributed resources for Web service applications and try to...
Jianfeng Zhan, Gengpu Liu, Lei Wang, Bibo Tu, Yi J...