Sciweavers

1262 search results - page 182 / 253
» Techniques for obtaining high performance in Java programs
Sort
View
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
14 years 10 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
HPCA
2001
IEEE
14 years 9 months ago
Self-Tuned Congestion Control for Multiprocessor Networks
Network performance in tightly-coupled multiprocessors typically degrades rapidly beyond network saturation. Consequently, designers must keep a network below its saturation point...
Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S....
RTSS
2005
IEEE
14 years 2 months ago
Optimal Task Rate Selection in Fixed Priority Systems
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
Enrico Bini, Marco Di Natale
ICCCN
1997
IEEE
14 years 1 months ago
Effective Search Strategies for Application-Independent Speedup in UDP Demultiplexing
We present UDP datagram demultiplexing techniques that can yield potentially substantial applicationindependent performance gains over BSD-derived UDP implementations. Our demulti...
Joseph T. Dixon, Kenneth L. Calvert
CIKM
2009
Springer
14 years 22 days ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...