Search Results for "distributed shared memory"

...Download pages, repositories, tickets and wiki have been moved to https://github.com/oss-tsukuba/ Download: gfarm: https://github.com/oss-tsukuba/gfarm/releases gfarm2fs: https://github.com/oss-tsukuba/gfarm2fs/releases and more: https://github.com/oss-tsukuba/gfarm/wiki#download Repositories: gfarm: https://github.com/oss-tsukuba/gfarm gfarm2fs: https://github.com/oss-tsukuba/gfarm2fs and more: https://github.com/orgs/oss-tsukuba/repositories Tickets: gfarm: https://github.com/oss-tsukuba/gfarm/issues gfarm2fs: https://github.com/oss-tsukuba/gfarm2fs/issues Wiki: https://github.com/oss-tsukuba/gfarm/wiki Gfarm file system is a network shared file system that supports scalable I/O performance in distributed environment. It can federate local disks of network-connected PCs and compute nodes in several clusters.

As of now, you can get Ehcache only from ehcache.org or Maven central. A simple, fast, thread safe, standards based cache for Java, and provides memory and disk stores and distributed operation for clusters. ehcache is widely used in such open source projects as Hibernate and Spring. Terracotta offers enterprise edition

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

RT-BOINC stands for a Real-Time BOINC. It was designed for managing highly-interactive, short-term, and massively-parallel real-time applications. We implemented RT-BOINC on top of the recent BOINC server source codes.

libMAGE (Multi-Agent Grid Engine) is a C++ library that provides basis for constructing distributed autonomic systems (running on grids and clusters), that are able to adapt to processor and memory load and node failures.

Channel is a C++ framework for distributed message passing and event dispatching, configurable with its components (msg ids,routing algorithms...) as template parameters. As a namespace shared by peer threads, channel supports scope control and filtering

A PHP Client Library for beanstalkd. BeanStalk allows PHP developers to make use of the beanstalkd in-memory workqueue server (http://xph.us/software/beanstalkd).

A data parallel scientific programming model. Compiles efficiently to different platforms like distributed memory (MPI), shared memory multi-processor (pthreads), Cell BE processor, Nvidia Cuda, SIMD vectorization (SSE, Altivec), and sequential C++ code.

Balance is a simple but powerful generic tcp proxy with round robin load balancing and failover mechanisms. Via shared memory its behaviour can be controlled at runtime using a simple command line syntax.

JVMCluster Features: - clusterable Java Virtual Machine (based on PVM) - uses CPPVM as adapter layer to PVM - object persistent layer integrated into JVM - memory management unit is based on integrated relational database - JDBC/ODBC api to acces

openMosixLOAF is a single floppy openMosix Linux mini-distro designed for diskless systems or HPC clusters where only CPU and memory is needed. It has drivers for all PCI Ethernet NICs that the Linux kernel has support for (10/100/1000).

TOP-C is a library for easily writing parallel applications for both distributed and shared memory architectures. It hides the details of parallel programming, and presents the application programmer with a simple task-oriented interface.

The Tiny Grasshopper Cache Store provides a memory based, least recently used (LRU), thread-safe caching mechanism that can openly cache any Java Object. The cache store is easy to use and doesn't require any setup.

DIPC stands for Distributed Inter-Process Communication. It enables you to build and program clusters of Linux computers very easily. It provides, among other things, Transparent Distributed Shared Memory (DSM). No special hardware required

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.