461 search results - page 88 / 93 » Dynamic Load Balancing in Distributed Hash Tables |
CASES
2005
ACM
13 years 9 months ago
2005
ACM
Instruction set customization accelerates the performance of applications by compressing the length of critical dependence paths and reducing the demands on processor resources. W...
IPPS
1997
IEEE
13 years 12 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
FTDCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Today most Internet services are pre-assigned to servers statically, hence preventing us from doing real-time sharing of a pool of servers across as group of services with dynamic...
SIGMOD
1997
ACM
13 years 12 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
LCN
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...