Browsing projects by Tag(s)

Select a tag to browse associated projects and drill deeper into the tag cloud.

Showing page 1 of 1

Scalable Volunteer Computing Framework based on peer-to-peer architecture and gossip protocols.

0
 
  0 reviews  |  3 users  |  20,550 lines of code  |  5 current contributors  |  Analyzed 6 days ago
 
 

Building blocks for Erlang/OTP systems using distributed algorithms.copyright 2007-2008 Basho Technologies authors: Justin Sheehy Andy Gross Code added so far: Vector Clocks module documentation references: Leslie Lamport (1978). "Time, clocks, and the ordering of events in a ... [More] distributed system". Communications of the ACM 21 (7): 558-565. Friedemann Mattern (1988). "Virtual Time and Global States of Distributed Systems". Workshop on Parallel and Distributed Algorithms: pp. 215-226 Consistent Hashing module documentation reference: Karger, D.; Lehman, E.; Leighton, T.; Panigrahy, R.; Levine, M.; Lewin, D. (1997). "Consistent hashing and random trees". Proceedings of the twenty-ninth annual ACM symposium on Theory of computing: 654~663. ACM Press New York, NY, USA Merkle Trees module documentation reference: Ralph C. Merkle, A Digital Signature Based on a Conventional Encryption Function, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.369-378, August 16-20, 1987 Coming soon: generic versioned objects for convenient use with Merkle trees Coming a bit later: Generic Gossip Protocol [Less]

0
 
  0 reviews  |  1 user  |  888 lines of code  |  0 current contributors  |  Analyzed 10 days ago
 
 

A picture is worth 1,000 words. Stop talking and start showing! Share your story or unique occurrence in Berkeley or any campus, for that matter, to the student population. Users can upload or email in photos of campus personalities, protesters, hippies, the popular girl, or the campus jock at ... [More] their finest moments. Viewers are welcome to comment with their insight or link to other relevant photos. Rank the hottest girl. The most "granola" Berkeleyan. Most awkward geek. [Less]

0
 
  0 reviews  |  0 users  |  318 lines of code  |  0 current contributors  |  Analyzed 2 days ago
 
 

One of the main obstacles to building large-scale distributed server applications is that organizing many processes such that they can be used by the application is a painful process. For example, one of the main difficulties in implementing a distributed hash table resides in populating and ... [More] maintaining its routing tables over time. Once this is done, routing messages is easy. This library is intended to help programmers organize nodes of their applications according to any structure they like, in a simple and efficient way. The system relies on gossip-based peer-to-peer protocols called Cyclon and Vicinity. Reference: Epidemic-Based Self-Organization in Peer-to-Peer Systems. Spyros Voulgaris. PhD thesis, Vrije Universiteit, Amsterdam, The Netherlands, 2006. [Less]

0
 
  0 reviews  |  0 users  |  0 current contributors  |  Analyzed 7 days ago
 
 

A simple and efficient implementation of the Network-friendly Epidemic Multicast protocol based on Java providing support for very large scale event notifications.

0
 
  0 reviews  |  0 users  |  5,016 lines of code  |  0 current contributors  |  Analyzed about 12 hours ago
 
 

Gossip is a Ruby library for sending messages to people through various channels--SMTP, Twitter, Jabber, Trac, and Campfire. It was originally written by Brian Marick to help himself and another developer keep in sync on a distributed project.

0
 
  0 reviews  |  0 users  |  2,535 lines of code  |  0 current contributors  |  Analyzed 10 days ago
 
 
 
 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.