Sciweavers

1324 search results - page 169 / 265
» Backtracking-based load balancing
Sort
View
APNOMS
2006
Springer
15 years 2 months ago
Zone-Based Clustering for Intrusion Detection Architecture in Ad-Hoc Networks
Setting up an IDS architecture on ad-hoc network is hard because it is not easy to find suitable locations to setup IDS's. One way is to divide the network into a set of clust...
Il-Yong Kim, Yoo-Sung Kim, Ki-Chang Kim
CCGRID
2004
IEEE
15 years 2 months ago
High performance LU factorization for non-dedicated clusters
This paper describes an implementation of parallel LU factorization. The focus is to achieve high performance on non-dedicated clusters, where the number of available computing re...
Toshio Endo, Kenji Kaneda, Kenjiro Taura, Akinori ...
EUROPAR
2008
Springer
15 years 2 days ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler
INFOSCALE
2007
ACM
14 years 12 months ago
Load-balancing and caching for collection selection architectures
— To address the rapid growth of the Internet, modern Web search engines have to adopt distributed organizations, where the collection of indexed documents is partitioned among s...
Diego Puppin, Fabrizio Silvestri, Raffaele Perego,...
NETWORKING
2007
14 years 11 months ago
Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm
Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost a...
Benoit Donnet, Bradley Huffaker, Timur Friedman, K...