158 search results - page 14 / 32 » Simple Fast Parallel Hashing |
ICDCS
2000
IEEE
13 years 12 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
GRID
2006
Springer
13 years 7 months ago
2006
Springer
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
CGF
2010
13 years 7 months ago
2010
Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee dire...
HPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
We introduce LogGOPSim--a fast simulation framework for parallel algorithms at large-scale. LogGOPSim utilizes a slightly extended version of the well-known LogGPS model in combin...
ISCAS
2007
IEEE
14 years 1 months ago
2007
IEEE
— Hermitian Codes offer desirable properties such as large code lengths, good error-correction at high code rates, etc. The main problem in making Hermitian codes practical is to...