Sciweavers

239 search results - page 27 / 48
» A practical scalable distributed B-tree
Sort
View
PARELEC
2002
IEEE
15 years 3 months ago
Dynamic Process Partitioning and Migration for Irregular Applications
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
Pawel Czarnul
INFOCOM
2009
IEEE
15 years 4 months ago
Minimizing Average Finish Time in P2P Networks
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
G. Matthew Ezovski, Ao Tang, Lachlan L. H. Andrew
81
Voted
ICC
2007
IEEE
165views Communications» more  ICC 2007»
15 years 4 months ago
Threshold-based Exhaustive Round-Robin for the CICQ Switch with Virtual Crosspoint Queues
A multi-cabinet implementation of a combined input and crosspoint queued (CICQ) switch introduces a large RTT latency between the line cards and switch fabric, requiring a large cr...
Kenji Yoshigoe
66
Voted
VRML
2006
ACM
15 years 4 months ago
A case for 3D streaming on peer-to-peer networks
One of the most serious issues holding back the widespread of 3D contents on Internet has been their inaccessibility due to large data volume. Many compression and progressive tra...
Shun-Yun Hu
IJAMC
2010
134views more  IJAMC 2010»
14 years 8 months ago
HyperVerse: simulation and testbed reconciled
—When dealing with dynamic large-scale topologies such as those underlying peer-to-peer (P2P) distributed virtual environments (DVE), one inescapably reaches the point where eith...
Jean Botev, Markus Esch, Hermann Schloss, Ingo Sch...