Search Results for "distributed computing"

...Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. Now, it is possible to use as many cores in a network as you want. With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do.

Gradient pattern analysis (GPA)[http://en.wikipedia.org/wiki/Gradient_pattern_analysis] is a geometric computing method for characterizing symmetry breaking of an ensemble of asymmetric vectors regularly distributed in a square lattice.

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.

JMS/Joram implementation of the Bully election algorithm. It is a library to be used by a process' implementation to make it transparently manage coordinator's elections, while it carries out business logic. A sample application is included.

Damon is a Distributed AOP Middleware on top of a p2p Overlay Network. Its main aim is to offer the necessary abstractions and services to develop distributed aspects, and to provide scalability to existent or new applications transparently.