With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
$300 Free Credits to Build on Google Cloud
New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.
Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
CAEBeans is the hierarchy of problem-oriented shells over CAE-package. Their functionality is implemented using GPE (Grid Programming Environment) architecture.
Some example exercises about distributed systems in computer science. Some code examples for Java RMI, Java Server Socket and Peer to Peer Systems written in Java. Probably using the Hibernate framework and some other Java Technologies.
Mahatittha enables distributed transaction handling capability within the lightweight container Spring Framework, without necessitating its deployment in a fully-fledged J2EE application server.
jvmShare is aiming to provide a server-client system that shares resources across the network. Since it is written in Java, clients shares their resources by providing their JVMs to the central server. The server will schedule tasks to these clients.
KagBeni is a Javaspace based file sharing and Social Networking System. IT makes use of the javaspace implementation provided by the Gigaspace implementation.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
The SensorWeb project aims at developing Open SensorWeb Architecture (OSWA) and implementing standards compliant platform and middleware for integration of sensor networks with emerging distributedcomputing platforms such as Grids.
The Pacific Northwest (PNW) SOA Commons (pnwsoacommons) is an Open Source project to collect, organize, build, and share reusable artifacts and best practices to help facilitate the faster adoption and implementation of SOA best practices.
GAP (Grid Agents Platform) Toolkit for Modeling and Simulation of Mobile Agents in Grid Environments. GAP is an abstraction over GridSim, a Grid Simulation Toolkit for Resource Modelling and Application Scheduling for Parallel and DistributedComputing.
Hedera provides common interfaces for popular group communications packages like JGroups, Appia, and Spread. Hedera allows applications to switch easily between group communications without code changes and with minimal reconfiguration.
A set of library and plugins to provide bittorrent download capabilities to java build systems (maven, ivy, buildr...) for jar and dependencies downloads.
Anicetus is an application telemetry framework. Anicetus defines a language neutral standard for publishing streams of facts about a running application.
PeerVibes is a framework for creating applications based on peer-to-peer networks. This framework provides the necessary tools and architecture to build complex applications such as collaborative work support and distributed backup.
Logical Neighborhoods is a a high-level programming abstraction for wireless sensor networks that simplifies the development of fully distributed, embedded networked applications.
A Java client for the memcached protocol with a configurable client-side in-process memory cache supporting replacement/eviction strategies (least-recently-used, least-frequently-used, first-in-first-out) designed to provide extremely low-latency lookup.