Search Results for "distributed hash table"

DAR is a command-line backup and archiving tool that uses selective compression (not compressing already compressed files), strong encryption, may split an archive in different files of given size and provides on-fly hashing, supports differential backup with or without binary delta, ftp and sftp protocols to remote cloud storage Archive internal's catalog, allows very quick restoration even a single file from a huge, eventually sliced, compressed, encrypted archive eventually located on...

... - Console encoder/decoder tools - OS independent - Could be used in embedded projects - Works with raw code-stream LZW features: - Hardcoded dictionary size - Variable code size - Code search is performed by hash table and embedded in dictionary linked lists (encoder) - No dynamic memory allocation

FastDHT is high performance DHT ( distributed hash table ) which based key value pairs. Storage use Berkeley DB, and network IO use libevent. It can store mass key value pairs such as filename mapping, session data and user related data.

UI To the Hadoop HBase Project

Efficient indexing and searching (1M Weibo 500M data is indexed in 28 seconds, search response time is 1.65 milliseconds, and search QPS is 19K). Support Chinese word segmentation (concurrent word segmentation using the sego word segmentation package, speed 27MB/sec). Support to calculate the proximity distance of keywords in the text (token proximity). When a request to add a document to the index comes in, the main coroutine will send the text to be segmented to a word segmentation...

next version is 2.4.6

Italian version of the game Hearts. The game use a central server for chat and authentication; the table is p2p among players. The game supports n-1 crashes of the playing peers.

BitDHT is a LGPL'd general purpose C++ Distributed Hash Table library. It is designed to take hassle out over creating your own DHT. BitDHT is compatible with bitttorrent's DHT and can leverage this network to bootstrap your own personal DHT.

NChord is a C# implementation of the Chord distributed hash table. The project provides a library containing the routing, lookup, and maintenance routines specified in the MIT Chord paper, and is quite stable including under heavy load and churn.

Ermdia is a yet another implementation of Kademlia, which is one of the algorithm of ditributed hash table (DHT), in Erlang. This software is lightweight, fast and easy to understand since an amount of source code is quite small.

Entangled is a distributed hash table (DHT) and peer-to-peer tuple space, based on Kademlia. It is written in Python, and makes use of the Twisted framework. This can be used as a base for creating peer-to-peer (P2P) network applications.

BruteNet is a system of the distributed brute force and distributed calculations built on user extensions capable to solve a great number of problems related to the partition on a lot of machines.With sample extention you can distribute brute md5-hash

C++ Widget Library for CGI/FastCGI applications based on Ajax. Test cases for Tomcat Server and XDAQ framework are available. Widgets included: Tab,Form,Button,Tree,LayoutContainer,Frame,Table,Dialog,FishEyeMenu,EventHandler, etc.

This program try to crack any md5 hash , but not using one cpu, using the power of distributed computing to get better results in less time

Distributed rainbow table generating

distDES is a Java RMI-based application which manages load balancing on heterogeneous clusters. Development will extend the theoretical initial implementation to include clustered Rainbow Table generation and encryption algorithm collision detection.

Dermi (Decentralized Event Remote Method Invocation) is a peer-to-peer (P2P), decentralized event-based object middleware framework built on top of a structured Distributed Hash Table based overlay network.

Libtc is a collection of useful things. It currently includes a linked list, hash table, binary tree, configuration file parser, some string utilities, plus some functions often missing on some systems.

Jupp is a Distributed Hash Table focusing on high throughput. It's main characteristics are: 1. Mechanisms for congestion control 2. O(log n) routing for arbitrary peer distributions in the ID space.