Sciweavers

239 search results - page 25 / 48
» A practical scalable distributed B-tree
Sort
View
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
16 years 14 days ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
IPPS
2006
IEEE
15 years 12 months ago
Neighbourhood maps: decentralised ranking in small-world P2P networks
Reputation in P2P networks is an important tool to encourage cooperation among peers. It is based on ranking of peers according to their past behaviour. In large-scale real world ...
Matteo Dell'Amico
GI
2004
Springer
15 years 11 months ago
Distributed Job Scheduling in a Peer-to-Peer Video Recording System
: Since the advent of Gnutella, Peer-to-Peer (P2P) protocols have matured towards a fundamental design element for large-scale, self-organising distributed systems. Many research e...
Curt Cramer, Kendy Kutzner, Thomas Fuhrmann
CLOUD
2010
ACM
15 years 11 months ago
Lithium: virtual machine storage for the cloud
To address the limitations of centralized shared storage for cloud computing, we are building Lithium, a distributed storage system designed specifically for virtualization workl...
Jacob Gorm Hansen, Eric Jul
ICDCS
2002
IEEE
15 years 11 months ago
On the Performance of Group Key Agreement Protocols
Group key agreement is a fundamental building block for secure peer group communication systems. Several group key agreement protocols were proposed in the last decade, all of the...
Yair Amir, Yongdae Kim, Cristina Nita-Rotaru, Gene...