Samizdat is a toolkit for Java for building Kerberos secured distributed, message-oriented applications. The toolkit contains base classes that simplifies the management of Kerberos login contexts as well as flexibly sign and seal messages between principals using the Java GSS API. The toolkit contains Transformation classes for Kerberizing JMS traffic as well as a super-lean HTTP based protocol stack that supports both Synchronous (RPC) and Asynchronous modalities.
High performance distributed in-memory key/value store
Infinispan is an open source, Java based data grid platform. ***IMPORTANT*** Starting with Infinispan 5.0.0.FINAL, Infinispan releases are no longer hosted in Sourceforge. They can now be located in www.jboss.org/infinispan/downloads
Context-awareness is a key concept in ubiquitous computing. The Java Context-Awareness Framework (JCAF) is a Java-based context-awareness infrastructure and programming API for creating context-aware applications.
This project is to build a distributed Key-Value Store (KVS).
* Can survive software or hardware failures.
* Can tolerate failures of entire nodes.
* Can recognize that new storage nodes are joining the system and are able to utilize new nodes.
Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.
Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
EasyPastry is built on top of Pastry, a decentralized key-based routing (KBR) P2P overlay network. The main objective of EasyPastry is to provide a complete façade in order to simplify the P2P application development.
The objective of this work is to use key concepts and mechanisms related with the software components approach. Installation, execution and dynamic reconfiguration of a distributed chat application using CORBA are considered.
Distributed Balanced Tree (distributed b-tree): A distributed data-structure, where the data is accessed with get(key), put(key, value), delete(key), getNext(key), getPrev(key) - can be used as foundation for distributed databases, filessystems, P2P.