Sciweavers

4218 search results - page 580 / 844
» Complete sets of cooperations
Sort
View
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
15 years 10 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
98
Voted
ICDT
2010
ACM
180views Database» more  ICDT 2010»
15 years 10 months ago
Foundations of SPARQL Query Optimization
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
Michael Schmidt, Michael Meier, Georg Lausen
ICS
2010
Tsinghua U.
15 years 10 months ago
Cache Replacement Policies for Multicore Processors
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
Avinatan Hassidim
79
Voted
ASAP
2009
IEEE
143views Hardware» more  ASAP 2009»
15 years 10 months ago
Scalar Processing Overhead on SIMD-Only Architectures
—The Cell processor consists of a general-purpose core and eight cores with a complete SIMD instruction set. Although originally designed for multimedia and gaming, it is current...
Arnaldo Azevedo Filho, Ben H. H. Juurlink
109
Voted
ICCAD
2007
IEEE
164views Hardware» more  ICCAD 2007»
15 years 9 months ago
Design, synthesis and evaluation of heterogeneous FPGA with mixed LUTs and macro-gates
— Small gates, such as AND2, XOR2 and MUX2, have been mixed with lookup tables (LUTs) inside the programmable logic block (PLB) to reduce area and power and increase performance ...
Yu Hu, Satyaki Das, Steven Trimberger, Lei He