Sciweavers

620 search results - page 5 / 124
» Optimizing the BSD routing system for parallel processing
Sort
View
DEXAW
1999
IEEE
202views Database» more  DEXAW 1999»
13 years 11 months ago
Optimizing Global Query Processing Plans in Heterogeneous and Distributed Multidatabase Systems
This work addresses a problem of optimal query processing in heterogeneous and distributed multidatabase systems. The objective is to nd a method for opimization of global query p...
Janusz R. Getta, Seyed M. Sedighi
SPAA
1994
ACM
13 years 11 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
EDBTW
2004
Springer
14 years 26 days ago
Semantic Query Routing and Processing in P2P Database Systems: The ICS-FORTH SQPeer Middleware
Abstract. Peer-to-peer (P2P) computing is currently attracting enormous attention. In P2P systems a very large number of autonomous computing nodes (the peers) pool together their ...
Giorgos Kokkinidis, Vassilis Christophides
PODC
2003
ACM
14 years 22 days ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
USENIX
2001
13 years 8 months ago
Flexible Control of Parallelism in a Multiprocessor PC Router
SMP Click is a software router that provides both flexibility and high performance on stock multiprocessor PC hardware. It achieves high performance using device, buffer, and queu...
Benjie Chen, Robert Morris