620 search results - page 19 / 124 » Optimizing the BSD routing system for parallel processing |
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we address the problem of minimizing the response time of a multi-way join query using pipelined (inter-operator) parallelism, in a parallel or a distributed environ...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
ICPADS
1996
IEEE
13 years 11 months ago
1996
IEEE
In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of vic...
ISPAN
2002
IEEE
14 years 13 days ago
2002
IEEE
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...