Distributed in memory data grid

  • Published on
    09-Jul-2015

  • View
    187

  • Download
    0

Transcript

Distributed in-memory data grid

Distributed in-memory data grid

FeaturesSimpleReliableFail-safe (automatic backups)Fast (data stored in-memory)ScalableUsage of JDK interfaces: List, Map, Set, Queue, Lock, ExecutorService e.t.c.Decentralized topologySocket level traffic encryptionSpring IntegrationUsed by:

Hear of HazelcastHazelcastInstance node = Hazelcast.newHazelcastInstance(new Config());

ConfigurationIn-code configuration

Config cfg = new Config(); Address address = new Address("localhost", 5701);cfg.getNetworkConfig().getJoin().getTcpIpConfig().addAddress(address);

XML file

dev dev-pass 5701 127.0.0.1

Collections (List, Set, Queue)Automatic data partitioning and propagation between nodesTransaction supportWrite-Through and Write-Behind persistenceAutomatic replication (synchronous and asynchronous)Distributed MapAutomatic data partitioning and propagation between nodesTransaction supportWrite-Through and Write-Behind persistenceAutomatic replication (synchronous and asynchronous)SQL like queriesAutomatic Map-Reduce in queriesTopicCluster-wide eventsEvents are orderedBonus (ExecutorService)DistributedBroadcast executionExecution on specific nodeLoad balancing

Site: http://www.hazelcast.com/Documentation: http://www.hazelcast.com/docs.jsp

Skype: albul.alexanderEmail: aalbul@lohika.com, gorenuru@gmail.com

Recommended

View more >