Breaking The Clustering Limits @ AlphaCSP JavaEdge 2007

Copyright AlphaCSP Israel 2007 – The JavaEdge Seminar 2

Breaking the Breaking the Clustering LimitsClustering Limits

Baruch SadogurskyConsultant, AlphaCSP

Cluster at NASACluster at NASA

AgendaAgenda

• Clustering Definition– Why Clustering?

• Evolution of Clustering in Java• Grids• Implementations• Other Solutions

Clustering DefinitionClustering Definition

• Group of tightly coupled computers • Work together closely• Viewed as single computer• Commonly connected through fast

MotivationMotivation

• Deployed to improve– Scalability & load-balancing

• Throughput (e.g. hits per second)

– Fail-over• Availability (e.g. 99.999%)

– Resource virtualization

• Much more cost-effective than single computers

Why Clustering?Why Clustering?

•Why not single machine?

–Moore’s Law is dead

•Why not adding CPUs?–Threads, locks and context switches are expensive

•Why not via DB?–DB access sloooow–Single point of failure

•Cluster DB?

Accessing DataAccessing Data

•According to the Long Tail theory, 20% of objects used 80% of the time•We need distributed access to those 20%

Evolution of Clustering in JavaEvolution of Clustering in Java

• In the beginning there where dinosaurs application servers and J2EE programming model

• Clustering aspect never made it to the Java EE spec

• Proprietary solutions

Classical ClusteringClassical Clustering

• Replicate the state between the nodes– Provides stateful beans scalability – Provides entity beans caching– Provides HTTP session replication

• Balance the load– Smart Java client– HTTP load-balancer

• Central node manages the cluster topology– Slow detection of topology changes– New coordinator elected by voting (slow)

Coordinating the ClusterCoordinating the Cluster

• According to the Eight Fallacies of Distributed Computing:– The network is reliable– Topology doesn't change

• According to real life– Communication fails– Nodes leave and join

• Coordinator election in case of failure is expensive

Scary, scary clusteringScary, scary clustering

• “Avoid broken mirrors, Friday the 13th, multithreading and clustered stateful applications”

• Poor implementations gave clustering a bad name

Clustered Caches DrawbacksClustered Caches Drawbacks

• Copying all the data across cluster can’t provide linear scalability– More nodes you have, more copying

occurs

• Topology communication slows the cluster down

• Cache needs eviction policy to deal with stale data

Clustered Caches DrawbacksClustered Caches Drawbacks

• Operates only on simple and serializable types

• Mutated objects have to be returned to the cache

• Coarse-grained (whole object is replicated)

• Can’t handle object graphs– Serialization issue

Evolution of Clustering in JavaEvolution of Clustering in Java

• Spring, JBoss micro-container, Pico container and others brought the POJO to enterprise world

• The rise of the POJO standardized the clustering services

• Clustering market is on fire

From Cache to Grid ComputingFrom Cache to Grid Computing

• “Caches” are out, “Grids” are in…• So what is “Grid Computing”?• There is no technology called "Grid

Computing“

From Cache to Grid ComputingFrom Cache to Grid Computing

• Definition of set of distributed computing use cases that have certain technical aspects in common– Data Grids– Computational Grids– On-Demand Grids

• First two are relevant for Java Enterprise applications clustering– On-Demand Grid is about leasing computing

Grid TypesGrid Types

Data GridsData Grids

Holds bazillion terabytes

Each one holds only zillion terabytes

Data GridsData Grids

• Split lots of data to subsets of data• Each node gets only subset of data it

currently needs• Combine results from the different

nodes• Also natural fail-over

– State replication

Computational GridsComputational Grids

Counts i++ bazillion times

Each one counts i++ only zillion times

Computational GridsComputational Grids

• Split long task into multiple sub-tasks• Execute each sub-task in parallel on

a separate computer• Combine results from the sub-tasks

Functional Languages and GridsFunctional Languages and Grids

• Functional languages considered the best tool for grid programming

• Full statelessness• Isolated functions

– Get all the needed data via parameters

• Scala compiles to JVM bytecode– www.scala-lang.org

Master/WorkerMaster/Worker

Map/ReduceMap/Reduce

Read part of the data

Data source

Process and map the data

Read the mapped dataReduce the

ResultsWrite results

Map/Reduce ExampleMap/Reduce Example

• Input for mapping:– <data, “two witches watch two watches; which witch watch which watch?”>

• Map output (and reduce input):– <two, 1>– <witch, 1>– <watch, 1>– <two, 2>– <watch, 2>– <which, 1>– <witch, 2>– <watch, 3>– <which, 2>– <watch, 4>

• Reduce output:– <two, 2>– <witch, 2>– <watch, 4>– <which, 2>

Map/Reduce ExampleMap/Reduce Example

• Both map() and reduce() can be easily distributed, since they are stateless

• Google uses their implementation for analyzing the Internet– labs.google.com/papers/mapreduce.html

Java ComputeGrid VisionJava ComputeGrid Vision

• Sun spec for Service Oriented Architectures– www.jini.org

• Released in 1998(!) and was totally ahead its time– Didn’t make to J2EE spec and was pretty

abandoned• Basis for JavaSpaces• The concept is sending code over the wire

– Pure Java– Code executed locally

• No network exceptions during the execution

Java ComputeGrid VisionJava ComputeGrid Vision

•JavaSpaces - “Space” based technology–javaspaces.org/

•“Space” definition:–A place on the network to share and store objects

•Both data and tasks–Associative shared memory for the network–Unifies storage and communications

ImplementationsImplementations

EHCacheEHCache

•OpenSource–ehcache.sourceforge.net

•Fast–In-process caching–Asynchronous replication

•Small–110KB

•Simple•RMI communication•Map based API

–Inc. JCache (JSR 107) implementation

•Never released

EHCache ExampleEHCache Example

1 <cacheManagerPeerProviderFactory 2 class="net.sf.ehcache.distribution.RMICacheManagerPeerProviderFactory" 3 properties="peerDiscovery=automatic, 4 multicastGroupAddress=230.0.0.1, 5 multicastGroupPort=4446, timeToLive=1" 6 propertySeparator="," 7 />

1 <cache name="sampleDistributedCache1" 2 maxElementsInMemory="10" 3 eternal="false" 4 timeToIdleSeconds="100" 5 timeToLiveSeconds="100" 6 overflowToDisk="false"> 7 <cacheEventListenerFactory 8 class="net.sf.ehcache.distribution.RMICacheReplicatorFactory"/> 9 <bootstrapCacheLoaderFactory 10 class="net.sf.ehcache.distribution.RMIBootstrapCacheLoaderFactory"/> 11 </cache>

1 CacheManager manager = new CacheManager(); 2 Cache cache1 = manager.getCache("sampleDistributedCache1"); 3 Element elementToPut = new Element("firstName", "Biff"); 4 cache1.put(elementToPut);

GlassFish ShoalGlassFish Shoal

• Backbone for GlassFish AS clustering• Open Source at dev.java.net• Can be used standalone• Group Management Service (GMS) centric• GMS Themes

– Group Sensory-Action Theme• Lifecycle notifications

– Group Communication Theme• Group communications provider SPI

– JXTA - default– Can plugin JGroups insteadGroup communications API

• Send and receive plain messages– Shared or Distributed Storage Theme

• Map implementation• Concurrent

JXTA Usage in ShoalJXTA Usage in Shoal

JXTA Implementation

GMS SPI

GMS Client API

Application

Startup and ShutdownProduce Action and Deliver Signal

Join and leaveNotify listeners

Oracle Tangosol Oracle Tangosol CoherenceCoherence

Oracle Tangosol CoherenceOracle Tangosol Coherence

• DataGrid• Fast!• Planned as clustering backbone for

Oracle AS• Can be used standalone• Commercial• Oracle product now• Single JAR

Coherence Data GridCoherence Data Grid

• “Organic cluster” – all the nodes are equal• Partitioned Topology

– Every node holds subset of data• Replicated for fail-over

• Replicated Topology– Behaves like cache

• Every node holds all the data

• Fast elimination (no voting)

• Supports queries and indices• Map interface implementation• Lifecycle listeners• Drawbacks

– Usual cache drawbacks– Closed source– Costly

JBoss POJO CacheJBoss POJO Cache

• Subproject of JBossCache– Clustering backbone of JBoss AS

• OpenSource at JBoss labs– http://labs.jboss.com/jbosscache

• Transactional• Bytecode instrumented POJOs• Don’t have to be serializable

• Fine-grained replication• Graphs are allowed• Changes detection• POJOs need to be annotated and

attached to the cache• Tree implementation• JGroups communication

JBoss POJO Cache UsageJBoss POJO Cache Usage

1 cache1.attach("students/54321", mary); 2 cache1.attach("students/65432", joe); 3 Student mary2 = (Student) cache2.find("students/54321"); 4 Student joe2 = (Student) cache2.find("students/65432");

1 /** 2 * No need for annotation here since Person 3 * has been annotated already. 4 */ 5 public class Student extends Person 6 { 7 protected String school; 8 protected Set<Course> courses = new LinkedHashSet<Course>();

1 @org.jboss.cache.pojo.annotation.Replicable 2 public class Person { 3 protected String name; 4 protected Address address;

1 XmlConfigurationParser parser = new XmlConfigurationParser(); 2 Configuration conf = parser.parseFile("META-INF/replSync-service.xml"); 3 conf.setClusterName("TestCluster"); 4 PojoCache cache = PojoCacheFactory.createCache(conf, true);

JGroups ConfigurationJGroups Configuration

1 <attribute name="ClusterConfig"> 2 <config> 3 <UDP mcast_addr="228.10.10.10" 4 mcast_port="45588" 5 tos="8" 6 ucast_recv_buf_size="20000000" 7 ucast_send_buf_size="640000" 8 mcast_recv_buf_size="25000000" 9 mcast_send_buf_size="640000" 10 loopback="false" 11 discard_incompatible_packets="true" 12 max_bundle_size="64000" 13 max_bundle_timeout="30" 14 use_incoming_packet_handler="true" 15 ip_ttl="2" 16 enable_bundling="false" 17 enable_diagnostics="true" 18 19 use_concurrent_stack="true" 20 21 thread_naming_pattern="pl" 22 23 thread_pool.enabled="true" 24 thread_pool.min_threads="1" 25 thread_pool.max_threads="25" 26 thread_pool.keep_alive_time="30000" 27 thread_pool.queue_enabled="true" 28 thread_pool.queue_max_size="10" 29 thread_pool.rejection_policy="Run" 30 31 oob_thread_pool.enabled="true" 32 oob_thread_pool.min_threads="1" 33 oob_thread_pool.max_threads="4" 34 oob_thread_pool.keep_alive_time="10000" 35 oob_thread_pool.queue_enabled="true" 36 oob_thread_pool.queue_max_size="10" 37 oob_thread_pool.rejection_policy="Run"/>

GigaSpacesGigaSpaces

• JavaSpaces implementation• gigaspaces.com• OpenSpaces

– JavaSpaces implementation– Spring configuration– OpenSource

• Enterprise DataGrid– Map interface– Queries– Lifecycle listeners– Etc.– Commercial

GigaSpaces XAPGigaSpaces XAP

• XAP – eXtreme Application Platform– Kind of application server– Processing Units have strongly defined

directory structure (like container)– Total solution

• Relies on “OpenSpaces”• Commercial

– Start-ups special free license

GigaSpaces XAPGigaSpaces XAP

OpenTerracottaOpenTerracotta

•JVM is taking care of cross-platform, garbage collection, threading, etc.•Terracotta takes clustering concern out to the JVM

• Clustered JVM semantics• OpenSource

– terracotta.org

• Network Attached Memory– Looks like RAM to the application– Runs both in JVM level (JVM plugin) and

as separate process• Two level cache

JVM Level SimulationJVM Level Simulation

• JVM abstracts multi-platform concerns• It should also abstract multi-nodes

concerns– Terracotta adds it to the JVM

• Simulation of single JVM semantics:– Garbage collection– References– Threads synchronization– Object identity

• Bytecode instrumentation is used to mimic JVM behavior

• Currently supports only Sun’s JVM– Support for IBM and JRockIt planned soon

• Features– Low development impact - no in-advance

clustering planning needed– Linear scalability– No APIs– Declarative - marking what is clustered– No serialization

OpenTerracotta ArchitectureOpenTerracotta Architecture

• The Client Nodes - run on a standard JVM – Terracotta is installed to the JVM

• The Terracotta Server Cluster - provides the clustering intelligence – Each server is a Java process– One Active Server – One or many Passive Servers

• Shared Storage - share the state for the passive server(s)

• Server/Client architecture considered by some as the drawback of Terracotta

Terracotta Client/ServerTerracotta Client/Server

Terracotta DemoTerracotta Demo

Breaking The Clustering Limits @ AlphaCSP JavaEdge 2007

Technology

Transcript of Breaking The Clustering Limits @ AlphaCSP JavaEdge 2007

1 OPTIMAL CLUSTERING PROBLEMS - math.tu-dresden.decapad/TESTS/Clustering/FOR_BENCH_12… · 1 OPTIMAL CLUSTERING PROBLEMS Optimal clustering problem. Given two (irregular) objects

Chapter19 Clustering Analysis. Content Similarity coefficient Hierarchical clustering analysis Dynamic clustering analysis Ordered sample clustering analysis.

Clustering in Ratemaking: Applications in Territories ... · Clustering in Ratemaking: Applications in Territories Clustering OVERVIEW OF CLUSTERING ¾Purpose of Clustering in Insurance

Affinity Clustering: Hierarchical Clustering at Scalepapers.nips.cc/paper/7262-affinity-clustering-hierarchical-clustering-at-scale.pdf · Afﬁnity Clustering: Hierarchical Clustering

Ward’s Hierarchical Clustering Method: Clustering ... · Ward’s Hierarchical Clustering Method: Clustering Criterion and Agglomerative Algorithm Fionn Murtagh (1) and Pierre Legendre

Guest Lecture: Clusteringcvml.ist.ac.at/talks/clustering-core2018.pdfsingle linkage clustering, complete linkage clustering, average linkage clustering Graph-based clustering spectral

Iterative Reclassification in Agglomerative Clustering of... · Iterative Reclassification in Agglomerative Clustering ... clustering for finding improved ... flat clustering

Java For The Cloud Presentation @ AlphaCSP's JavaEdge 2008

Tutorial 8 Clustering 1. General Methods –Unsupervised Clustering Hierarchical clustering K-means clustering Expression data –GEO –UCSC –ArrayExpress.

Segmentation and Clustering · – Divisive and hierarchical clustering – k-means clustering – Mean shift clustering – Graph cuts •Applications – Image processing, object

Clustering k-mean clustering

Clustering Supervised vs. Unsupervised Learning Examples of clustering in Web IR Characteristics of clustering Clustering algorithms Cluster Labeling 1.

Ward’s Hierarchical Clustering Method: Clustering ...

Clustering. 2 Outline Introduction K-means clustering Hierarchical clustering: COBWEB.

LNCS 3776 - Data Clustering: A User’s Dilemmabiometrics.cse.msu.edu/Publications/Clustering/JainLawClustering05… · Data Clustering: A User’s Dilemma 3 performing clustering,

Clustering Algorithms for Numerical Data Sets. Contents 1.Data Clustering Introduction 2.Hierarchical Clustering Algorithms 3.Partitional Data Clustering.

Clustering III. Lecture outline Soft (model-based) clustering and EM algorithm Clustering aggregation [A. Gionis, H. Mannila, P. Tsaparas: Clustering.

BIRCH: Balanced Iterative Reducing and Clustering Using Hierarchies A hierarchical clustering method. It introduces two concepts : Clustering feature Clustering.

Introduction to Web Clustering - Università degli Studi ... · Introduction to Web Clustering Some Web Clustering engines ... for Web Clustering Web data ... for Web Clustering Classic

Bi-Clustering Jinze Liu. Outline The Curse of Dimensionality Co-Clustering Partition-based hard clustering Subspace-Clustering Pattern-based 2.