Sciweavers

455 search results - page 10 / 91
» Distributed Processes on Tree Hash
Sort
View
HPDC
2008
IEEE
14 years 2 months ago
StoreGPU: exploiting graphics processing units to accelerate distributed storage systems
Today Graphics Processing Units (GPUs) are a largely underexploited resource on existing desktops and a possible costeffective enhancement to high-performance systems. To date, mo...
Samer Al-Kiswany, Abdullah Gharaibeh, Elizeu Santo...
GLOBECOM
2007
IEEE
14 years 1 months ago
A Hash Function Scheme for Key Management in UMTS MBMS
—3GPP 33.246 proposes Key Management Mechanism (KMM) to distribute security keys for Universal Mobile Telecommunications System (UMTS) Multimedia Broadcast and Multicast Service ...
Shin-Ming Cheng, Wei-Ru Lai, Phone Lin
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
GLOBECOM
2006
IEEE
14 years 1 months ago
Fast Robust Hashing
Abstract— As stateful flow-aware services are becoming commonplace, distributed router architectures have to quickly assign packets being forwarded to service-specialized proces...
Manuel Urueña, David Larrabeiti, Pablo Serr...
JCT
2007
150views more  JCT 2007»
13 years 7 months ago
On the degree distribution of the nodes in increasing trees
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
Markus Kuba, Alois Panholzer